./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.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/02_inc_cas.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 ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 --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:52:16,687 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-18 14:52:16,740 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-18 14:52:16,747 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-18 14:52:16,747 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-18 14:52:16,781 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-18 14:52:16,782 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-18 14:52:16,782 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-18 14:52:16,783 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-18 14:52:16,783 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-18 14:52:16,784 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-18 14:52:16,784 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-18 14:52:16,785 INFO L153 SettingsManager]: * Use SBE=true [2024-10-18 14:52:16,787 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-18 14:52:16,787 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-18 14:52:16,787 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-18 14:52:16,788 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-18 14:52:16,788 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-18 14:52:16,788 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-18 14:52:16,789 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-18 14:52:16,790 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-18 14:52:16,791 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-18 14:52:16,791 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-18 14:52:16,795 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-18 14:52:16,796 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-18 14:52:16,796 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-18 14:52:16,796 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-18 14:52:16,796 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-18 14:52:16,796 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-18 14:52:16,797 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-18 14:52:16,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 14:52:16,797 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-18 14:52:16,797 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-18 14:52:16,798 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-18 14:52:16,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-18 14:52:16,798 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-18 14:52:16,799 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-18 14:52:16,799 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-18 14:52:16,800 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-18 14:52:16,800 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-18 14:52:16,801 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-18 14:52:16,801 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 -> ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 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:52:17,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-18 14:52:17,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-18 14:52:17,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-18 14:52:17,130 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-18 14:52:17,130 INFO L274 PluginConnector]: CDTParser initialized [2024-10-18 14:52:17,132 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2024-10-18 14:52:18,596 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-18 14:52:18,848 INFO L384 CDTParser]: Found 1 translation units. [2024-10-18 14:52:18,849 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2024-10-18 14:52:18,864 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/a4f606252/d2e36dbd28ba4779991dfe0cc055d4f5/FLAG7791c051d [2024-10-18 14:52:19,181 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/a4f606252/d2e36dbd28ba4779991dfe0cc055d4f5 [2024-10-18 14:52:19,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-18 14:52:19,185 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-18 14:52:19,186 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-18 14:52:19,186 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-18 14:52:19,191 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-18 14:52:19,191 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 02:52:19" (1/1) ... [2024-10-18 14:52:19,192 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51b5974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:52:19, skipping insertion in model container [2024-10-18 14:52:19,192 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 02:52:19" (1/1) ... [2024-10-18 14:52:19,228 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-18 14:52:19,587 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/02_inc_cas.i[30873,30886] [2024-10-18 14:52:19,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 14:52:19,605 INFO L200 MainTranslator]: Completed pre-run [2024-10-18 14:52:19,654 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/02_inc_cas.i[30873,30886] [2024-10-18 14:52:19,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 14:52:19,687 INFO L204 MainTranslator]: Completed translation [2024-10-18 14:52:19,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:52:19 WrapperNode [2024-10-18 14:52:19,688 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-18 14:52:19,689 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-18 14:52:19,689 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-18 14:52:19,689 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-18 14:52:19,696 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:52:19" (1/1) ... [2024-10-18 14:52:19,708 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:52:19" (1/1) ... [2024-10-18 14:52:19,726 INFO L138 Inliner]: procedures = 170, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 72 [2024-10-18 14:52:19,727 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-18 14:52:19,727 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-18 14:52:19,727 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-18 14:52:19,727 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-18 14:52:19,736 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:52:19" (1/1) ... [2024-10-18 14:52:19,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:52:19" (1/1) ... [2024-10-18 14:52:19,739 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:52:19" (1/1) ... [2024-10-18 14:52:19,740 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:52:19" (1/1) ... [2024-10-18 14:52:19,747 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:52:19" (1/1) ... [2024-10-18 14:52:19,751 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:52:19" (1/1) ... [2024-10-18 14:52:19,752 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:52:19" (1/1) ... [2024-10-18 14:52:19,753 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:52:19" (1/1) ... [2024-10-18 14:52:19,755 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-18 14:52:19,759 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-18 14:52:19,760 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-18 14:52:19,760 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-18 14:52:19,761 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:52:19" (1/1) ... [2024-10-18 14:52:19,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 14:52:19,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:52:19,802 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:52:19,808 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:52:19,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-18 14:52:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-18 14:52:19,851 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-18 14:52:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-18 14:52:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-18 14:52:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-18 14:52:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-18 14:52:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-18 14:52:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-18 14:52:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-18 14:52:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-18 14:52:19,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-18 14:52:19,853 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:52:20,025 INFO L238 CfgBuilder]: Building ICFG [2024-10-18 14:52:20,051 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-18 14:52:20,214 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-18 14:52:20,214 INFO L287 CfgBuilder]: Performing block encoding [2024-10-18 14:52:20,331 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-18 14:52:20,331 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-18 14:52:20,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 02:52:20 BoogieIcfgContainer [2024-10-18 14:52:20,332 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-18 14:52:20,335 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-18 14:52:20,335 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-18 14:52:20,338 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-18 14:52:20,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.10 02:52:19" (1/3) ... [2024-10-18 14:52:20,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46389b8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 02:52:20, skipping insertion in model container [2024-10-18 14:52:20,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:52:19" (2/3) ... [2024-10-18 14:52:20,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46389b8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 02:52:20, skipping insertion in model container [2024-10-18 14:52:20,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 02:52:20" (3/3) ... [2024-10-18 14:52:20,343 INFO L112 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2024-10-18 14:52:20,358 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-18 14:52:20,359 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-18 14:52:20,360 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-18 14:52:20,416 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-18 14:52:20,463 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 14:52:20,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 14:52:20,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:52:20,466 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:52:20,467 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:52:20,563 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 14:52:20,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:52:20,585 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-10-18 14:52:20,591 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;@3b98914a, 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:52:20,592 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 14:52:20,930 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 14:52:20,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:52:20,932 INFO L85 PathProgramCache]: Analyzing trace with hash 559333503, now seen corresponding path program 1 times [2024-10-18 14:52:20,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 14:52:20,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679228976] [2024-10-18 14:52:20,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:52:20,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:52:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:52:21,134 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:52:21,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 14:52:21,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679228976] [2024-10-18 14:52:21,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679228976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 14:52:21,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 14:52:21,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 14:52:21,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861771441] [2024-10-18 14:52:21,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 14:52:21,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 14:52:21,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 14:52:21,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 14:52:21,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 14:52:21,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:21,179 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:52:21,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:52:21,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:21,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:21,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-18 14:52:21,491 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 14:52:21,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:52:21,492 INFO L85 PathProgramCache]: Analyzing trace with hash 555599738, now seen corresponding path program 1 times [2024-10-18 14:52:21,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 14:52:21,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698118785] [2024-10-18 14:52:21,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:52:21,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:52:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:52:22,262 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:52:22,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 14:52:22,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698118785] [2024-10-18 14:52:22,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698118785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 14:52:22,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 14:52:22,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-18 14:52:22,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815833748] [2024-10-18 14:52:22,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 14:52:22,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-18 14:52:22,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 14:52:22,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-18 14:52:22,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-18 14:52:22,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:22,273 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:52:22,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 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:52:22,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:22,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:22,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:22,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:52:22,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-18 14:52:22,722 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 14:52:22,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:52:22,723 INFO L85 PathProgramCache]: Analyzing trace with hash 812658582, now seen corresponding path program 1 times [2024-10-18 14:52:22,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 14:52:22,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109124597] [2024-10-18 14:52:22,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:52:22,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:52:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:52:23,715 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 14:52:23,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 14:52:23,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109124597] [2024-10-18 14:52:23,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109124597] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 14:52:23,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388350187] [2024-10-18 14:52:23,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:52:23,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 14:52:23,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:52:23,801 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:52:23,804 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:52:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:52:23,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-18 14:52:23,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:52:23,996 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 14:52:23,997 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:52:24,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 106 [2024-10-18 14:52:24,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 40 [2024-10-18 14:52:24,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2024-10-18 14:52:24,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 21 [2024-10-18 14:52:26,678 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 14:52:26,678 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 14:52:26,871 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (mod |c_thr1Thread1of1ForFork0_~v~0#1| 4294967296) (mod (select .cse4 |c_~#value~0.offset|) 4294967296))) (.cse2 (* 4294967296 (div |c_thr1Thread1of1ForFork0_~v~0#1| 4294967296)))) (and (or (not .cse0) (let ((.cse1 (select (select (let ((.cse3 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| |c_thr1Thread1of1ForFork0_~vn~0#1|)))) (store .cse3 |c_thr1Thread1of1ForFork0_~#casret~0#1.base| (store (select .cse3 |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse1 4294967296) 4294967296) |c_thr1Thread1of1ForFork0_~v~0#1|) (+ .cse1 .cse2)))) (or .cse0 (forall ((v_DerPreprocessor_6 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_6 |c_thr1Thread1of1ForFork0_~#casret~0#1.offset|) 4294967296) 0) (let ((.cse5 (select (select (store |c_#memory_int| |c_thr1Thread1of1ForFork0_~#casret~0#1.base| v_DerPreprocessor_6) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse5 4294967296) 4294967296) |c_thr1Thread1of1ForFork0_~v~0#1|) (+ .cse2 .cse5))))))))) is different from false [2024-10-18 14:52:27,650 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-10-18 14:52:27,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388350187] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 14:52:27,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 14:52:27,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2024-10-18 14:52:27,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159071566] [2024-10-18 14:52:27,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 14:52:27,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-18 14:52:27,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 14:52:27,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-18 14:52:27,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=686, Unknown=10, NotChecked=56, Total=930 [2024-10-18 14:52:27,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:27,658 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:52:27,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 30 states have internal predecessors, (53), 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:52:27,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:27,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:52:27,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:28,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:28,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:52:28,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-18 14:52:28,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-18 14:52:28,271 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:52:28,457 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,SelfDestructingSolverStorable2 [2024-10-18 14:52:28,469 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-18 14:52:28,472 INFO L312 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2024-10-18 14:52:28,476 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 14:52:28,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 14:52:28,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:52:28,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:52:28,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:52:28,514 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 14:52:28,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:52:28,515 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 14:52:28,527 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;@3b98914a, 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:52:28,528 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 14:52:28,637 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 14:52:28,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:52:28,638 INFO L85 PathProgramCache]: Analyzing trace with hash 648589722, now seen corresponding path program 1 times [2024-10-18 14:52:28,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 14:52:28,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718376339] [2024-10-18 14:52:28,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:52:28,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:52:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:52:28,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 14:52:28,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 14:52:28,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718376339] [2024-10-18 14:52:28,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718376339] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 14:52:28,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 14:52:28,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 14:52:28,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656939279] [2024-10-18 14:52:28,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 14:52:28,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 14:52:28,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 14:52:28,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 14:52:28,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 14:52:28,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:28,653 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:52:28,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:52:28,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:28,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:28,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-18 14:52:28,812 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 14:52:28,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:52:28,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1355408853, now seen corresponding path program 1 times [2024-10-18 14:52:28,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 14:52:28,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999423186] [2024-10-18 14:52:28,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:52:28,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:52:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:52:29,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 14:52:29,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 14:52:29,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999423186] [2024-10-18 14:52:29,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999423186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 14:52:29,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 14:52:29,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-18 14:52:29,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124075802] [2024-10-18 14:52:29,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 14:52:29,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-18 14:52:29,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 14:52:29,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-18 14:52:29,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-18 14:52:29,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:29,119 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:52:29,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 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:52:29,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:29,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:29,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:29,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:52:29,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-18 14:52:29,279 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 14:52:29,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:52:29,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1174367672, now seen corresponding path program 1 times [2024-10-18 14:52:29,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 14:52:29,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774235284] [2024-10-18 14:52:29,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:52:29,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:52:29,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:52:29,293 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:52:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:52:29,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 14:52:29,322 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 14:52:29,322 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-18 14:52:29,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-18 14:52:29,325 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-18 14:52:29,325 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-10-18 14:52:29,326 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 14:52:29,326 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-18 14:52:29,351 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-18 14:52:29,353 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 14:52:29,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 14:52:29,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:52:29,355 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:52:29,357 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:52:29,394 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 14:52:29,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:52:29,395 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 14:52:29,395 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;@3b98914a, 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:52:29,396 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 14:52:30,067 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 14:52:30,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:52:30,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1146461421, now seen corresponding path program 1 times [2024-10-18 14:52:30,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 14:52:30,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257557826] [2024-10-18 14:52:30,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:52:30,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:52:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:52:30,079 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 14:52:30,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 14:52:30,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257557826] [2024-10-18 14:52:30,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257557826] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 14:52:30,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 14:52:30,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 14:52:30,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134044671] [2024-10-18 14:52:30,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 14:52:30,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 14:52:30,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 14:52:30,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 14:52:30,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 14:52:30,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:30,082 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:52:30,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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:52:30,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:30,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:30,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-18 14:52:30,527 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 14:52:30,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:52:30,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1959299849, now seen corresponding path program 1 times [2024-10-18 14:52:30,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 14:52:30,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361318249] [2024-10-18 14:52:30,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:52:30,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:52:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:52:30,927 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 14:52:30,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 14:52:30,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361318249] [2024-10-18 14:52:30,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361318249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 14:52:30,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 14:52:30,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-18 14:52:30,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719253540] [2024-10-18 14:52:30,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 14:52:30,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-18 14:52:30,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 14:52:30,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-18 14:52:30,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-18 14:52:30,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:30,932 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:52:30,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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:52:30,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:30,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:31,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:31,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:52:31,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-18 14:52:31,191 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 14:52:31,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:52:31,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1017090324, now seen corresponding path program 1 times [2024-10-18 14:52:31,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 14:52:31,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811679895] [2024-10-18 14:52:31,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:52:31,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:52:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:52:31,755 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:52:31,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 14:52:31,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811679895] [2024-10-18 14:52:31,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811679895] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 14:52:31,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536681686] [2024-10-18 14:52:31,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:52:31,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 14:52:31,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:52:31,758 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:52:31,760 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:52:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:52:31,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-18 14:52:31,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:52:31,903 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-18 14:52:31,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-18 14:52:32,038 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 35 treesize of output 18 [2024-10-18 14:52:32,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-18 14:52:32,286 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 14:52:32,287 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:52:32,464 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-10-18 14:52:32,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 28 [2024-10-18 14:52:32,596 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:52:32,596 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 14:52:33,649 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_~#value~0.base|)) (.cse14 (mod |c_thr1Thread1of2ForFork0_~v~0#1| 4294967296))) (let ((.cse5 (+ .cse14 1)) (.cse6 (= (mod (select .cse13 |c_~#value~0.offset|) 4294967296) .cse14))) (and (or (forall ((v_ArrVal_124 Int) (|v_thr1Thread2of2ForFork0_~#casret~0#1.base_13| Int) (v_DerPreprocessor_8 (Array Int Int)) (|thr1Thread2of2ForFork0_~#casret~0#1.offset| Int)) (let ((.cse2 (store |c_#memory_int| |c_thr1Thread1of2ForFork0_~#casret~0#1.base| v_DerPreprocessor_8))) (let ((.cse3 (select .cse2 |c_~#value~0.base|))) (let ((.cse4 (select .cse3 |c_~#value~0.offset|))) (let ((.cse0 (mod .cse4 4294967296))) (or (< .cse0 (mod (select (select (let ((.cse1 (store .cse2 |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| (+ .cse4 1))))) (store .cse1 |v_thr1Thread2of2ForFork0_~#casret~0#1.base_13| (store (select .cse1 |v_thr1Thread2of2ForFork0_~#casret~0#1.base_13|) |thr1Thread2of2ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (< .cse0 .cse5) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_~#casret~0#1.base| v_ArrVal_124) |v_thr1Thread2of2ForFork0_~#casret~0#1.base_13|) 0)))))))) .cse6) (or (forall ((v_ArrVal_124 Int) (|v_thr1Thread2of2ForFork0_~#casret~0#1.base_13| Int) (|thr1Thread1of2ForFork0_~#casret~0#1.offset| Int) (|thr1Thread2of2ForFork0_~#casret~0#1.offset| Int)) (let ((.cse12 (store |c_#memory_int| |c_~#value~0.base| (store .cse13 |c_~#value~0.offset| (+ |c_thr1Thread1of2ForFork0_~v~0#1| 1))))) (let ((.cse9 (store (select .cse12 |c_thr1Thread1of2ForFork0_~#casret~0#1.base|) |thr1Thread1of2ForFork0_~#casret~0#1.offset| 1))) (let ((.cse10 (select (store .cse12 |c_thr1Thread1of2ForFork0_~#casret~0#1.base| .cse9) |c_~#value~0.base|))) (let ((.cse11 (select .cse10 |c_~#value~0.offset|))) (let ((.cse7 (mod .cse11 4294967296))) (or (< .cse7 .cse5) (< .cse7 (mod (select (select (let ((.cse8 (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_~#casret~0#1.base| .cse9) |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| (+ .cse11 1))))) (store .cse8 |v_thr1Thread2of2ForFork0_~#casret~0#1.base_13| (store (select .cse8 |v_thr1Thread2of2ForFork0_~#casret~0#1.base_13|) |thr1Thread2of2ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_~#casret~0#1.base| v_ArrVal_124) |v_thr1Thread2of2ForFork0_~#casret~0#1.base_13|) 0))))))))) (not .cse6))))) is different from false [2024-10-18 14:52:40,304 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:52:40,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536681686] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 14:52:40,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 14:52:40,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 36 [2024-10-18 14:52:40,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610916086] [2024-10-18 14:52:40,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 14:52:40,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-18 14:52:40,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 14:52:40,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-18 14:52:40,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1056, Unknown=16, NotChecked=68, Total=1332 [2024-10-18 14:52:40,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:40,312 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:52:40,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 36 states have internal predecessors, (71), 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:52:40,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:40,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:52:40,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:41,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:41,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:52:41,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-18 14:52:41,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-18 14:52:41,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-18 14:52:41,384 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 14:52:41,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:52:41,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1830282799, now seen corresponding path program 1 times [2024-10-18 14:52:41,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 14:52:41,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642722613] [2024-10-18 14:52:41,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:52:41,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:52:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:52:41,411 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:52:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:52:41,430 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 14:52:41,431 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 14:52:41,431 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-18 14:52:41,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-18 14:52:41,433 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-18 14:52:41,433 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-10-18 14:52:41,433 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 14:52:41,434 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-18 14:52:41,457 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-18 14:52:41,460 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 14:52:41,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 14:52:41,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:52:41,463 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:52:41,465 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:52:41,504 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 14:52:41,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:52:41,506 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-10-18 14:52:41,506 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;@3b98914a, 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:52:41,506 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 14:52:42,938 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 14:52:42,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:52:42,939 INFO L85 PathProgramCache]: Analyzing trace with hash 289691451, now seen corresponding path program 1 times [2024-10-18 14:52:42,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 14:52:42,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328173320] [2024-10-18 14:52:42,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:52:42,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:52:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:52:42,955 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 14:52:42,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 14:52:42,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328173320] [2024-10-18 14:52:42,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328173320] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 14:52:42,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 14:52:42,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 14:52:42,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696555015] [2024-10-18 14:52:42,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 14:52:42,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 14:52:42,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 14:52:42,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 14:52:42,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 14:52:42,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:42,961 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:52:42,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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:52:42,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:43,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:43,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-18 14:52:43,662 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 14:52:43,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:52:43,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1893296980, now seen corresponding path program 1 times [2024-10-18 14:52:43,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 14:52:43,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861019429] [2024-10-18 14:52:43,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:52:43,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:52:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:52:44,416 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 14:52:44,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 14:52:44,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861019429] [2024-10-18 14:52:44,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861019429] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 14:52:44,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 14:52:44,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-18 14:52:44,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381742574] [2024-10-18 14:52:44,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 14:52:44,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-18 14:52:44,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 14:52:44,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-18 14:52:44,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-18 14:52:44,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:44,425 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:52:44,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 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:52:44,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:44,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:44,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:44,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:52:44,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-18 14:52:44,951 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 14:52:44,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:52:44,953 INFO L85 PathProgramCache]: Analyzing trace with hash -708586065, now seen corresponding path program 1 times [2024-10-18 14:52:44,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 14:52:44,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029049063] [2024-10-18 14:52:44,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:52:44,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:52:45,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:52:45,729 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 14:52:45,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 14:52:45,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029049063] [2024-10-18 14:52:45,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029049063] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 14:52:45,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717928682] [2024-10-18 14:52:45,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:52:45,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 14:52:45,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:52:45,732 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:52:45,734 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:52:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:52:45,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-18 14:52:45,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:52:45,937 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-18 14:52:45,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-18 14:52:46,077 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 35 treesize of output 18 [2024-10-18 14:52:46,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-18 14:52:46,348 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 14:52:46,348 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:52:46,529 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-10-18 14:52:46,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 28 [2024-10-18 14:52:46,671 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 14:52:46,671 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 14:52:46,754 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse3 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= .cse1 (mod (select .cse3 |c_~#value~0.offset|) 4294967296)))) (and (or (not .cse0) (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (< .cse1 (mod (select (select (let ((.cse2 (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| |c_thr1Thread2of3ForFork0_~vn~0#1|)))) (store .cse2 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse2 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (or .cse0 (forall ((v_DerPreprocessor_9 (Array Int Int))) (< .cse1 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_9) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) is different from false [2024-10-18 14:52:52,615 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 14:52:52,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717928682] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 14:52:52,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 14:52:52,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 37 [2024-10-18 14:52:52,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846861261] [2024-10-18 14:52:52,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 14:52:52,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-18 14:52:52,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 14:52:52,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-18 14:52:52,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1075, Unknown=9, NotChecked=68, Total=1332 [2024-10-18 14:52:52,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:52,621 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:52:52,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.3783783783783785) internal successors, (88), 37 states have internal predecessors, (88), 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:52:52,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:52,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:52:52,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:54,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:54,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:52:54,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-18 14:52:54,762 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:52:54,949 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,SelfDestructingSolverStorable12 [2024-10-18 14:52:54,949 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 14:52:54,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:52:54,950 INFO L85 PathProgramCache]: Analyzing trace with hash -857142964, now seen corresponding path program 1 times [2024-10-18 14:52:54,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 14:52:54,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387311774] [2024-10-18 14:52:54,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:52:54,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:52:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:52:55,671 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-18 14:52:55,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 14:52:55,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387311774] [2024-10-18 14:52:55,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387311774] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 14:52:55,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769906481] [2024-10-18 14:52:55,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:52:55,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 14:52:55,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:52:55,674 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:52:55,675 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:52:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:52:55,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-18 14:52:55,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:52:55,814 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 14:52:55,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2024-10-18 14:52:55,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-18 14:52:55,831 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 32 [2024-10-18 14:52:55,835 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:52:55,836 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 36 treesize of output 17 [2024-10-18 14:52:55,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-18 14:52:55,852 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 15 treesize of output 7 [2024-10-18 14:52:56,001 INFO L349 Elim1Store]: treesize reduction 55, result has 24.7 percent of original size [2024-10-18 14:52:56,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 54 [2024-10-18 14:52:56,018 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 14:52:56,084 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-18 14:52:56,084 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 14 treesize of output 13 [2024-10-18 14:52:56,149 INFO L349 Elim1Store]: treesize reduction 51, result has 22.7 percent of original size [2024-10-18 14:52:56,149 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 1 case distinctions, treesize of input 26 treesize of output 26 [2024-10-18 14:52:56,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-18 14:52:56,157 INFO L349 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2024-10-18 14:52:56,157 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 1 case distinctions, treesize of input 19 treesize of output 1 [2024-10-18 14:52:56,228 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 14:52:56,228 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 14:52:56,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769906481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 14:52:56,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-18 14:52:56,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 19 [2024-10-18 14:52:56,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631193732] [2024-10-18 14:52:56,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 14:52:56,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-18 14:52:56,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 14:52:56,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-18 14:52:56,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2024-10-18 14:52:56,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:56,238 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:52:56,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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:52:56,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:56,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:52:56,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-10-18 14:52:56,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:59,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:52:59,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:52:59,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-18 14:52:59,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-18 14:52:59,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-18 14:53:00,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 14:53:00,017 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 14:53:00,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:53:00,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1144401957, now seen corresponding path program 1 times [2024-10-18 14:53:00,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 14:53:00,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775545339] [2024-10-18 14:53:00,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:53:00,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:53:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:53:02,520 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 14:53:02,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 14:53:02,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775545339] [2024-10-18 14:53:02,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775545339] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 14:53:02,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958689610] [2024-10-18 14:53:02,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:53:02,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 14:53:02,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:53:02,522 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:53:02,523 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:53:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:53:02,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-18 14:53:02,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:53:02,692 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-18 14:53:02,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-18 14:53:02,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-18 14:53:02,789 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-18 14:53:02,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-18 14:53:02,918 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 14:53:02,924 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 14:53:02,997 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-18 14:53:02,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-18 14:53:03,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-18 14:53:03,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 48 [2024-10-18 14:53:03,123 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 17 treesize of output 15 [2024-10-18 14:53:03,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 22 [2024-10-18 14:53:03,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-18 14:53:03,226 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 14:53:03,226 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 14:53:03,472 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (mod (select .cse2 |c_~#value~0.offset|) 4294967296) (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296)))) (and (or (forall ((v_DerPreprocessor_18 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (or (< 0 (mod (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_18) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_18 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0))) .cse0) (or (let ((.cse1 (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_~#value~0.base|))) (and (or (not .cse1) (forall ((v_ArrVal_380 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (< 0 (mod (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| v_ArrVal_380)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)))) (or (forall ((v_ArrVal_380 Int) (v_DerPreprocessor_17 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (< 0 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_17) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| v_ArrVal_380)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))) .cse1))) (not .cse0))))) is different from false [2024-10-18 14:53:04,311 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:53:04,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 14:53:04,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 262 treesize of output 237 [2024-10-18 14:53:04,332 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 14:53:04,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 58 treesize of output 54 [2024-10-18 14:53:04,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 14:53:04,353 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 68 [2024-10-18 14:53:04,357 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2024-10-18 14:53:06,691 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 1 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 14:53:06,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958689610] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 14:53:06,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 14:53:06,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 10, 12] total 44 [2024-10-18 14:53:06,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7986612] [2024-10-18 14:53:06,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 14:53:06,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-10-18 14:53:06,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 14:53:06,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-18 14:53:06,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1749, Unknown=9, NotChecked=84, Total=1980 [2024-10-18 14:53:06,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:06,700 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:53:06,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.2888888888888888) internal successors, (103), 44 states have internal predecessors, (103), 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:53:06,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:06,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:53:06,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-10-18 14:53:06,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-18 14:53:06,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:09,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:09,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 14:53:09,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-10-18 14:53:09,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-18 14:53:09,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-18 14:53:09,751 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 14:53:09,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-18 14:53:09,939 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 14:53:09,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:53:09,940 INFO L85 PathProgramCache]: Analyzing trace with hash -830412570, now seen corresponding path program 2 times [2024-10-18 14:53:09,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 14:53:09,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775887] [2024-10-18 14:53:09,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:53:09,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:53:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:53:10,898 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-18 14:53:10,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 14:53:10,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775887] [2024-10-18 14:53:10,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775887] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 14:53:10,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441908657] [2024-10-18 14:53:10,899 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-18 14:53:10,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 14:53:10,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:53:10,900 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 14:53:10,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-18 14:53:11,004 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-18 14:53:11,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 14:53:11,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-18 14:53:11,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:53:11,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-18 14:53:11,245 INFO L349 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2024-10-18 14:53:11,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 85 treesize of output 92 [2024-10-18 14:53:11,704 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-18 14:53:11,704 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 14:53:12,052 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-18 14:53:12,053 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 62 treesize of output 1 [2024-10-18 14:53:12,054 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-18 14:53:12,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441908657] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 14:53:12,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 14:53:12,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 28 [2024-10-18 14:53:12,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119592801] [2024-10-18 14:53:12,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 14:53:12,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-18 14:53:12,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 14:53:12,176 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 44 treesize of output 32 [2024-10-18 14:53:28,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1968010962, now seen corresponding path program 1 times [2024-10-18 14:53:28,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:53:28,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:53:28,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-18 14:53:28,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16 [2024-10-18 14:53:28,989 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: Cannot name open terms 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: Cannot name open terms at de.uni_freiburg.informatik.ultimate.logic.NoopScript.annotate(NoopScript.java:471) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.annotate(WrapperScript.java:282) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.annotate(WrapperScript.java:282) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAssertCodeBlocks.annotateAndAssertTerm(AnnotateAndAssertCodeBlocks.java:192) 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 14:53:28,994 INFO L158 Benchmark]: Toolchain (without parser) took 69808.82ms. Allocated memory was 161.5MB in the beginning and 497.0MB in the end (delta: 335.5MB). Free memory was 128.8MB in the beginning and 368.6MB in the end (delta: -239.9MB). Peak memory consumption was 95.8MB. Max. memory is 16.1GB. [2024-10-18 14:53:28,994 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 161.5MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-18 14:53:28,994 INFO L158 Benchmark]: CACSL2BoogieTranslator took 501.87ms. Allocated memory is still 161.5MB. Free memory was 128.8MB in the beginning and 107.7MB in the end (delta: 21.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-18 14:53:28,994 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.80ms. Allocated memory is still 161.5MB. Free memory was 107.7MB in the beginning and 105.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-18 14:53:28,994 INFO L158 Benchmark]: Boogie Preprocessor took 28.38ms. Allocated memory is still 161.5MB. Free memory was 105.6MB in the beginning and 103.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-18 14:53:28,995 INFO L158 Benchmark]: RCFGBuilder took 573.04ms. Allocated memory is still 161.5MB. Free memory was 103.9MB in the beginning and 114.1MB in the end (delta: -10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-18 14:53:28,995 INFO L158 Benchmark]: TraceAbstraction took 68658.71ms. Allocated memory was 161.5MB in the beginning and 497.0MB in the end (delta: 335.5MB). Free memory was 113.0MB in the beginning and 368.6MB in the end (delta: -255.6MB). Peak memory consumption was 82.2MB. Max. memory is 16.1GB. [2024-10-18 14:53:28,996 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.20ms. Allocated memory is still 161.5MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 501.87ms. Allocated memory is still 161.5MB. Free memory was 128.8MB in the beginning and 107.7MB in the end (delta: 21.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.80ms. Allocated memory is still 161.5MB. Free memory was 107.7MB in the beginning and 105.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.38ms. Allocated memory is still 161.5MB. Free memory was 105.6MB in the beginning and 103.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 573.04ms. Allocated memory is still 161.5MB. Free memory was 103.9MB in the beginning and 114.1MB in the end (delta: -10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 68658.71ms. Allocated memory was 161.5MB in the beginning and 497.0MB in the end (delta: 335.5MB). Free memory was 113.0MB in the beginning and 368.6MB in the end (delta: -255.6MB). Peak memory consumption was 82.2MB. 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: 288, independent: 256, independent conditional: 94, independent unconditional: 162, dependent: 32, dependent conditional: 22, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 266, independent: 256, independent conditional: 94, independent unconditional: 162, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 266, independent: 256, independent conditional: 94, independent unconditional: 162, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 266, independent: 256, independent conditional: 94, independent unconditional: 162, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 276, independent: 256, independent conditional: 94, independent unconditional: 162, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 276, independent: 256, independent conditional: 24, independent unconditional: 232, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 276, independent: 256, independent conditional: 24, independent unconditional: 232, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 136, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 136, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 891, independent: 336, independent conditional: 0, independent unconditional: 336, dependent: 555, dependent conditional: 0, dependent unconditional: 555, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 276, independent: 130, independent conditional: 24, independent unconditional: 106, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 136, unknown conditional: 0, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 70, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 276, independent: 256, independent conditional: 94, independent unconditional: 162, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 276, independent: 256, independent conditional: 24, independent unconditional: 232, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 276, independent: 256, independent conditional: 24, independent unconditional: 232, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 136, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 136, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 891, independent: 336, independent conditional: 0, independent unconditional: 336, dependent: 555, dependent conditional: 0, dependent unconditional: 555, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 276, independent: 130, independent conditional: 24, independent unconditional: 106, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 136, unknown conditional: 0, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 70 ], Independence queries for same thread: 22, Persistent sets #1 benchmarks: Persistent set computation time: 0.9s, Number of persistent set computation: 38, Number of trivial persistent sets: 33, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 165, independent: 155, independent conditional: 0, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 288, independent: 256, independent conditional: 94, independent unconditional: 162, dependent: 32, dependent conditional: 22, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 266, independent: 256, independent conditional: 94, independent unconditional: 162, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 266, independent: 256, independent conditional: 94, independent unconditional: 162, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 266, independent: 256, independent conditional: 94, independent unconditional: 162, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 276, independent: 256, independent conditional: 94, independent unconditional: 162, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 276, independent: 256, independent conditional: 24, independent unconditional: 232, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 276, independent: 256, independent conditional: 24, independent unconditional: 232, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 136, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 136, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 891, independent: 336, independent conditional: 0, independent unconditional: 336, dependent: 555, dependent conditional: 0, dependent unconditional: 555, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 276, independent: 130, independent conditional: 24, independent unconditional: 106, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 136, unknown conditional: 0, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 70, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 276, independent: 256, independent conditional: 94, independent unconditional: 162, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 276, independent: 256, independent conditional: 24, independent unconditional: 232, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 276, independent: 256, independent conditional: 24, independent unconditional: 232, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 136, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 136, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 891, independent: 336, independent conditional: 0, independent unconditional: 336, dependent: 555, dependent conditional: 0, dependent unconditional: 555, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 276, independent: 130, independent conditional: 24, independent unconditional: 106, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 136, unknown conditional: 0, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 70 ], Independence queries for same thread: 22 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 189, independent: 172, independent conditional: 46, independent unconditional: 126, dependent: 17, dependent conditional: 12, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 177, independent: 172, independent conditional: 46, independent unconditional: 126, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 177, independent: 172, independent conditional: 46, independent unconditional: 126, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 177, independent: 172, independent conditional: 46, independent unconditional: 126, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 182, independent: 172, independent conditional: 46, independent unconditional: 126, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 182, independent: 172, independent conditional: 12, independent unconditional: 160, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 182, independent: 172, independent conditional: 12, independent unconditional: 160, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 259, independent: 98, independent conditional: 0, independent unconditional: 98, dependent: 161, dependent conditional: 0, dependent unconditional: 161, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 182, independent: 73, independent conditional: 12, independent unconditional: 61, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 34, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 182, independent: 172, independent conditional: 46, independent unconditional: 126, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 182, independent: 172, independent conditional: 12, independent unconditional: 160, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 182, independent: 172, independent conditional: 12, independent unconditional: 160, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 259, independent: 98, independent conditional: 0, independent unconditional: 98, dependent: 161, dependent conditional: 0, dependent unconditional: 161, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 182, independent: 73, independent conditional: 12, independent unconditional: 61, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 34 ], Independence queries for same thread: 12, Persistent sets #1 benchmarks: Persistent set computation time: 0.3s, Number of persistent set computation: 17, Number of trivial persistent sets: 16, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 126, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 189, independent: 172, independent conditional: 46, independent unconditional: 126, dependent: 17, dependent conditional: 12, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 177, independent: 172, independent conditional: 46, independent unconditional: 126, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 177, independent: 172, independent conditional: 46, independent unconditional: 126, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 177, independent: 172, independent conditional: 46, independent unconditional: 126, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 182, independent: 172, independent conditional: 46, independent unconditional: 126, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 182, independent: 172, independent conditional: 12, independent unconditional: 160, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 182, independent: 172, independent conditional: 12, independent unconditional: 160, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 259, independent: 98, independent conditional: 0, independent unconditional: 98, dependent: 161, dependent conditional: 0, dependent unconditional: 161, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 182, independent: 73, independent conditional: 12, independent unconditional: 61, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 34, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 182, independent: 172, independent conditional: 46, independent unconditional: 126, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 182, independent: 172, independent conditional: 12, independent unconditional: 160, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 182, independent: 172, independent conditional: 12, independent unconditional: 160, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 259, independent: 98, independent conditional: 0, independent unconditional: 98, dependent: 161, dependent conditional: 0, dependent unconditional: 161, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 182, independent: 73, independent conditional: 12, independent unconditional: 61, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 34 ], Independence queries for same thread: 12 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 562, independent: 510, independent conditional: 145, independent unconditional: 365, dependent: 52, dependent conditional: 33, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 529, independent: 510, independent conditional: 145, independent unconditional: 365, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 529, independent: 510, independent conditional: 145, independent unconditional: 365, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 529, independent: 510, independent conditional: 145, independent unconditional: 365, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 548, independent: 510, independent conditional: 145, independent unconditional: 365, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 548, independent: 510, independent conditional: 51, independent unconditional: 459, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 548, independent: 510, independent conditional: 51, independent unconditional: 459, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 325, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 325, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1148, independent: 365, independent conditional: 0, independent unconditional: 365, dependent: 783, dependent conditional: 0, dependent unconditional: 783, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 548, independent: 204, independent conditional: 51, independent unconditional: 153, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 325, unknown conditional: 0, unknown unconditional: 325] , Statistics on independence cache: Total cache size (in pairs): 325, Positive cache size: 306, Positive conditional cache size: 0, Positive unconditional cache size: 306, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 94, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 548, independent: 510, independent conditional: 145, independent unconditional: 365, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 548, independent: 510, independent conditional: 51, independent unconditional: 459, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 548, independent: 510, independent conditional: 51, independent unconditional: 459, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 325, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 325, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1148, independent: 365, independent conditional: 0, independent unconditional: 365, dependent: 783, dependent conditional: 0, dependent unconditional: 783, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 548, independent: 204, independent conditional: 51, independent unconditional: 153, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 325, unknown conditional: 0, unknown unconditional: 325] , Statistics on independence cache: Total cache size (in pairs): 325, Positive cache size: 306, Positive conditional cache size: 0, Positive unconditional cache size: 306, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 94 ], Independence queries for same thread: 33, Persistent sets #1 benchmarks: Persistent set computation time: 1.2s, Number of persistent set computation: 41, Number of trivial persistent sets: 38, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 379, independent: 360, independent conditional: 0, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 562, independent: 510, independent conditional: 145, independent unconditional: 365, dependent: 52, dependent conditional: 33, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 529, independent: 510, independent conditional: 145, independent unconditional: 365, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 529, independent: 510, independent conditional: 145, independent unconditional: 365, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 529, independent: 510, independent conditional: 145, independent unconditional: 365, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 548, independent: 510, independent conditional: 145, independent unconditional: 365, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 548, independent: 510, independent conditional: 51, independent unconditional: 459, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 548, independent: 510, independent conditional: 51, independent unconditional: 459, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 325, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 325, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1148, independent: 365, independent conditional: 0, independent unconditional: 365, dependent: 783, dependent conditional: 0, dependent unconditional: 783, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 548, independent: 204, independent conditional: 51, independent unconditional: 153, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 325, unknown conditional: 0, unknown unconditional: 325] , Statistics on independence cache: Total cache size (in pairs): 325, Positive cache size: 306, Positive conditional cache size: 0, Positive unconditional cache size: 306, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 94, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 548, independent: 510, independent conditional: 145, independent unconditional: 365, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 548, independent: 510, independent conditional: 51, independent unconditional: 459, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 548, independent: 510, independent conditional: 51, independent unconditional: 459, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 325, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 325, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1148, independent: 365, independent conditional: 0, independent unconditional: 365, dependent: 783, dependent conditional: 0, dependent unconditional: 783, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 548, independent: 204, independent conditional: 51, independent unconditional: 153, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 325, unknown conditional: 0, unknown unconditional: 325] , Statistics on independence cache: Total cache size (in pairs): 325, Positive cache size: 306, Positive conditional cache size: 0, Positive unconditional cache size: 306, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 94 ], Independence queries for same thread: 33 - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Cannot name open terms de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Cannot name open terms: 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 14:53:29,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Forceful destruction successful, exit code 0 [2024-10-18 14:53:29,238 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 14:53:29,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Ended with exit code 0 [2024-10-18 14:53:29,638 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 [2024-10-18 14:53:29,862 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 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/02_inc_cas.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 ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 --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:53:31,876 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-18 14:53:31,946 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf [2024-10-18 14:53:31,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-18 14:53:31,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-18 14:53:31,983 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-18 14:53:31,983 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-18 14:53:31,984 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-18 14:53:31,984 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-18 14:53:31,985 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-18 14:53:31,985 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-18 14:53:31,986 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-18 14:53:31,986 INFO L153 SettingsManager]: * Use SBE=true [2024-10-18 14:53:31,986 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-18 14:53:31,987 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-18 14:53:31,987 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-18 14:53:31,987 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-18 14:53:31,988 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-18 14:53:31,988 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-18 14:53:31,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-18 14:53:31,989 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-18 14:53:31,991 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-18 14:53:31,992 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-18 14:53:31,992 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-18 14:53:31,992 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-18 14:53:31,992 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-18 14:53:31,993 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-18 14:53:31,993 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-18 14:53:31,993 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-18 14:53:31,993 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-18 14:53:31,993 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-18 14:53:31,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 14:53:31,994 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-18 14:53:31,994 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-18 14:53:31,994 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-18 14:53:31,995 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-18 14:53:31,995 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-18 14:53:31,996 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-18 14:53:31,996 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-18 14:53:31,996 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-18 14:53:31,996 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-18 14:53:31,997 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-18 14:53:31,997 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-18 14:53:31,997 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 -> ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 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:53:32,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-18 14:53:32,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-18 14:53:32,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-18 14:53:32,357 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-18 14:53:32,361 INFO L274 PluginConnector]: CDTParser initialized [2024-10-18 14:53:32,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2024-10-18 14:53:33,850 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-18 14:53:34,063 INFO L384 CDTParser]: Found 1 translation units. [2024-10-18 14:53:34,064 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2024-10-18 14:53:34,083 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/af0441218/9d2e9e9397ef4511af3ebc4bf0b1c574/FLAGb5ae32167 [2024-10-18 14:53:34,403 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/af0441218/9d2e9e9397ef4511af3ebc4bf0b1c574 [2024-10-18 14:53:34,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-18 14:53:34,407 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-18 14:53:34,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-18 14:53:34,408 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-18 14:53:34,413 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-18 14:53:34,413 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 02:53:34" (1/1) ... [2024-10-18 14:53:34,414 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53d68e11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:53:34, skipping insertion in model container [2024-10-18 14:53:34,414 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 02:53:34" (1/1) ... [2024-10-18 14:53:34,462 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-18 14:53:34,825 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/02_inc_cas.i[30873,30886] [2024-10-18 14:53:34,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 14:53:34,846 INFO L200 MainTranslator]: Completed pre-run [2024-10-18 14:53:34,898 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/02_inc_cas.i[30873,30886] [2024-10-18 14:53:34,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 14:53:34,958 INFO L204 MainTranslator]: Completed translation [2024-10-18 14:53:34,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:53:34 WrapperNode [2024-10-18 14:53:34,959 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-18 14:53:34,960 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-18 14:53:34,960 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-18 14:53:34,960 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-18 14:53:34,967 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:53:34" (1/1) ... [2024-10-18 14:53:34,990 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:53:34" (1/1) ... [2024-10-18 14:53:35,013 INFO L138 Inliner]: procedures = 174, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 73 [2024-10-18 14:53:35,014 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-18 14:53:35,015 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-18 14:53:35,015 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-18 14:53:35,015 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-18 14:53:35,023 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:53:34" (1/1) ... [2024-10-18 14:53:35,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:53:34" (1/1) ... [2024-10-18 14:53:35,026 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:53:34" (1/1) ... [2024-10-18 14:53:35,030 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:53:34" (1/1) ... [2024-10-18 14:53:35,040 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:53:34" (1/1) ... [2024-10-18 14:53:35,045 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:53:34" (1/1) ... [2024-10-18 14:53:35,051 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:53:34" (1/1) ... [2024-10-18 14:53:35,053 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:53:34" (1/1) ... [2024-10-18 14:53:35,058 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-18 14:53:35,063 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-18 14:53:35,063 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-18 14:53:35,063 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-18 14:53:35,064 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:53:34" (1/1) ... [2024-10-18 14:53:35,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 14:53:35,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:53:35,103 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:53:35,109 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:53:35,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-10-18 14:53:35,153 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-18 14:53:35,153 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-18 14:53:35,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-18 14:53:35,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-18 14:53:35,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-18 14:53:35,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-18 14:53:35,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-10-18 14:53:35,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-10-18 14:53:35,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-10-18 14:53:35,156 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-18 14:53:35,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-18 14:53:35,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-18 14:53:35,158 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:53:35,326 INFO L238 CfgBuilder]: Building ICFG [2024-10-18 14:53:35,329 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-18 14:53:35,509 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-18 14:53:35,509 INFO L287 CfgBuilder]: Performing block encoding [2024-10-18 14:53:35,667 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-18 14:53:35,667 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-18 14:53:35,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 02:53:35 BoogieIcfgContainer [2024-10-18 14:53:35,668 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-18 14:53:35,672 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-18 14:53:35,672 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-18 14:53:35,675 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-18 14:53:35,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.10 02:53:34" (1/3) ... [2024-10-18 14:53:35,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69e73daf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 02:53:35, skipping insertion in model container [2024-10-18 14:53:35,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:53:34" (2/3) ... [2024-10-18 14:53:35,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69e73daf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 02:53:35, skipping insertion in model container [2024-10-18 14:53:35,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 02:53:35" (3/3) ... [2024-10-18 14:53:35,678 INFO L112 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2024-10-18 14:53:35,695 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-18 14:53:35,696 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-18 14:53:35,696 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-18 14:53:35,727 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-18 14:53:35,766 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 14:53:35,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 14:53:35,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:53:35,769 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:53:35,770 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:53:35,865 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 14:53:35,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:53:35,888 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-10-18 14:53:35,894 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;@42ad7a2d, 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:53:35,894 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 14:53:36,256 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 14:53:36,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:53:36,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1901459519, now seen corresponding path program 1 times [2024-10-18 14:53:36,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 14:53:36,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1907271761] [2024-10-18 14:53:36,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:53:36,272 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 14:53:36,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 14:53:36,297 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 14:53:36,299 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 14:53:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:53:36,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-18 14:53:36,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:53:36,374 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:53:36,374 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 14:53:36,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-18 14:53:36,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1907271761] [2024-10-18 14:53:36,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1907271761] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 14:53:36,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 14:53:36,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 14:53:36,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62511048] [2024-10-18 14:53:36,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 14:53:36,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 14:53:36,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-18 14:53:36,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 14:53:36,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 14:53:36,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:36,405 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:53:36,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:53:36,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:36,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:36,719 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 14:53:36,917 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 14:53:36,918 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 14:53:36,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:53:36,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1726443972, now seen corresponding path program 1 times [2024-10-18 14:53:36,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 14:53:36,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1680890601] [2024-10-18 14:53:36,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:53:36,920 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 14:53:36,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 14:53:36,925 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 14:53:36,927 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 14:53:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:53:37,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-18 14:53:37,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:53:37,138 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-18 14:53:37,140 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 13 treesize of output 13 [2024-10-18 14:53:37,288 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-10-18 14:53:37,294 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 16 treesize of output 11 [2024-10-18 14:53:37,332 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:53:37,332 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 14:53:37,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-18 14:53:37,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1680890601] [2024-10-18 14:53:37,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1680890601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 14:53:37,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 14:53:37,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-18 14:53:37,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742488017] [2024-10-18 14:53:37,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 14:53:37,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-18 14:53:37,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-18 14:53:37,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-18 14:53:37,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-18 14:53:37,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:37,339 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:53:37,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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:53:37,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:37,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:37,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:37,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 14:53:37,709 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 (4)] Forceful destruction successful, exit code 0 [2024-10-18 14:53:37,903 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 14:53:37,904 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 14:53:37,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:53:37,905 INFO L85 PathProgramCache]: Analyzing trace with hash -102633002, now seen corresponding path program 1 times [2024-10-18 14:53:37,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 14:53:37,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315241497] [2024-10-18 14:53:37,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:53:37,906 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 14:53:37,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 14:53:37,909 INFO L229 MonitoredProcess]: Starting monitored process 5 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 14:53:37,910 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 (5)] Waiting until timeout for monitored process [2024-10-18 14:53:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:53:37,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-18 14:53:37,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:53:38,060 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2024-10-18 14:53:38,061 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 2 case distinctions, treesize of input 36 treesize of output 64 [2024-10-18 14:53:38,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-18 14:53:38,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-18 14:53:38,153 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 16 treesize of output 5 [2024-10-18 14:53:38,157 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 5 treesize of output 3 [2024-10-18 14:53:38,178 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 14:53:38,179 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 14:53:38,179 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-18 14:53:38,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1315241497] [2024-10-18 14:53:38,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1315241497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 14:53:38,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 14:53:38,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-18 14:53:38,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745576047] [2024-10-18 14:53:38,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 14:53:38,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-18 14:53:38,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-18 14:53:38,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-18 14:53:38,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-18 14:53:38,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:38,185 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:53:38,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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:53:38,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:38,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 14:53:38,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:38,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:38,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 14:53:38,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-18 14:53:38,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-18 14:53:38,522 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 (5)] Ended with exit code 0 [2024-10-18 14:53:38,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 14:53:38,727 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-18 14:53:38,729 INFO L312 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2024-10-18 14:53:38,732 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 14:53:38,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 14:53:38,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:53:38,734 INFO L229 MonitoredProcess]: Starting monitored process 6 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:53:38,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2024-10-18 14:53:38,770 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 14:53:38,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:53:38,771 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 14:53:38,772 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;@42ad7a2d, 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:53:38,772 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 14:53:38,949 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 14:53:38,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:53:38,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1941491556, now seen corresponding path program 1 times [2024-10-18 14:53:38,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 14:53:38,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1580771053] [2024-10-18 14:53:38,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:53:38,950 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 14:53:38,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 14:53:38,953 INFO L229 MonitoredProcess]: Starting monitored process 7 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 14:53:38,954 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 (7)] Waiting until timeout for monitored process [2024-10-18 14:53:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:53:39,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-18 14:53:39,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:53:39,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 14:53:39,002 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 14:53:39,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-18 14:53:39,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1580771053] [2024-10-18 14:53:39,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1580771053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 14:53:39,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 14:53:39,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 14:53:39,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627333156] [2024-10-18 14:53:39,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 14:53:39,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 14:53:39,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-18 14:53:39,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 14:53:39,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 14:53:39,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:39,005 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:53:39,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:53:39,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:39,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:39,259 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 (7)] Ended with exit code 0 [2024-10-18 14:53:39,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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 14:53:39,455 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 14:53:39,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:53:39,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1255275433, now seen corresponding path program 1 times [2024-10-18 14:53:39,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 14:53:39,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [539449392] [2024-10-18 14:53:39,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:53:39,456 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 14:53:39,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 14:53:39,460 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 14:53:39,461 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 14:53:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:53:39,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-18 14:53:39,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:53:39,594 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-18 14:53:39,595 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 13 treesize of output 13 [2024-10-18 14:53:39,690 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-10-18 14:53:39,698 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 16 treesize of output 11 [2024-10-18 14:53:39,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 14:53:39,735 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 14:53:39,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-18 14:53:39,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [539449392] [2024-10-18 14:53:39,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [539449392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 14:53:39,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 14:53:39,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-18 14:53:39,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24493113] [2024-10-18 14:53:39,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 14:53:39,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-18 14:53:39,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-18 14:53:39,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-18 14:53:39,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-18 14:53:39,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:39,742 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:53:39,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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:53:39,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:39,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:39,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:39,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 14:53:39,921 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 (8)] Ended with exit code 0 [2024-10-18 14:53:40,117 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 [2024-10-18 14:53:40,118 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 14:53:40,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:53:40,118 INFO L85 PathProgramCache]: Analyzing trace with hash 567669754, now seen corresponding path program 1 times [2024-10-18 14:53:40,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 14:53:40,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1980690037] [2024-10-18 14:53:40,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:53:40,119 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 14:53:40,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 14:53:40,120 INFO L229 MonitoredProcess]: Starting monitored process 9 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 14:53:40,121 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 (9)] Waiting until timeout for monitored process [2024-10-18 14:53:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:53:40,178 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:53:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:53:40,223 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-18 14:53:40,223 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 14:53:40,223 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-18 14:53:40,229 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 (9)] Ended with exit code 0 [2024-10-18 14:53:40,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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 14:53:40,429 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-18 14:53:40,430 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-10-18 14:53:40,430 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 14:53:40,431 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-18 14:53:40,454 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-18 14:53:40,458 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 14:53:40,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 14:53:40,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:53:40,461 INFO L229 MonitoredProcess]: Starting monitored process 10 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:53:40,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Waiting until timeout for monitored process [2024-10-18 14:53:40,503 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 14:53:40,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:53:40,504 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 14:53:40,504 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;@42ad7a2d, 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:53:40,505 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 14:53:41,527 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 14:53:41,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:53:41,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1753159339, now seen corresponding path program 1 times [2024-10-18 14:53:41,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 14:53:41,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1481273279] [2024-10-18 14:53:41,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:53:41,529 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 14:53:41,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 14:53:41,532 INFO L229 MonitoredProcess]: Starting monitored process 11 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 14:53:41,533 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 (11)] Waiting until timeout for monitored process [2024-10-18 14:53:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:53:41,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-18 14:53:41,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:53:41,593 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 14:53:41,593 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 14:53:41,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-18 14:53:41,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1481273279] [2024-10-18 14:53:41,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1481273279] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 14:53:41,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 14:53:41,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 14:53:41,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225120495] [2024-10-18 14:53:41,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 14:53:41,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 14:53:41,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-18 14:53:41,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 14:53:41,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 14:53:41,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:41,598 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:53:41,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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:53:41,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:42,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:42,301 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 (11)] Forceful destruction successful, exit code 0 [2024-10-18 14:53:42,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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 14:53:42,496 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 14:53:42,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:53:42,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1668501579, now seen corresponding path program 1 times [2024-10-18 14:53:42,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 14:53:42,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [226900758] [2024-10-18 14:53:42,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:53:42,497 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 14:53:42,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 14:53:42,500 INFO L229 MonitoredProcess]: Starting monitored process 12 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 14:53:42,501 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 (12)] Waiting until timeout for monitored process [2024-10-18 14:53:42,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:53:42,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-18 14:53:42,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:53:42,646 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-18 14:53:42,647 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 13 treesize of output 13 [2024-10-18 14:53:42,740 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-10-18 14:53:42,748 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 16 treesize of output 11 [2024-10-18 14:53:42,774 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 14:53:42,774 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 14:53:42,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-18 14:53:42,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [226900758] [2024-10-18 14:53:42,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [226900758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 14:53:42,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 14:53:42,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-18 14:53:42,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586345880] [2024-10-18 14:53:42,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 14:53:42,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-18 14:53:42,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-18 14:53:42,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-18 14:53:42,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-18 14:53:42,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:42,779 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:53:42,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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:53:42,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:42,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:43,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:43,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 14:53:43,047 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 (12)] Forceful destruction successful, exit code 0 [2024-10-18 14:53:43,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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 14:53:43,243 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 14:53:43,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:53:43,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1301353490, now seen corresponding path program 1 times [2024-10-18 14:53:43,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 14:53:43,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1221652815] [2024-10-18 14:53:43,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:53:43,244 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 14:53:43,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 14:53:43,248 INFO L229 MonitoredProcess]: Starting monitored process 13 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 14:53:43,248 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 (13)] Waiting until timeout for monitored process [2024-10-18 14:53:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:53:43,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-18 14:53:43,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:53:43,372 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-18 14:53:43,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-10-18 14:53:43,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2024-10-18 14:53:43,475 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-18 14:53:43,476 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 13 treesize of output 13 [2024-10-18 14:53:43,559 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-10-18 14:53:43,565 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 18 treesize of output 13 [2024-10-18 14:53:43,606 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 14:53:43,606 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 14:53:43,731 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv1 32) |c_thr1Thread2of2ForFork0_~v~0#1|))) (or (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (select .cse1 |c_~#value~0.offset|) |c_thr1Thread2of2ForFork0_~v~0#1|))) (and (or (not .cse0) (forall ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| .cse2)) |c_thr1Thread2of2ForFork0_~#casret~0#1.base| v_DerPreprocessor_4) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of2ForFork0_~v~0#1|))) (or (forall ((v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of2ForFork0_~v~0#1|)) .cse0)))) (= (_ bv0 32) .cse2))) is different from false [2024-10-18 14:53:43,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 14:53:43,745 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 26 [2024-10-18 14:53:43,749 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 41 treesize of output 25 [2024-10-18 14:53:43,759 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 11 treesize of output 9 [2024-10-18 14:53:43,933 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 14:53:43,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-18 14:53:43,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1221652815] [2024-10-18 14:53:43,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1221652815] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 14:53:43,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-18 14:53:43,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-10-18 14:53:43,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243285567] [2024-10-18 14:53:43,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-18 14:53:43,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-18 14:53:43,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-18 14:53:43,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-18 14:53:43,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=115, Unknown=6, NotChecked=22, Total=182 [2024-10-18 14:53:43,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:43,946 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:53:43,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 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:53:43,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:43,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 14:53:43,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:44,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:44,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 14:53:44,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-18 14:53:44,333 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 (13)] Forceful destruction successful, exit code 0 [2024-10-18 14:53:44,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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 14:53:44,529 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 14:53:44,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:53:44,529 INFO L85 PathProgramCache]: Analyzing trace with hash -763680015, now seen corresponding path program 1 times [2024-10-18 14:53:44,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 14:53:44,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1721810469] [2024-10-18 14:53:44,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:53:44,530 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 14:53:44,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 14:53:44,531 INFO L229 MonitoredProcess]: Starting monitored process 14 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 14:53:44,532 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 (14)] Waiting until timeout for monitored process [2024-10-18 14:53:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:53:44,607 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:53:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:53:44,669 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-18 14:53:44,671 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 14:53:44,671 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-18 14:53:44,676 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 (14)] Forceful destruction successful, exit code 0 [2024-10-18 14:53:44,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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 14:53:44,873 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-18 14:53:44,874 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-10-18 14:53:44,874 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 14:53:44,874 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-18 14:53:44,900 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-18 14:53:44,902 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 14:53:44,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 14:53:44,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:53:44,906 INFO L229 MonitoredProcess]: Starting monitored process 15 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:53:44,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (15)] Waiting until timeout for monitored process [2024-10-18 14:53:44,951 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 14:53:44,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:53:44,953 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-10-18 14:53:44,953 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;@42ad7a2d, 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:53:44,954 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 14:53:47,011 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 14:53:47,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:53:47,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1980423421, now seen corresponding path program 1 times [2024-10-18 14:53:47,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 14:53:47,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1577666770] [2024-10-18 14:53:47,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:53:47,012 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 14:53:47,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 14:53:47,014 INFO L229 MonitoredProcess]: Starting monitored process 16 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 14:53:47,015 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 (16)] Waiting until timeout for monitored process [2024-10-18 14:53:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:53:47,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-18 14:53:47,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:53:47,081 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-18 14:53:47,081 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 14:53:47,081 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-18 14:53:47,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1577666770] [2024-10-18 14:53:47,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1577666770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 14:53:47,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 14:53:47,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 14:53:47,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516939089] [2024-10-18 14:53:47,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 14:53:47,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 14:53:47,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-18 14:53:47,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 14:53:47,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 14:53:47,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:47,085 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:53:47,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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:53:47,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:48,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:48,115 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 (16)] Ended with exit code 0 [2024-10-18 14:53:48,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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 14:53:48,311 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 14:53:48,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:53:48,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1408669934, now seen corresponding path program 1 times [2024-10-18 14:53:48,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 14:53:48,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [88528546] [2024-10-18 14:53:48,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:53:48,312 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 14:53:48,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 14:53:48,315 INFO L229 MonitoredProcess]: Starting monitored process 17 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 14:53:48,316 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 (17)] Waiting until timeout for monitored process [2024-10-18 14:53:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:53:48,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-18 14:53:48,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:53:48,739 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-18 14:53:48,739 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 18 [2024-10-18 14:53:48,793 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-18 14:53:48,794 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 14:53:48,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-18 14:53:48,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [88528546] [2024-10-18 14:53:48,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [88528546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 14:53:48,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 14:53:48,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-18 14:53:48,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27124936] [2024-10-18 14:53:48,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 14:53:48,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-18 14:53:48,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-18 14:53:48,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-18 14:53:48,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-18 14:53:48,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:48,798 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:53:48,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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:53:48,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:48,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:49,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:49,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-18 14:53:49,183 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 (17)] Ended with exit code 0 [2024-10-18 14:53:49,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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 14:53:49,380 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 14:53:49,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:53:49,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1103172430, now seen corresponding path program 1 times [2024-10-18 14:53:49,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 14:53:49,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2077034138] [2024-10-18 14:53:49,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:53:49,381 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 14:53:49,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 14:53:49,383 INFO L229 MonitoredProcess]: Starting monitored process 18 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 14:53:49,384 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 (18)] Waiting until timeout for monitored process [2024-10-18 14:53:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:53:49,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-18 14:53:49,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:53:49,525 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2024-10-18 14:53:49,526 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 2 case distinctions, treesize of input 36 treesize of output 64 [2024-10-18 14:53:49,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-18 14:53:49,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-18 14:53:49,558 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 8 treesize of output 1 [2024-10-18 14:53:49,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 12 [2024-10-18 14:53:49,595 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-18 14:53:49,596 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 14:53:49,596 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-18 14:53:49,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2077034138] [2024-10-18 14:53:49,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2077034138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 14:53:49,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 14:53:49,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-18 14:53:49,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902585456] [2024-10-18 14:53:49,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 14:53:49,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-18 14:53:49,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-18 14:53:49,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-18 14:53:49,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-18 14:53:49,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:49,600 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:53:49,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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:53:49,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:49,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-18 14:53:49,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:50,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:50,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-18 14:53:50,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-18 14:53:50,041 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 (18)] Forceful destruction successful, exit code 0 [2024-10-18 14:53:50,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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 14:53:50,237 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 14:53:50,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:53:50,237 INFO L85 PathProgramCache]: Analyzing trace with hash 562594897, now seen corresponding path program 1 times [2024-10-18 14:53:50,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 14:53:50,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259841767] [2024-10-18 14:53:50,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:53:50,238 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 14:53:50,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 14:53:50,241 INFO L229 MonitoredProcess]: Starting monitored process 19 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 14:53:50,242 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 (19)] Waiting until timeout for monitored process [2024-10-18 14:53:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:53:50,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-18 14:53:50,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:53:50,372 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-18 14:53:50,372 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 13 treesize of output 13 [2024-10-18 14:53:50,434 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-10-18 14:53:50,437 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 16 treesize of output 11 [2024-10-18 14:53:50,470 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 14:53:50,471 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 14:53:50,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-18 14:53:50,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1259841767] [2024-10-18 14:53:50,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1259841767] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 14:53:50,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 14:53:50,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-18 14:53:50,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930316594] [2024-10-18 14:53:50,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 14:53:50,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-18 14:53:50,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-18 14:53:50,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-18 14:53:50,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-18 14:53:50,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:50,475 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:53:50,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 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:53:50,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:50,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-18 14:53:50,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-18 14:53:50,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:50,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:50,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-18 14:53:50,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-18 14:53:50,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 14:53:50,855 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 (19)] Forceful destruction successful, exit code 0 [2024-10-18 14:53:51,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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 14:53:51,052 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 14:53:51,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:53:51,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1499213391, now seen corresponding path program 1 times [2024-10-18 14:53:51,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 14:53:51,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1748801070] [2024-10-18 14:53:51,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:53:51,053 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 14:53:51,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 14:53:51,054 INFO L229 MonitoredProcess]: Starting monitored process 20 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 14:53:51,055 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 (20)] Waiting until timeout for monitored process [2024-10-18 14:53:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:53:51,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-18 14:53:51,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:53:51,193 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-18 14:53:51,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-10-18 14:53:51,294 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-10-18 14:53:51,298 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 16 treesize of output 11 [2024-10-18 14:53:51,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2024-10-18 14:53:51,395 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-18 14:53:51,396 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 13 treesize of output 13 [2024-10-18 14:53:51,502 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-10-18 14:53:51,506 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 16 treesize of output 11 [2024-10-18 14:53:51,538 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 14:53:51,538 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 14:53:51,593 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= |c_thr1Thread2of3ForFork0_~v~0#1| (select .cse1 |c_~#value~0.offset|)))) (and (or .cse0 (forall ((v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_6) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of3ForFork0_~v~0#1|))) (or (forall ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| |c_thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_5) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of3ForFork0_~v~0#1|)) (not .cse0))))) is different from false [2024-10-18 14:53:51,610 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= |c_thr1Thread2of3ForFork0_~v~0#1| (select .cse1 |c_~#value~0.offset|)))) (and (or .cse0 (forall ((v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_6) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of3ForFork0_~v~0#1|))) (or (not .cse0) (forall ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| (bvadd |c_thr1Thread2of3ForFork0_~v~0#1| (_ bv1 32)))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_5) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of3ForFork0_~v~0#1|)))))) is different from false [2024-10-18 14:53:51,616 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse1 (select .cse0 |c_~#value~0.offset|))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse0 |c_~#value~0.offset| (bvadd (_ bv1 32) .cse1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_5) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1)))) is different from false [2024-10-18 14:53:54,689 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (select .cse6 |c_~#value~0.offset|) |c_thr1Thread1of3ForFork0_~v~0#1|))) (and (or .cse0 (forall ((v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_243 (_ BitVec 1)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (_ BitVec 32))) (or (let ((.cse1 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_8))) (let ((.cse2 (select .cse1 |c_~#value~0.base|))) (let ((.cse3 (select .cse2 |c_~#value~0.offset|))) (bvugt (select (select (store (store .cse1 |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (bvadd (_ bv1 32) .cse3))) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| v_DerPreprocessor_5) |c_~#value~0.base|) |c_~#value~0.offset|) .cse3)))) (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_243) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|)))))) (or (forall ((v_ArrVal_243 (_ BitVec 1)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_243) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|))) (let ((.cse4 (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| |c_thr1Thread1of3ForFork0_~vn~0#1|)) |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#value~0.base|))) (let ((.cse5 (select .cse4 |c_~#value~0.offset|))) (bvugt (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| (bvadd (_ bv1 32) .cse5))) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| v_DerPreprocessor_5) |c_~#value~0.base|) |c_~#value~0.offset|) .cse5))))) (not .cse0))))) is different from false [2024-10-18 14:53:54,763 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (select .cse6 |c_~#value~0.offset|) |c_thr1Thread1of3ForFork0_~v~0#1|))) (and (or .cse0 (forall ((v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_243 (_ BitVec 1)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (_ BitVec 32))) (or (let ((.cse1 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_8))) (let ((.cse2 (select .cse1 |c_~#value~0.base|))) (let ((.cse3 (select .cse2 |c_~#value~0.offset|))) (bvugt (select (select (store (store .cse1 |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (bvadd (_ bv1 32) .cse3))) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| v_DerPreprocessor_5) |c_~#value~0.base|) |c_~#value~0.offset|) .cse3)))) (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_243) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|)))))) (or (not .cse0) (forall ((v_ArrVal_243 (_ BitVec 1)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_243) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|))) (let ((.cse4 (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| (bvadd (_ bv1 32) |c_thr1Thread1of3ForFork0_~v~0#1|))) |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#value~0.base|))) (let ((.cse5 (select .cse4 |c_~#value~0.offset|))) (bvugt (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| (bvadd (_ bv1 32) .cse5))) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| v_DerPreprocessor_5) |c_~#value~0.base|) |c_~#value~0.offset|) .cse5))))))))) is different from false [2024-10-18 14:53:54,790 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_243 (_ BitVec 1)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_243) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#value~0.base| (let ((.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (store .cse2 |c_~#value~0.offset| (bvadd (_ bv1 32) (select .cse2 |c_~#value~0.offset|))))) |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#value~0.base|))) (let ((.cse1 (select .cse0 |c_~#value~0.offset|))) (bvugt (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#value~0.base| (store .cse0 |c_~#value~0.offset| (bvadd (_ bv1 32) .cse1))) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| v_DerPreprocessor_5) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1))))) is different from false [2024-10-18 14:53:54,880 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_14| (_ BitVec 32)) (v_ArrVal_243 (_ BitVec 1)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_14| v_ArrVal_243) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_14|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#value~0.base| (let ((.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (store .cse2 |c_~#value~0.offset| (bvadd (_ bv1 32) (select .cse2 |c_~#value~0.offset|))))) |v_thr1Thread1of3ForFork0_~#casret~0#1.base_14| v_DerPreprocessor_7) |c_~#value~0.base|))) (let ((.cse1 (select .cse0 |c_~#value~0.offset|))) (bvugt (select (select (store (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_14| v_DerPreprocessor_7) |c_~#value~0.base| (store .cse0 |c_~#value~0.offset| (bvadd .cse1 (_ bv1 32)))) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| v_DerPreprocessor_5) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1))))) is different from false [2024-10-18 14:53:54,943 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-10-18 14:53:54,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-18 14:53:54,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1748801070] [2024-10-18 14:53:54,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1748801070] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 14:53:54,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-18 14:53:54,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2024-10-18 14:53:54,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894514227] [2024-10-18 14:53:54,945 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-18 14:53:54,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-18 14:53:54,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-18 14:53:54,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-18 14:53:54,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=165, Unknown=10, NotChecked=224, Total=462 [2024-10-18 14:53:54,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:54,950 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:53:54,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 21 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:53:54,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:54,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-18 14:53:54,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-18 14:53:54,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 14:53:54,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:53:58,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 14:54:00,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 14:54:03,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 14:54:03,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:54:03,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-18 14:54:03,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-18 14:54:03,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 14:54:03,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-18 14:54:03,782 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 (20)] Forceful destruction successful, exit code 0 [2024-10-18 14:54:03,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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 14:54:03,955 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 14:54:03,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:54:03,956 INFO L85 PathProgramCache]: Analyzing trace with hash 2110429268, now seen corresponding path program 1 times [2024-10-18 14:54:03,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 14:54:03,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [30153036] [2024-10-18 14:54:03,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:54:03,956 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 14:54:03,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 14:54:03,958 INFO L229 MonitoredProcess]: Starting monitored process 21 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 14:54:03,959 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 (21)] Waiting until timeout for monitored process [2024-10-18 14:54:04,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:54:04,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-18 14:54:04,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:54:04,119 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-18 14:54:04,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-10-18 14:54:04,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2024-10-18 14:54:04,308 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-10-18 14:54:04,308 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 16 treesize of output 17 [2024-10-18 14:54:04,504 INFO L349 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2024-10-18 14:54:04,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 52 treesize of output 83 [2024-10-18 14:54:04,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-18 14:54:04,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-18 14:54:04,566 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2024-10-18 14:54:04,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 0 case distinctions, treesize of input 16 treesize of output 5 [2024-10-18 14:54:04,944 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-10-18 14:54:04,945 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 16 treesize of output 17 [2024-10-18 14:54:05,099 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-18 14:54:05,100 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 13 treesize of output 13 [2024-10-18 14:54:05,526 INFO L349 Elim1Store]: treesize reduction 28, result has 15.2 percent of original size [2024-10-18 14:54:05,526 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 57 [2024-10-18 14:54:05,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-18 14:54:05,558 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-18 14:54:05,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2024-10-18 14:54:05,575 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 0 case distinctions, treesize of input 21 treesize of output 16 [2024-10-18 14:54:05,681 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 14:54:05,681 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 14:54:05,763 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= |c_thr1Thread3of3ForFork0_~v~0#1| (select .cse1 |c_~#value~0.offset|)))) (and (or (not .cse0) (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| |c_thr1Thread3of3ForFork0_~vn~0#1|)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_~v~0#1|))) (or (forall ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_12) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_~v~0#1|)) .cse0)))) is different from false [2024-10-18 14:54:05,787 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv1 32) |c_thr1Thread3of3ForFork0_~v~0#1|))) (or (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= |c_thr1Thread3of3ForFork0_~v~0#1| (select .cse1 |c_~#value~0.offset|)))) (and (or (not .cse0) (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| .cse2)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_~v~0#1|))) (or (forall ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_12) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_~v~0#1|)) .cse0)))) (= (_ bv0 32) .cse2))) is different from false [2024-10-18 14:54:06,445 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_thr1Thread2of3ForFork0_~v~0#1| (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|)))) (and (or .cse0 (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_279 (_ BitVec 1)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (_ BitVec 32))) (let ((.cse2 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_13))) (let ((.cse3 (select .cse2 |c_~#value~0.base|))) (let ((.cse1 (select .cse3 |c_~#value~0.offset|))) (let ((.cse4 (bvadd (_ bv1 32) .cse1))) (or (not (bvugt .cse1 |c_thr1Thread2of3ForFork0_~v~0#1|)) (bvugt (select (select (store (store .cse2 |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| .cse4)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1) (= (_ bv0 32) .cse4) (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_ArrVal_279) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|)))))))))) (or (not .cse0) (forall ((v_ArrVal_278 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_279 (_ BitVec 1)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (_ BitVec 32))) (let ((.cse9 (store |c_#memory_int| |c_~#value~0.base| v_ArrVal_278))) (let ((.cse6 (store (select .cse9 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse7 (select (store .cse9 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse6) |c_~#value~0.base|))) (let ((.cse5 (select .cse7 |c_~#value~0.offset|))) (let ((.cse8 (bvadd (_ bv1 32) .cse5))) (or (not (bvugt .cse5 |c_thr1Thread2of3ForFork0_~v~0#1|)) (bvugt (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse6) |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| .cse8)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse5) (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_ArrVal_279) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|))) (= (_ bv0 32) .cse8))))))))))) is different from false [2024-10-18 14:54:06,642 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_279 (_ BitVec 1)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (_ BitVec 32))) (let ((.cse4 (store |c_#memory_int| |c_~#value~0.base| v_ArrVal_278))) (let ((.cse0 (store (select .cse4 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse1 (select (store .cse4 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse0) |c_~#value~0.base|))) (let ((.cse3 (select .cse1 |c_~#value~0.offset|))) (let ((.cse2 (bvadd (_ bv1 32) .cse3))) (or (bvugt (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse0) |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| .cse2)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse3) (not (bvugt .cse3 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_ArrVal_279) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|))) (= (_ bv0 32) .cse2)))))))) is different from false [2024-10-18 14:54:06,778 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| (_ BitVec 32)) (v_ArrVal_279 (_ BitVec 1)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (_ BitVec 32))) (let ((.cse4 (store |c_#memory_int| |c_~#value~0.base| v_ArrVal_278))) (let ((.cse2 (store (select .cse4 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16|) (_ bv0 32) (_ bv1 32)))) (let ((.cse3 (select (store .cse4 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| .cse2) |c_~#value~0.base|))) (let ((.cse0 (select .cse3 |c_~#value~0.offset|))) (let ((.cse1 (bvadd (_ bv1 32) .cse0))) (or (not (bvugt .cse0 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (= .cse1 (_ bv0 32)) (not (= (_ bv0 1) (select (store |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| v_ArrVal_279) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|))) (bvugt (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| .cse2) |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| .cse1)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse0)))))))) is different from false [2024-10-18 14:54:07,014 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| (_ BitVec 32)) (v_ArrVal_279 (_ BitVec 1)) (v_ArrVal_274 (_ BitVec 1)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (_ BitVec 32))) (let ((.cse4 (store |c_#memory_int| |c_~#value~0.base| v_ArrVal_278))) (let ((.cse2 (store (select .cse4 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16|) (_ bv0 32) (_ bv1 32)))) (let ((.cse3 (select (store .cse4 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| .cse2) |c_~#value~0.base|))) (let ((.cse0 (select .cse3 |c_~#value~0.offset|))) (let ((.cse1 (bvadd (_ bv1 32) .cse0))) (or (not (bvugt .cse0 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (not (= (_ bv0 1) (select (store (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_274) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| v_ArrVal_279) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|))) (= .cse1 (_ bv0 32)) (bvugt (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| .cse2) |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| .cse1)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse0)))))))) is different from false [2024-10-18 14:54:07,094 INFO L349 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2024-10-18 14:54:07,094 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 316 treesize of output 308 [2024-10-18 14:54:07,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 14:54:07,123 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 151 treesize of output 136 [2024-10-18 14:54:07,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 14:54:07,164 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 54 treesize of output 58 [2024-10-18 14:54:07,183 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 154 treesize of output 134 [2024-10-18 14:54:07,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 14:54:07,213 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 73 treesize of output 75 [2024-10-18 14:54:07,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 14:54:07,294 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 48 treesize of output 48 [2024-10-18 14:54:09,977 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-18 14:54:09,977 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-18 14:54:09,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [30153036] [2024-10-18 14:54:09,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [30153036] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 14:54:09,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-18 14:54:09,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2024-10-18 14:54:09,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865697524] [2024-10-18 14:54:09,978 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-18 14:54:09,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-18 14:54:09,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-18 14:54:09,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-18 14:54:09,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=381, Unknown=13, NotChecked=270, Total=756 [2024-10-18 14:54:09,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:54:09,984 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:54:09,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 27 states have internal predecessors, (70), 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:54:09,984 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:54:09,984 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-18 14:54:09,984 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-18 14:54:09,984 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 14:54:09,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-18 14:54:09,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:54:14,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 14:54:17,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 14:54:19,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 14:54:21,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 14:54:23,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 14:54:25,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 14:54:27,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 14:54:30,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 14:54:33,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 14:54:35,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 14:54:37,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-18 14:54:39,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 14:54:42,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 14:54:44,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 14:54:46,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 14:54:48,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 14:54:50,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 14:54:52,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 14:54:54,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 14:54:57,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 14:54:59,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 14:55:01,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 14:55:03,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 14:55:06,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-18 14:55:06,552 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse1 (select .cse4 |c_~#value~0.offset|))) (let ((.cse5 (bvadd (_ bv1 32) .cse1))) (let ((.cse0 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| .cse5))) (.cse2 (= (_ bv0 32) .cse5)) (.cse3 (= |c_thr1Thread3of3ForFork0_~v~0#1| .cse1))) (and (or (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store .cse0 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1)) .cse2) (or (not .cse3) (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| |c_thr1Thread3of3ForFork0_~vn~0#1|)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_~v~0#1|))) (or (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) (_ bv0 1))) (bvugt (select (select (store .cse0 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1))) .cse2) (or (forall ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_12) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_~v~0#1|)) .cse3)))))) is different from false [2024-10-18 14:55:08,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 14:55:10,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 14:55:12,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 14:55:15,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 14:55:17,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 14:55:19,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 14:55:21,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 14:55:24,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 14:55:25,544 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse1 (select .cse4 |c_~#value~0.offset|))) (let ((.cse5 (bvadd (_ bv1 32) .cse1))) (let ((.cse0 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| .cse5))) (.cse2 (= (_ bv0 32) .cse5)) (.cse3 (= |c_thr1Thread3of3ForFork0_~v~0#1| .cse1))) (and (= |c_~#value~0.offset| (_ bv0 32)) (or (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store .cse0 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1)) .cse2) (or (not .cse3) (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| |c_thr1Thread3of3ForFork0_~vn~0#1|)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_~v~0#1|))) (or (not (bvugt .cse1 |c_thr1Thread2of3ForFork0_~v~0#1|)) (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_279 (_ BitVec 1)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_ArrVal_279) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|))) (bvugt (select (select (store .cse0 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1))) .cse2) (or (forall ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_12) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_~v~0#1|)) .cse3) (= (_ bv3 32) |c_~#value~0.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (_ bv3 32))))))))) is different from false [2024-10-18 14:55:29,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 14:55:30,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:55:30,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-18 14:55:30,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-18 14:55:30,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 14:55:30,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-18 14:55:30,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-18 14:55:30,603 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 (21)] Ended with exit code 0 [2024-10-18 14:55:30,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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 14:55:30,799 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 14:55:30,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:55:30,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1277000128, now seen corresponding path program 1 times [2024-10-18 14:55:30,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 14:55:30,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [440249210] [2024-10-18 14:55:30,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:55:30,800 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 14:55:30,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 14:55:30,801 INFO L229 MonitoredProcess]: Starting monitored process 22 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 14:55:30,803 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 (22)] Waiting until timeout for monitored process [2024-10-18 14:55:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:55:30,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-18 14:55:30,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:55:30,987 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2024-10-18 14:55:30,987 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 2 case distinctions, treesize of input 36 treesize of output 64 [2024-10-18 14:55:31,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-18 14:55:31,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-18 14:55:31,072 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 16 treesize of output 5 [2024-10-18 14:55:31,074 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 5 treesize of output 3 [2024-10-18 14:55:31,091 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 14:55:31,091 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 14:55:31,091 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-18 14:55:31,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [440249210] [2024-10-18 14:55:31,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [440249210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 14:55:31,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 14:55:31,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-18 14:55:31,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942543963] [2024-10-18 14:55:31,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 14:55:31,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-18 14:55:31,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-18 14:55:31,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-18 14:55:31,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-18 14:55:31,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:55:31,143 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:55:31,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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 14:55:31,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:55:31,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-18 14:55:31,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-18 14:55:31,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 14:55:31,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-18 14:55:31,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-10-18 14:55:31,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:55:32,399 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (select .cse1 |c_~#value~0.offset|))) (and (bvugt .cse0 |c_thr1Thread3of3ForFork0_~v~0#1|) (let ((.cse2 (bvadd (_ bv1 32) .cse0))) (or (not (bvugt .cse0 |c_thr1Thread2of3ForFork0_~v~0#1|)) (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_279 (_ BitVec 1)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_ArrVal_279) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| .cse2)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse0))) (= (_ bv0 32) .cse2)))))) is different from false [2024-10-18 14:55:33,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:55:33,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-18 14:55:33,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-18 14:55:33,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 14:55:33,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-18 14:55:33,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-18 14:55:33,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 14:55:33,134 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 (22)] Ended with exit code 0 [2024-10-18 14:55:33,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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 14:55:33,331 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 14:55:33,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:55:33,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1825917863, now seen corresponding path program 1 times [2024-10-18 14:55:33,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 14:55:33,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [283414837] [2024-10-18 14:55:33,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:55:33,332 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 14:55:33,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 14:55:33,333 INFO L229 MonitoredProcess]: Starting monitored process 23 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 14:55:33,335 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 (23)] Waiting until timeout for monitored process [2024-10-18 14:55:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:55:33,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-18 14:55:33,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:55:33,550 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-18 14:55:33,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-10-18 14:55:33,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2024-10-18 14:55:33,675 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-18 14:55:33,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-10-18 14:55:33,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-18 14:55:33,782 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 14 treesize of output 14 [2024-10-18 14:55:33,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-18 14:55:33,878 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-10-18 14:55:33,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-10-18 14:55:34,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2024-10-18 14:55:34,042 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 14:55:34,042 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 14:55:34,173 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_thr1Thread3of3ForFork0_~v~0#1| (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|)))) (and (or (not .cse0) (let ((.cse1 (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_~#value~0.base|))) (and (or (forall ((v_DerPreprocessor_18 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_18) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|)))) (not .cse1)) (or (forall ((v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_17 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_16) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_17) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|)))) .cse1)))) (or (forall ((v_DerPreprocessor_19 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_19) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|)))) .cse0))) is different from false [2024-10-18 14:55:34,218 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_~#value~0.base|))) (and (or (forall ((v_DerPreprocessor_18 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_18) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|)))) (not .cse0)) (or (forall ((v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_17 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_16) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_17) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|)))) .cse0))) is different from false [2024-10-18 14:55:34,467 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (not (= (_ bv0 1) (select |c_#valid| |c_~#value~0.base|)))) (.cse0 (= |c_thr1Thread2of3ForFork0_~v~0#1| (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|)))) (and (or .cse0 (and (or (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_20 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_20) |c_~#value~0.base| v_DerPreprocessor_18) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|)))) .cse1) (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_17 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_20 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_~#value~0.base| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17|) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17|))) (not (= (_ bv0 32) (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_20) |c_~#value~0.base| v_DerPreprocessor_16) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_17) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|))))))) (or (and (or (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_353 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| v_ArrVal_353) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| (_ bv1 32))) |c_~#value~0.base| v_DerPreprocessor_18) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|)))) .cse1) (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_353 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| (_ BitVec 32))) (or (= |c_~#value~0.base| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17|) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17|))) (forall ((v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_17 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| v_ArrVal_353) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| (_ bv1 32))) |c_~#value~0.base| v_DerPreprocessor_16) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_17) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|))))))) (not .cse0)))) is different from false [2024-10-18 14:55:34,576 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 42 treesize of output 40 [2024-10-18 14:55:34,581 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 40 treesize of output 36 [2024-10-18 14:55:43,784 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 2 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-18 14:55:43,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-18 14:55:43,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [283414837] [2024-10-18 14:55:43,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [283414837] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 14:55:43,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-18 14:55:43,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2024-10-18 14:55:43,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731203390] [2024-10-18 14:55:43,785 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-18 14:55:43,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-18 14:55:43,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-18 14:55:43,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-18 14:55:43,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=237, Unknown=8, NotChecked=102, Total=420 [2024-10-18 14:55:43,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:55:43,800 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:55:43,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 20 states have internal predecessors, (65), 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:55:43,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:55:43,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-18 14:55:43,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-18 14:55:43,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 14:55:43,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-18 14:55:43,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-10-18 14:55:43,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-18 14:55:43,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:56:04,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 14:56:19,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 14:56:21,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 14:56:23,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 14:56:24,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:56:24,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-18 14:56:24,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-18 14:56:24,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 14:56:24,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-18 14:56:24,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-10-18 14:56:24,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 14:56:24,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-18 14:56:24,046 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 (23)] Forceful destruction successful, exit code 0 [2024-10-18 14:56:24,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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 14:56:24,242 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 14:56:24,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:56:24,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1492627962, now seen corresponding path program 2 times [2024-10-18 14:56:24,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 14:56:24,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [968166718] [2024-10-18 14:56:24,243 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-18 14:56:24,243 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 14:56:24,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 14:56:24,244 INFO L229 MonitoredProcess]: Starting monitored process 24 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 14:56:24,246 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 (24)] Waiting until timeout for monitored process [2024-10-18 14:56:24,323 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-18 14:56:24,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 14:56:24,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-18 14:56:24,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:56:24,440 INFO L349 Elim1Store]: treesize reduction 23, result has 54.0 percent of original size [2024-10-18 14:56:24,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 78 [2024-10-18 14:56:24,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-18 14:56:24,512 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-18 14:56:24,513 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 1 case distinctions, treesize of input 13 treesize of output 1 [2024-10-18 14:56:24,686 INFO L349 Elim1Store]: treesize reduction 21, result has 12.5 percent of original size [2024-10-18 14:56:24,687 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 14 treesize of output 14 [2024-10-18 14:56:24,753 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-10-18 14:56:24,753 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 32 [2024-10-18 14:56:24,781 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-18 14:56:24,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [968166718] [2024-10-18 14:56:24,782 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-10-18 14:56:24,785 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 (24)] Forceful destruction successful, exit code 0 [2024-10-18 14:56:24,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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 14:56:24,983 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:186) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:542) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:521) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:514) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:325) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:290) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:309) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isCounterexampleFeasible(PartialOrderCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) 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) [2024-10-18 14:56:24,987 INFO L158 Benchmark]: Toolchain (without parser) took 170580.17ms. Allocated memory was 67.1MB in the beginning and 237.0MB in the end (delta: 169.9MB). Free memory was 46.0MB in the beginning and 80.9MB in the end (delta: -34.9MB). Peak memory consumption was 134.1MB. Max. memory is 16.1GB. [2024-10-18 14:56:24,987 INFO L158 Benchmark]: CDTParser took 0.96ms. Allocated memory is still 67.1MB. Free memory was 43.4MB in the beginning and 43.3MB in the end (delta: 61.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-18 14:56:24,987 INFO L158 Benchmark]: CACSL2BoogieTranslator took 551.26ms. Allocated memory was 67.1MB in the beginning and 94.4MB in the end (delta: 27.3MB). Free memory was 45.8MB in the beginning and 68.1MB in the end (delta: -22.3MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2024-10-18 14:56:24,988 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.73ms. Allocated memory is still 94.4MB. Free memory was 68.1MB in the beginning and 66.0MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-18 14:56:24,988 INFO L158 Benchmark]: Boogie Preprocessor took 47.03ms. Allocated memory is still 94.4MB. Free memory was 66.0MB in the beginning and 64.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-18 14:56:24,988 INFO L158 Benchmark]: RCFGBuilder took 605.68ms. Allocated memory is still 94.4MB. Free memory was 64.4MB in the beginning and 68.5MB in the end (delta: -4.2MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2024-10-18 14:56:24,988 INFO L158 Benchmark]: TraceAbstraction took 169314.78ms. Allocated memory was 94.4MB in the beginning and 237.0MB in the end (delta: 142.6MB). Free memory was 67.0MB in the beginning and 80.9MB in the end (delta: -13.9MB). Peak memory consumption was 128.2MB. Max. memory is 16.1GB. [2024-10-18 14:56:24,989 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.96ms. Allocated memory is still 67.1MB. Free memory was 43.4MB in the beginning and 43.3MB in the end (delta: 61.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 551.26ms. Allocated memory was 67.1MB in the beginning and 94.4MB in the end (delta: 27.3MB). Free memory was 45.8MB in the beginning and 68.1MB in the end (delta: -22.3MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.73ms. Allocated memory is still 94.4MB. Free memory was 68.1MB in the beginning and 66.0MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.03ms. Allocated memory is still 94.4MB. Free memory was 66.0MB in the beginning and 64.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 605.68ms. Allocated memory is still 94.4MB. Free memory was 64.4MB in the beginning and 68.5MB in the end (delta: -4.2MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. * TraceAbstraction took 169314.78ms. Allocated memory was 94.4MB in the beginning and 237.0MB in the end (delta: 142.6MB). Free memory was 67.0MB in the beginning and 80.9MB in the end (delta: -13.9MB). Peak memory consumption was 128.2MB. 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: 288, independent: 256, independent conditional: 94, independent unconditional: 162, dependent: 32, dependent conditional: 22, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 266, independent: 256, independent conditional: 94, independent unconditional: 162, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 266, independent: 256, independent conditional: 94, independent unconditional: 162, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 266, independent: 256, independent conditional: 94, independent unconditional: 162, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 276, independent: 256, independent conditional: 94, independent unconditional: 162, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 276, independent: 256, independent conditional: 23, independent unconditional: 233, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 276, independent: 256, independent conditional: 23, independent unconditional: 233, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 136, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 136, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 990, independent: 360, independent conditional: 0, independent unconditional: 360, dependent: 631, dependent conditional: 0, dependent unconditional: 631, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 276, independent: 130, independent conditional: 23, independent unconditional: 107, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 136, unknown conditional: 0, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 71, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 276, independent: 256, independent conditional: 94, independent unconditional: 162, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 276, independent: 256, independent conditional: 23, independent unconditional: 233, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 276, independent: 256, independent conditional: 23, independent unconditional: 233, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 136, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 136, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 990, independent: 360, independent conditional: 0, independent unconditional: 360, dependent: 631, dependent conditional: 0, dependent unconditional: 631, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 276, independent: 130, independent conditional: 23, independent unconditional: 107, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 136, unknown conditional: 0, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 71 ], Independence queries for same thread: 22, Persistent sets #1 benchmarks: Persistent set computation time: 1.0s, Number of persistent set computation: 38, Number of trivial persistent sets: 33, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 165, independent: 155, independent conditional: 0, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 288, independent: 256, independent conditional: 94, independent unconditional: 162, dependent: 32, dependent conditional: 22, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 266, independent: 256, independent conditional: 94, independent unconditional: 162, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 266, independent: 256, independent conditional: 94, independent unconditional: 162, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 266, independent: 256, independent conditional: 94, independent unconditional: 162, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 276, independent: 256, independent conditional: 94, independent unconditional: 162, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 276, independent: 256, independent conditional: 23, independent unconditional: 233, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 276, independent: 256, independent conditional: 23, independent unconditional: 233, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 136, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 136, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 990, independent: 360, independent conditional: 0, independent unconditional: 360, dependent: 631, dependent conditional: 0, dependent unconditional: 631, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 276, independent: 130, independent conditional: 23, independent unconditional: 107, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 136, unknown conditional: 0, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 71, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 276, independent: 256, independent conditional: 94, independent unconditional: 162, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 276, independent: 256, independent conditional: 23, independent unconditional: 233, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 276, independent: 256, independent conditional: 23, independent unconditional: 233, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 136, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 136, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 990, independent: 360, independent conditional: 0, independent unconditional: 360, dependent: 631, dependent conditional: 0, dependent unconditional: 631, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 276, independent: 130, independent conditional: 23, independent unconditional: 107, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 136, unknown conditional: 0, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 71 ], Independence queries for same thread: 22 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 189, independent: 172, independent conditional: 46, independent unconditional: 126, dependent: 17, dependent conditional: 12, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 177, independent: 172, independent conditional: 46, independent unconditional: 126, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 177, independent: 172, independent conditional: 46, independent unconditional: 126, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 177, independent: 172, independent conditional: 46, independent unconditional: 126, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 182, independent: 172, independent conditional: 46, independent unconditional: 126, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 182, independent: 172, independent conditional: 11, independent unconditional: 161, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 182, independent: 172, independent conditional: 11, independent unconditional: 161, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 423, independent: 163, independent conditional: 0, independent unconditional: 163, dependent: 260, dependent conditional: 0, dependent unconditional: 260, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 182, independent: 73, independent conditional: 11, independent unconditional: 62, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 35, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 182, independent: 172, independent conditional: 46, independent unconditional: 126, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 182, independent: 172, independent conditional: 11, independent unconditional: 161, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 182, independent: 172, independent conditional: 11, independent unconditional: 161, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 423, independent: 163, independent conditional: 0, independent unconditional: 163, dependent: 260, dependent conditional: 0, dependent unconditional: 260, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 182, independent: 73, independent conditional: 11, independent unconditional: 62, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 35 ], Independence queries for same thread: 12, Persistent sets #1 benchmarks: Persistent set computation time: 0.4s, Number of persistent set computation: 17, Number of trivial persistent sets: 16, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 126, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 189, independent: 172, independent conditional: 46, independent unconditional: 126, dependent: 17, dependent conditional: 12, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 177, independent: 172, independent conditional: 46, independent unconditional: 126, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 177, independent: 172, independent conditional: 46, independent unconditional: 126, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 177, independent: 172, independent conditional: 46, independent unconditional: 126, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 182, independent: 172, independent conditional: 46, independent unconditional: 126, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 182, independent: 172, independent conditional: 11, independent unconditional: 161, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 182, independent: 172, independent conditional: 11, independent unconditional: 161, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 423, independent: 163, independent conditional: 0, independent unconditional: 163, dependent: 260, dependent conditional: 0, dependent unconditional: 260, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 182, independent: 73, independent conditional: 11, independent unconditional: 62, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 35, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 182, independent: 172, independent conditional: 46, independent unconditional: 126, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 182, independent: 172, independent conditional: 11, independent unconditional: 161, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 182, independent: 172, independent conditional: 11, independent unconditional: 161, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 423, independent: 163, independent conditional: 0, independent unconditional: 163, dependent: 260, dependent conditional: 0, dependent unconditional: 260, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 182, independent: 73, independent conditional: 11, independent unconditional: 62, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 35 ], Independence queries for same thread: 12 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 563, independent: 510, independent conditional: 145, independent unconditional: 365, dependent: 53, dependent conditional: 34, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 529, independent: 510, independent conditional: 145, independent unconditional: 365, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 529, independent: 510, independent conditional: 145, independent unconditional: 365, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 529, independent: 510, independent conditional: 145, independent unconditional: 365, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 548, independent: 510, independent conditional: 145, independent unconditional: 365, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 548, independent: 510, independent conditional: 46, independent unconditional: 464, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 548, independent: 510, independent conditional: 46, independent unconditional: 464, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 325, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 325, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1751, independent: 567, independent conditional: 0, independent unconditional: 567, dependent: 1183, dependent conditional: 0, dependent unconditional: 1183, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 548, independent: 204, independent conditional: 46, independent unconditional: 158, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 325, unknown conditional: 0, unknown unconditional: 325] , Statistics on independence cache: Total cache size (in pairs): 325, Positive cache size: 306, Positive conditional cache size: 0, Positive unconditional cache size: 306, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 99, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 548, independent: 510, independent conditional: 145, independent unconditional: 365, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 548, independent: 510, independent conditional: 46, independent unconditional: 464, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 548, independent: 510, independent conditional: 46, independent unconditional: 464, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 325, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 325, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1751, independent: 567, independent conditional: 0, independent unconditional: 567, dependent: 1183, dependent conditional: 0, dependent unconditional: 1183, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 548, independent: 204, independent conditional: 46, independent unconditional: 158, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 325, unknown conditional: 0, unknown unconditional: 325] , Statistics on independence cache: Total cache size (in pairs): 325, Positive cache size: 306, Positive conditional cache size: 0, Positive unconditional cache size: 306, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 99 ], Independence queries for same thread: 34, Persistent sets #1 benchmarks: Persistent set computation time: 1.8s, Number of persistent set computation: 41, Number of trivial persistent sets: 38, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 379, independent: 360, independent conditional: 0, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 563, independent: 510, independent conditional: 145, independent unconditional: 365, dependent: 53, dependent conditional: 34, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 529, independent: 510, independent conditional: 145, independent unconditional: 365, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 529, independent: 510, independent conditional: 145, independent unconditional: 365, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 529, independent: 510, independent conditional: 145, independent unconditional: 365, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 548, independent: 510, independent conditional: 145, independent unconditional: 365, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 548, independent: 510, independent conditional: 46, independent unconditional: 464, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 548, independent: 510, independent conditional: 46, independent unconditional: 464, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 325, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 325, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1751, independent: 567, independent conditional: 0, independent unconditional: 567, dependent: 1183, dependent conditional: 0, dependent unconditional: 1183, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 548, independent: 204, independent conditional: 46, independent unconditional: 158, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 325, unknown conditional: 0, unknown unconditional: 325] , Statistics on independence cache: Total cache size (in pairs): 325, Positive cache size: 306, Positive conditional cache size: 0, Positive unconditional cache size: 306, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 99, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 548, independent: 510, independent conditional: 145, independent unconditional: 365, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 548, independent: 510, independent conditional: 46, independent unconditional: 464, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 548, independent: 510, independent conditional: 46, independent unconditional: 464, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 325, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 325, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1751, independent: 567, independent conditional: 0, independent unconditional: 567, dependent: 1183, dependent conditional: 0, dependent unconditional: 1183, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 548, independent: 204, independent conditional: 46, independent unconditional: 158, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 325, unknown conditional: 0, unknown unconditional: 325] , Statistics on independence cache: Total cache size (in pairs): 325, Positive cache size: 306, Positive conditional cache size: 0, Positive unconditional cache size: 306, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 99 ], Independence queries for same thread: 34 - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-10-18 14:56:25,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (15)] Forceful destruction successful, exit code 0 [2024-10-18 14:56:25,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Forceful destruction successful, exit code 0 [2024-10-18 14:56:25,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Ended with exit code 0 [2024-10-18 14:56:25,625 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 14:56:25,883 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 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: no need to replace index