./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 COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 50 --traceabstraction.seed.for.random.criterion 213 -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 COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 50 --traceabstraction.seed.for.random.criterion 213 -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 03:43:52,766 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-18 03:43:52,819 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-18 03:43:52,824 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-18 03:43:52,825 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-18 03:43:52,839 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-18 03:43:52,840 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-18 03:43:52,840 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-18 03:43:52,841 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-18 03:43:52,841 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-18 03:43:52,841 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-18 03:43:52,842 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-18 03:43:52,842 INFO L153 SettingsManager]: * Use SBE=true [2024-10-18 03:43:52,842 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-18 03:43:52,843 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-18 03:43:52,843 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-18 03:43:52,843 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-18 03:43:52,843 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-18 03:43:52,844 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-18 03:43:52,844 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-18 03:43:52,844 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-18 03:43:52,846 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-18 03:43:52,846 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-18 03:43:52,847 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-18 03:43:52,847 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-18 03:43:52,847 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-18 03:43:52,847 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-18 03:43:52,848 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-18 03:43:52,848 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-18 03:43:52,848 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-18 03:43:52,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 03:43:52,849 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-18 03:43:52,849 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-18 03:43:52,850 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-18 03:43:52,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-18 03:43:52,850 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-18 03:43:52,850 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-18 03:43:52,851 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-18 03:43:52,851 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-18 03:43:52,851 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-18 03:43:52,851 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-18 03:43:52,852 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 -> COUNTEREXAMPLE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Probability for random criterion as percentage -> 50 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Seed for random criterion -> 213 [2024-10-18 03:43:53,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-18 03:43:53,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-18 03:43:53,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-18 03:43:53,102 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-18 03:43:53,103 INFO L274 PluginConnector]: CDTParser initialized [2024-10-18 03:43:53,104 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 03:43:54,444 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-18 03:43:54,658 INFO L384 CDTParser]: Found 1 translation units. [2024-10-18 03:43:54,659 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2024-10-18 03:43:54,669 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/26b97c8d9/bf67bf38ecfe4ec199e3c3a602cc8b1e/FLAGea8a7e5a7 [2024-10-18 03:43:54,684 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/26b97c8d9/bf67bf38ecfe4ec199e3c3a602cc8b1e [2024-10-18 03:43:54,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-18 03:43:54,687 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-18 03:43:54,688 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-18 03:43:54,688 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-18 03:43:54,692 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-18 03:43:54,693 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 03:43:54" (1/1) ... [2024-10-18 03:43:54,693 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70be326b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:43:54, skipping insertion in model container [2024-10-18 03:43:54,693 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 03:43:54" (1/1) ... [2024-10-18 03:43:54,744 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-18 03:43:54,986 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 03:43:54,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 03:43:55,000 INFO L200 MainTranslator]: Completed pre-run [2024-10-18 03:43:55,036 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 03:43:55,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 03:43:55,064 INFO L204 MainTranslator]: Completed translation [2024-10-18 03:43:55,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:43:55 WrapperNode [2024-10-18 03:43:55,064 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-18 03:43:55,065 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-18 03:43:55,065 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-18 03:43:55,066 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-18 03:43:55,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:43:55" (1/1) ... [2024-10-18 03:43:55,085 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:43:55" (1/1) ... [2024-10-18 03:43:55,107 INFO L138 Inliner]: procedures = 170, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 72 [2024-10-18 03:43:55,108 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-18 03:43:55,108 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-18 03:43:55,108 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-18 03:43:55,108 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-18 03:43:55,114 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:43:55" (1/1) ... [2024-10-18 03:43:55,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:43:55" (1/1) ... [2024-10-18 03:43:55,117 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:43:55" (1/1) ... [2024-10-18 03:43:55,117 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:43:55" (1/1) ... [2024-10-18 03:43:55,120 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:43:55" (1/1) ... [2024-10-18 03:43:55,127 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:43:55" (1/1) ... [2024-10-18 03:43:55,128 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:43:55" (1/1) ... [2024-10-18 03:43:55,129 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:43:55" (1/1) ... [2024-10-18 03:43:55,132 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-18 03:43:55,132 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-18 03:43:55,133 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-18 03:43:55,133 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-18 03:43:55,133 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:43:55" (1/1) ... [2024-10-18 03:43:55,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 03:43:55,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 03:43:55,164 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 03:43:55,165 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 03:43:55,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-18 03:43:55,201 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-18 03:43:55,201 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-18 03:43:55,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-18 03:43:55,201 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-18 03:43:55,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-18 03:43:55,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-18 03:43:55,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-18 03:43:55,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-18 03:43:55,201 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-18 03:43:55,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-18 03:43:55,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-18 03:43:55,203 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 03:43:55,344 INFO L238 CfgBuilder]: Building ICFG [2024-10-18 03:43:55,346 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-18 03:43:55,452 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-18 03:43:55,453 INFO L287 CfgBuilder]: Performing block encoding [2024-10-18 03:43:55,540 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-18 03:43:55,540 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-18 03:43:55,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 03:43:55 BoogieIcfgContainer [2024-10-18 03:43:55,541 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-18 03:43:55,542 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-18 03:43:55,542 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-18 03:43:55,545 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-18 03:43:55,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.10 03:43:54" (1/3) ... [2024-10-18 03:43:55,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@465d3e2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 03:43:55, skipping insertion in model container [2024-10-18 03:43:55,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:43:55" (2/3) ... [2024-10-18 03:43:55,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@465d3e2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 03:43:55, skipping insertion in model container [2024-10-18 03:43:55,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 03:43:55" (3/3) ... [2024-10-18 03:43:55,548 INFO L112 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2024-10-18 03:43:55,562 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-18 03:43:55,563 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-18 03:43:55,563 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-18 03:43:55,614 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-18 03:43:55,655 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 03:43:55,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 03:43:55,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 03:43:55,657 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 03:43:55,658 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 03:43:55,731 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 03:43:55,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:43:55,755 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-10-18 03:43:55,762 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;@4bbdedf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=RANDOM, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=50, mConComCheckerRandomSeed=213, mConComCheckerConditionCriterion=false [2024-10-18 03:43:55,763 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 03:43:56,046 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 03:43:56,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:43:56,050 INFO L85 PathProgramCache]: Analyzing trace with hash 559333503, now seen corresponding path program 1 times [2024-10-18 03:43:56,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 03:43:56,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836933227] [2024-10-18 03:43:56,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:43:56,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:43:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:43:56,225 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 03:43:56,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 03:43:56,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836933227] [2024-10-18 03:43:56,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836933227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 03:43:56,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 03:43:56,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 03:43:56,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282716083] [2024-10-18 03:43:56,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 03:43:56,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 03:43:56,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 03:43:56,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 03:43:56,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 03:43:56,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:43:56,260 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 03:43:56,261 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 03:43:56,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:43:56,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:43:56,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-18 03:43:56,499 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 03:43:56,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:43:56,500 INFO L85 PathProgramCache]: Analyzing trace with hash 555599738, now seen corresponding path program 1 times [2024-10-18 03:43:56,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 03:43:56,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380495629] [2024-10-18 03:43:56,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:43:56,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:43:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:43:57,044 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 03:43:57,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 03:43:57,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380495629] [2024-10-18 03:43:57,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380495629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 03:43:57,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 03:43:57,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-18 03:43:57,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673702421] [2024-10-18 03:43:57,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 03:43:57,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-18 03:43:57,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 03:43:57,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-18 03:43:57,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-18 03:43:57,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:43:57,048 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 03:43:57,048 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 03:43:57,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:43:57,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:43:57,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:43:57,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:43:57,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-18 03:43:57,313 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 03:43:57,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:43:57,313 INFO L85 PathProgramCache]: Analyzing trace with hash 812658582, now seen corresponding path program 1 times [2024-10-18 03:43:57,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 03:43:57,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756309359] [2024-10-18 03:43:57,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:43:57,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:43:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:43:58,039 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 03:43:58,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 03:43:58,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756309359] [2024-10-18 03:43:58,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756309359] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 03:43:58,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753178995] [2024-10-18 03:43:58,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:43:58,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 03:43:58,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 03:43:58,042 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 03:43:58,043 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 03:43:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:43:58,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-18 03:43:58,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 03:43:58,159 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 03:43:58,160 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 03:43:58,212 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 03:43:58,226 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 03:43:58,232 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 03:43:58,498 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 03:44:00,685 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 03:44:00,686 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 03:44:00,979 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_~v~0#1| 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 03:44:01,402 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 03:44:01,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753178995] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 03:44:01,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 03:44:01,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2024-10-18 03:44:01,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371671971] [2024-10-18 03:44:01,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 03:44:01,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-18 03:44:01,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 03:44:01,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-18 03:44:01,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=693, Unknown=5, NotChecked=56, Total=930 [2024-10-18 03:44:01,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:01,406 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 03:44:01,406 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 03:44:01,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:01,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:44:01,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:01,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:01,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:44:01,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-18 03:44:01,894 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-18 03:44:01,911 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 03:44:02,095 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 03:44:02,106 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-18 03:44:02,107 INFO L312 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2024-10-18 03:44:02,110 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 03:44:02,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 03:44:02,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 03:44:02,112 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 03:44:02,113 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 03:44:02,145 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 03:44:02,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:44:02,146 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 03:44:02,146 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;@4bbdedf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=RANDOM, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=50, mConComCheckerRandomSeed=213, mConComCheckerConditionCriterion=false [2024-10-18 03:44:02,146 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 03:44:02,245 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 03:44:02,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:44:02,246 INFO L85 PathProgramCache]: Analyzing trace with hash 648589722, now seen corresponding path program 1 times [2024-10-18 03:44:02,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 03:44:02,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811948645] [2024-10-18 03:44:02,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:44:02,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:44:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:44:02,259 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 03:44:02,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 03:44:02,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811948645] [2024-10-18 03:44:02,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811948645] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 03:44:02,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 03:44:02,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 03:44:02,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899084864] [2024-10-18 03:44:02,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 03:44:02,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 03:44:02,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 03:44:02,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 03:44:02,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 03:44:02,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:02,262 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 03:44:02,262 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 03:44:02,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:02,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:02,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-18 03:44:02,413 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 03:44:02,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:44:02,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1355408853, now seen corresponding path program 1 times [2024-10-18 03:44:02,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 03:44:02,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128041910] [2024-10-18 03:44:02,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:44:02,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:44:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:44:02,689 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 03:44:02,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 03:44:02,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128041910] [2024-10-18 03:44:02,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128041910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 03:44:02,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 03:44:02,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-18 03:44:02,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500460364] [2024-10-18 03:44:02,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 03:44:02,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-18 03:44:02,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 03:44:02,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-18 03:44:02,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-18 03:44:02,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:02,693 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 03:44:02,693 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 03:44:02,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:02,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:02,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:02,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:44:02,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-18 03:44:02,836 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 03:44:02,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:44:02,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1174367672, now seen corresponding path program 1 times [2024-10-18 03:44:02,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 03:44:02,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308880604] [2024-10-18 03:44:02,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:44:02,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:44:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 03:44:02,849 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 03:44:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 03:44:02,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 03:44:02,890 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 03:44:02,890 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-18 03:44:02,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-18 03:44:02,892 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-18 03:44:02,892 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-10-18 03:44:02,893 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 03:44:02,893 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-18 03:44:02,906 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-18 03:44:02,908 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 03:44:02,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 03:44:02,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 03:44:02,910 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 03:44:02,911 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 03:44:02,939 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 03:44:02,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:44:02,940 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 03:44:02,941 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;@4bbdedf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=RANDOM, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=50, mConComCheckerRandomSeed=213, mConComCheckerConditionCriterion=false [2024-10-18 03:44:02,941 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 03:44:03,442 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 03:44:03,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:44:03,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1146461421, now seen corresponding path program 1 times [2024-10-18 03:44:03,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 03:44:03,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623485465] [2024-10-18 03:44:03,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:44:03,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:44:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:44:03,453 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 03:44:03,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 03:44:03,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623485465] [2024-10-18 03:44:03,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623485465] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 03:44:03,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 03:44:03,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 03:44:03,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305183556] [2024-10-18 03:44:03,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 03:44:03,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 03:44:03,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 03:44:03,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 03:44:03,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 03:44:03,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:03,455 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 03:44:03,455 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 03:44:03,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:03,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:03,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-18 03:44:03,808 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 03:44:03,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:44:03,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1959299849, now seen corresponding path program 1 times [2024-10-18 03:44:03,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 03:44:03,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057662814] [2024-10-18 03:44:03,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:44:03,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:44:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:44:04,115 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 03:44:04,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 03:44:04,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057662814] [2024-10-18 03:44:04,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057662814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 03:44:04,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 03:44:04,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-18 03:44:04,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351247068] [2024-10-18 03:44:04,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 03:44:04,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-18 03:44:04,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 03:44:04,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-18 03:44:04,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-18 03:44:04,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:04,121 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 03:44:04,122 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 03:44:04,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:04,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:04,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:04,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:44:04,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-18 03:44:04,326 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 03:44:04,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:44:04,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1017090324, now seen corresponding path program 1 times [2024-10-18 03:44:04,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 03:44:04,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545617717] [2024-10-18 03:44:04,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:44:04,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:44:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:44:04,803 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 03:44:04,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 03:44:04,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545617717] [2024-10-18 03:44:04,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545617717] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 03:44:04,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278759512] [2024-10-18 03:44:04,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:44:04,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 03:44:04,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 03:44:04,806 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 03:44:04,809 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 03:44:04,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:44:04,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-18 03:44:04,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 03:44:04,921 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-18 03:44:04,921 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 03:44:05,024 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 03:44:05,143 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 03:44:05,212 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 03:44:05,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 11 treesize of output 11 [2024-10-18 03:44:05,365 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-10-18 03:44:05,365 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 03:44:05,471 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 03:44:05,472 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 03:44:05,627 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread2of2ForFork0_~v~0#1| 4294967296)) (.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse3 (= .cse0 (mod (select .cse2 |c_~#value~0.offset|) 4294967296)))) (and (or (forall ((|thr1Thread2of2ForFork0_~#casret~0#1.offset| Int)) (< .cse0 (mod (select (select (let ((.cse1 (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ |c_thr1Thread2of2ForFork0_~v~0#1| 1))))) (store .cse1 |c_thr1Thread2of2ForFork0_~#casret~0#1.base| (store (select .cse1 |c_thr1Thread2of2ForFork0_~#casret~0#1.base|) |thr1Thread2of2ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse3)) (or .cse3 (forall ((v_DerPreprocessor_7 (Array Int Int))) (< .cse0 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) is different from false [2024-10-18 03:44:06,253 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 03:44:08,058 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 03:44:08,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278759512] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 03:44:08,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 03:44:08,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 36 [2024-10-18 03:44:08,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394396383] [2024-10-18 03:44:08,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 03:44:08,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-18 03:44:08,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 03:44:08,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-18 03:44:08,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=999, Unknown=10, NotChecked=134, Total=1332 [2024-10-18 03:44:08,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:08,060 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 03:44:08,060 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 03:44:08,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:08,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:44:08,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:08,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:08,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:44:08,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-18 03:44:08,847 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 03:44:09,032 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 03:44:09,033 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 03:44:09,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:44:09,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1830282799, now seen corresponding path program 1 times [2024-10-18 03:44:09,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 03:44:09,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500707564] [2024-10-18 03:44:09,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:44:09,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:44:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 03:44:09,048 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 03:44:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 03:44:09,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 03:44:09,072 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 03:44:09,072 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-18 03:44:09,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-18 03:44:09,075 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-18 03:44:09,075 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-10-18 03:44:09,075 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 03:44:09,076 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-18 03:44:09,091 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-18 03:44:09,092 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 03:44:09,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 03:44:09,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 03:44:09,094 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 03:44:09,095 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 03:44:09,131 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 03:44:09,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:44:09,132 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-10-18 03:44:09,132 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;@4bbdedf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=RANDOM, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=50, mConComCheckerRandomSeed=213, mConComCheckerConditionCriterion=false [2024-10-18 03:44:09,132 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 03:44:10,299 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 03:44:10,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:44:10,300 INFO L85 PathProgramCache]: Analyzing trace with hash 289691451, now seen corresponding path program 1 times [2024-10-18 03:44:10,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 03:44:10,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669769797] [2024-10-18 03:44:10,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:44:10,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:44:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:44:10,312 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 03:44:10,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 03:44:10,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669769797] [2024-10-18 03:44:10,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669769797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 03:44:10,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 03:44:10,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 03:44:10,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31401016] [2024-10-18 03:44:10,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 03:44:10,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 03:44:10,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 03:44:10,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 03:44:10,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 03:44:10,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:10,313 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 03:44:10,313 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 03:44:10,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:10,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:10,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-18 03:44:10,921 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 03:44:10,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:44:10,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1893296980, now seen corresponding path program 1 times [2024-10-18 03:44:10,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 03:44:10,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944251322] [2024-10-18 03:44:10,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:44:10,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:44:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:44:11,565 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 03:44:11,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 03:44:11,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944251322] [2024-10-18 03:44:11,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944251322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 03:44:11,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 03:44:11,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-18 03:44:11,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114641958] [2024-10-18 03:44:11,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 03:44:11,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-18 03:44:11,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 03:44:11,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-18 03:44:11,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-18 03:44:11,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:11,568 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 03:44:11,568 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 03:44:11,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:11,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:11,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:11,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:44:11,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-18 03:44:11,936 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 03:44:11,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:44:11,937 INFO L85 PathProgramCache]: Analyzing trace with hash -708586065, now seen corresponding path program 1 times [2024-10-18 03:44:11,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 03:44:11,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027243581] [2024-10-18 03:44:11,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:44:11,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:44:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:44:12,503 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 03:44:12,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 03:44:12,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027243581] [2024-10-18 03:44:12,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027243581] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 03:44:12,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379332247] [2024-10-18 03:44:12,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:44:12,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 03:44:12,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 03:44:12,506 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 03:44:12,507 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 03:44:12,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:44:12,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-18 03:44:12,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 03:44:12,648 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-18 03:44:12,648 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 03:44:12,737 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 03:44:12,849 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 03:44:12,920 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 03:44:12,921 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 03:44:13,054 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-10-18 03:44:13,054 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 03:44:13,175 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 03:44:13,175 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 03:44:19,948 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 03:44:19,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379332247] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 03:44:19,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 03:44:19,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 37 [2024-10-18 03:44:19,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494981976] [2024-10-18 03:44:19,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 03:44:19,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-18 03:44:19,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 03:44:19,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-18 03:44:19,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1136, Unknown=13, NotChecked=0, Total=1332 [2024-10-18 03:44:19,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:19,953 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 03:44:19,953 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 03:44:19,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:19,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:44:19,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:21,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:21,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:44:21,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-18 03:44:21,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-18 03:44:21,975 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 03:44:21,976 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 03:44:21,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:44:21,976 INFO L85 PathProgramCache]: Analyzing trace with hash -857142964, now seen corresponding path program 1 times [2024-10-18 03:44:21,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 03:44:21,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837041652] [2024-10-18 03:44:21,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:44:21,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:44:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:44:22,563 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 03:44:22,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 03:44:22,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837041652] [2024-10-18 03:44:22,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837041652] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 03:44:22,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174899453] [2024-10-18 03:44:22,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:44:22,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 03:44:22,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 03:44:22,565 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 03:44:22,567 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 03:44:22,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:44:22,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-18 03:44:22,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 03:44:22,682 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 03:44:22,685 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 03:44:22,688 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 03:44:22,699 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 03:44:22,703 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 03:44:22,704 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 03:44:22,710 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 03:44:22,719 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 03:44:22,857 INFO L349 Elim1Store]: treesize reduction 55, result has 24.7 percent of original size [2024-10-18 03:44:22,858 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 03:44:22,870 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 03:44:22,930 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-18 03:44:22,931 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 03:44:22,994 INFO L349 Elim1Store]: treesize reduction 51, result has 22.7 percent of original size [2024-10-18 03:44:22,995 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 03:44:23,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-18 03:44:23,006 INFO L349 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2024-10-18 03:44:23,006 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 03:44:23,085 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 03:44:23,085 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 03:44:23,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174899453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 03:44:23,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-18 03:44:23,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 19 [2024-10-18 03:44:23,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468309174] [2024-10-18 03:44:23,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 03:44:23,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-18 03:44:23,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 03:44:23,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-18 03:44:23,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2024-10-18 03:44:23,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:23,087 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 03:44:23,087 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 03:44:23,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:23,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:44:23,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-10-18 03:44:23,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:27,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:27,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:44:27,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-18 03:44:27,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-18 03:44:27,077 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 03:44:27,263 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 03:44:27,263 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 03:44:27,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:44:27,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1144401957, now seen corresponding path program 1 times [2024-10-18 03:44:27,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 03:44:27,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444782892] [2024-10-18 03:44:27,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:44:27,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:44:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:44:29,466 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 03:44:29,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 03:44:29,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444782892] [2024-10-18 03:44:29,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444782892] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 03:44:29,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369321012] [2024-10-18 03:44:29,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:44:29,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 03:44:29,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 03:44:29,469 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 03:44:29,470 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 03:44:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:44:29,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-18 03:44:29,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 03:44:29,636 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-18 03:44:29,637 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 03:44:29,706 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 03:44:29,733 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-18 03:44:29,733 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 03:44:29,846 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 03:44:29,851 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 03:44:29,925 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-18 03:44:29,925 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 03:44:30,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-18 03:44:30,056 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 03:44:30,060 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 03:44:30,065 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 03:44:30,067 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 03:44:30,156 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 03:44:30,157 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 03:44:31,471 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 03:44:31,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 03:44:31,479 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 03:44:31,493 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 03:44:31,494 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 03:44:31,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 03:44:31,518 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 03:44:31,523 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 03:44:33,898 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 03:44:33,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369321012] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 03:44:33,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 03:44:33,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 10, 12] total 44 [2024-10-18 03:44:33,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117444586] [2024-10-18 03:44:33,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 03:44:33,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-10-18 03:44:33,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 03:44:33,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-18 03:44:33,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1820, Unknown=20, NotChecked=0, Total=1980 [2024-10-18 03:44:33,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:33,900 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 03:44:33,901 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 03:44:33,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:33,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:44:33,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-10-18 03:44:33,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-18 03:44:33,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:37,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:44:37,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 03:44:37,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-10-18 03:44:37,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-18 03:44:37,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-18 03:44:37,029 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 03:44:37,216 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 03:44:37,216 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 03:44:37,300 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 03:44:54,303 INFO L85 PathProgramCache]: Analyzing trace with hash 878789567, now seen corresponding path program 1 times [2024-10-18 03:44:54,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:44:54,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:44:54,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-18 03:44:54,317 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.ConditionalCommutativityCounterexampleChecker.getInterpolants(ConditionalCommutativityCounterexampleChecker.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isCounterexampleFeasible(PartialOrderCegarLoop.java:420) 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) 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) ... 29 more [2024-10-18 03:44:54,320 INFO L158 Benchmark]: Toolchain (without parser) took 59632.93ms. Allocated memory was 169.9MB in the beginning and 520.1MB in the end (delta: 350.2MB). Free memory was 137.7MB in the beginning and 416.5MB in the end (delta: -278.8MB). Peak memory consumption was 71.7MB. Max. memory is 16.1GB. [2024-10-18 03:44:54,321 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 169.9MB. Free memory is still 139.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-18 03:44:54,321 INFO L158 Benchmark]: CACSL2BoogieTranslator took 376.79ms. Allocated memory is still 169.9MB. Free memory was 137.5MB in the beginning and 120.5MB in the end (delta: 17.0MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2024-10-18 03:44:54,321 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.47ms. Allocated memory is still 169.9MB. Free memory was 120.5MB in the beginning and 119.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-18 03:44:54,321 INFO L158 Benchmark]: Boogie Preprocessor took 23.64ms. Allocated memory is still 169.9MB. Free memory was 118.4MB in the beginning and 117.5MB in the end (delta: 933.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-18 03:44:54,321 INFO L158 Benchmark]: RCFGBuilder took 408.34ms. Allocated memory is still 169.9MB. Free memory was 117.5MB in the beginning and 122.3MB in the end (delta: -4.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-18 03:44:54,322 INFO L158 Benchmark]: TraceAbstraction took 58777.50ms. Allocated memory was 169.9MB in the beginning and 520.1MB in the end (delta: 350.2MB). Free memory was 121.4MB in the beginning and 416.5MB in the end (delta: -295.0MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. [2024-10-18 03:44:54,322 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.16ms. Allocated memory is still 169.9MB. Free memory is still 139.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 376.79ms. Allocated memory is still 169.9MB. Free memory was 137.5MB in the beginning and 120.5MB in the end (delta: 17.0MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.47ms. Allocated memory is still 169.9MB. Free memory was 120.5MB in the beginning and 119.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.64ms. Allocated memory is still 169.9MB. Free memory was 118.4MB in the beginning and 117.5MB in the end (delta: 933.9kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 408.34ms. Allocated memory is still 169.9MB. Free memory was 117.5MB in the beginning and 122.3MB in the end (delta: -4.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 58777.50ms. Allocated memory was 169.9MB in the beginning and 520.1MB in the end (delta: 350.2MB). Free memory was 121.4MB in the beginning and 416.5MB in the end (delta: -295.0MB). Peak memory consumption was 57.9MB. 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: 256, independent: 224, independent conditional: 69, independent unconditional: 155, 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: 234, independent: 224, independent conditional: 69, independent unconditional: 155, 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: 234, independent: 224, independent conditional: 69, independent unconditional: 155, 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: 234, independent: 224, independent conditional: 69, independent unconditional: 155, 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: 244, independent: 224, independent conditional: 69, independent unconditional: 155, 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: 244, independent: 224, independent conditional: 0, independent unconditional: 224, 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: 244, independent: 224, independent conditional: 0, independent unconditional: 224, 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: 641, independent: 252, independent conditional: 0, independent unconditional: 252, dependent: 389, dependent conditional: 0, dependent unconditional: 389, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 244, independent: 98, independent conditional: 0, independent unconditional: 98, 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: 69, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 244, independent: 224, independent conditional: 69, independent unconditional: 155, 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: 244, independent: 224, independent conditional: 0, independent unconditional: 224, 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: 244, independent: 224, independent conditional: 0, independent unconditional: 224, 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: 641, independent: 252, independent conditional: 0, independent unconditional: 252, dependent: 389, dependent conditional: 0, dependent unconditional: 389, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 244, independent: 98, independent conditional: 0, independent unconditional: 98, 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: 69 ], Independence queries for same thread: 22, Persistent sets #1 benchmarks: Persistent set computation time: 0.7s, 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: 256, independent: 224, independent conditional: 69, independent unconditional: 155, 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: 234, independent: 224, independent conditional: 69, independent unconditional: 155, 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: 234, independent: 224, independent conditional: 69, independent unconditional: 155, 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: 234, independent: 224, independent conditional: 69, independent unconditional: 155, 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: 244, independent: 224, independent conditional: 69, independent unconditional: 155, 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: 244, independent: 224, independent conditional: 0, independent unconditional: 224, 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: 244, independent: 224, independent conditional: 0, independent unconditional: 224, 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: 641, independent: 252, independent conditional: 0, independent unconditional: 252, dependent: 389, dependent conditional: 0, dependent unconditional: 389, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 244, independent: 98, independent conditional: 0, independent unconditional: 98, 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: 69, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 244, independent: 224, independent conditional: 69, independent unconditional: 155, 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: 244, independent: 224, independent conditional: 0, independent unconditional: 224, 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: 244, independent: 224, independent conditional: 0, independent unconditional: 224, 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: 641, independent: 252, independent conditional: 0, independent unconditional: 252, dependent: 389, dependent conditional: 0, dependent unconditional: 389, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 244, independent: 98, independent conditional: 0, independent unconditional: 98, 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: 69 ], Independence queries for same thread: 22 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 171, independent: 154, independent conditional: 33, independent unconditional: 121, 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: 159, independent: 154, independent conditional: 33, independent unconditional: 121, 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: 159, independent: 154, independent conditional: 33, independent unconditional: 121, 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: 159, independent: 154, independent conditional: 33, independent unconditional: 121, 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: 164, independent: 154, independent conditional: 33, independent unconditional: 121, 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: 164, independent: 154, independent conditional: 0, independent unconditional: 154, 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: 164, independent: 154, independent conditional: 0, independent unconditional: 154, 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: 229, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 149, dependent conditional: 0, dependent unconditional: 149, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 164, independent: 55, independent conditional: 0, independent unconditional: 55, 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: 33, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 164, independent: 154, independent conditional: 33, independent unconditional: 121, 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: 164, independent: 154, independent conditional: 0, independent unconditional: 154, 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: 164, independent: 154, independent conditional: 0, independent unconditional: 154, 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: 229, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 149, dependent conditional: 0, dependent unconditional: 149, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 164, independent: 55, independent conditional: 0, independent unconditional: 55, 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: 33 ], Independence queries for same thread: 12, Persistent sets #1 benchmarks: Persistent set computation time: 0.2s, 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: 171, independent: 154, independent conditional: 33, independent unconditional: 121, 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: 159, independent: 154, independent conditional: 33, independent unconditional: 121, 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: 159, independent: 154, independent conditional: 33, independent unconditional: 121, 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: 159, independent: 154, independent conditional: 33, independent unconditional: 121, 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: 164, independent: 154, independent conditional: 33, independent unconditional: 121, 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: 164, independent: 154, independent conditional: 0, independent unconditional: 154, 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: 164, independent: 154, independent conditional: 0, independent unconditional: 154, 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: 229, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 149, dependent conditional: 0, dependent unconditional: 149, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 164, independent: 55, independent conditional: 0, independent unconditional: 55, 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: 33, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 164, independent: 154, independent conditional: 33, independent unconditional: 121, 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: 164, independent: 154, independent conditional: 0, independent unconditional: 154, 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: 164, independent: 154, independent conditional: 0, independent unconditional: 154, 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: 229, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 149, dependent conditional: 0, dependent unconditional: 149, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 164, independent: 55, independent conditional: 0, independent unconditional: 55, 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: 33 ], Independence queries for same thread: 12 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 504, independent: 452, independent conditional: 92, independent unconditional: 360, 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: 471, independent: 452, independent conditional: 92, independent unconditional: 360, 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: 471, independent: 452, independent conditional: 92, independent unconditional: 360, 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: 471, independent: 452, independent conditional: 92, independent unconditional: 360, 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: 490, independent: 452, independent conditional: 92, independent unconditional: 360, 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: 490, independent: 452, independent conditional: 0, independent unconditional: 452, 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: 490, independent: 452, independent conditional: 0, independent unconditional: 452, 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: 885, independent: 274, independent conditional: 0, independent unconditional: 274, dependent: 610, dependent conditional: 0, dependent unconditional: 610, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 490, independent: 146, independent conditional: 0, independent unconditional: 146, 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: 92, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 490, independent: 452, independent conditional: 92, independent unconditional: 360, 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: 490, independent: 452, independent conditional: 0, independent unconditional: 452, 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: 490, independent: 452, independent conditional: 0, independent unconditional: 452, 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: 885, independent: 274, independent conditional: 0, independent unconditional: 274, dependent: 610, dependent conditional: 0, dependent unconditional: 610, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 490, independent: 146, independent conditional: 0, independent unconditional: 146, 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: 92 ], Independence queries for same thread: 33, Persistent sets #1 benchmarks: Persistent set computation time: 0.9s, 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: 504, independent: 452, independent conditional: 92, independent unconditional: 360, 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: 471, independent: 452, independent conditional: 92, independent unconditional: 360, 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: 471, independent: 452, independent conditional: 92, independent unconditional: 360, 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: 471, independent: 452, independent conditional: 92, independent unconditional: 360, 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: 490, independent: 452, independent conditional: 92, independent unconditional: 360, 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: 490, independent: 452, independent conditional: 0, independent unconditional: 452, 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: 490, independent: 452, independent conditional: 0, independent unconditional: 452, 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: 885, independent: 274, independent conditional: 0, independent unconditional: 274, dependent: 610, dependent conditional: 0, dependent unconditional: 610, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 490, independent: 146, independent conditional: 0, independent unconditional: 146, 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: 92, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 490, independent: 452, independent conditional: 92, independent unconditional: 360, 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: 490, independent: 452, independent conditional: 0, independent unconditional: 452, 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: 490, independent: 452, independent conditional: 0, independent unconditional: 452, 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: 885, independent: 274, independent conditional: 0, independent unconditional: 274, dependent: 610, dependent conditional: 0, dependent unconditional: 610, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 490, independent: 146, independent conditional: 0, independent unconditional: 146, 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: 92 ], 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 03:44:54,351 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 03:44:54,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Forceful destruction successful, exit code 0 [2024-10-18 03:44:54,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Forceful destruction successful, exit code 0 [2024-10-18 03:44:54,951 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 03:44:55,173 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 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 COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 50 --traceabstraction.seed.for.random.criterion 213 -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 03:44:57,142 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-18 03:44:57,218 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf [2024-10-18 03:44:57,223 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-18 03:44:57,224 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-18 03:44:57,248 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-18 03:44:57,249 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-18 03:44:57,249 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-18 03:44:57,251 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-18 03:44:57,251 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-18 03:44:57,252 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-18 03:44:57,252 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-18 03:44:57,252 INFO L153 SettingsManager]: * Use SBE=true [2024-10-18 03:44:57,252 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-18 03:44:57,253 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-18 03:44:57,253 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-18 03:44:57,253 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-18 03:44:57,256 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-18 03:44:57,257 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-18 03:44:57,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-18 03:44:57,257 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-18 03:44:57,259 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-18 03:44:57,259 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-18 03:44:57,260 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-18 03:44:57,260 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-18 03:44:57,260 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-18 03:44:57,261 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-18 03:44:57,261 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-18 03:44:57,261 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-18 03:44:57,261 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-18 03:44:57,261 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-18 03:44:57,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 03:44:57,262 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-18 03:44:57,262 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-18 03:44:57,262 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-18 03:44:57,262 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-18 03:44:57,262 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-18 03:44:57,263 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-18 03:44:57,263 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-18 03:44:57,263 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-18 03:44:57,263 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-18 03:44:57,263 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-18 03:44:57,264 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-18 03:44:57,264 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 -> COUNTEREXAMPLE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Probability for random criterion as percentage -> 50 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Seed for random criterion -> 213 [2024-10-18 03:44:57,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-18 03:44:57,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-18 03:44:57,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-18 03:44:57,569 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-18 03:44:57,569 INFO L274 PluginConnector]: CDTParser initialized [2024-10-18 03:44:57,570 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 03:44:58,839 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-18 03:44:59,065 INFO L384 CDTParser]: Found 1 translation units. [2024-10-18 03:44:59,067 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2024-10-18 03:44:59,085 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c8fcfb697/39c1ecf2529446f383aa6b280618bf52/FLAGd28a3e74a [2024-10-18 03:44:59,400 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c8fcfb697/39c1ecf2529446f383aa6b280618bf52 [2024-10-18 03:44:59,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-18 03:44:59,404 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-18 03:44:59,405 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-18 03:44:59,406 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-18 03:44:59,410 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-18 03:44:59,411 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 03:44:59" (1/1) ... [2024-10-18 03:44:59,411 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@249792a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:44:59, skipping insertion in model container [2024-10-18 03:44:59,411 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 03:44:59" (1/1) ... [2024-10-18 03:44:59,447 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-18 03:44:59,733 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 03:44:59,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 03:44:59,749 INFO L200 MainTranslator]: Completed pre-run [2024-10-18 03:44:59,789 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 03:44:59,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 03:44:59,832 INFO L204 MainTranslator]: Completed translation [2024-10-18 03:44:59,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:44:59 WrapperNode [2024-10-18 03:44:59,832 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-18 03:44:59,833 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-18 03:44:59,833 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-18 03:44:59,833 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-18 03:44:59,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:44:59" (1/1) ... [2024-10-18 03:44:59,855 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:44:59" (1/1) ... [2024-10-18 03:44:59,873 INFO L138 Inliner]: procedures = 174, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 73 [2024-10-18 03:44:59,875 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-18 03:44:59,876 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-18 03:44:59,876 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-18 03:44:59,876 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-18 03:44:59,882 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:44:59" (1/1) ... [2024-10-18 03:44:59,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:44:59" (1/1) ... [2024-10-18 03:44:59,886 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:44:59" (1/1) ... [2024-10-18 03:44:59,889 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:44:59" (1/1) ... [2024-10-18 03:44:59,899 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:44:59" (1/1) ... [2024-10-18 03:44:59,904 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:44:59" (1/1) ... [2024-10-18 03:44:59,907 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:44:59" (1/1) ... [2024-10-18 03:44:59,908 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:44:59" (1/1) ... [2024-10-18 03:44:59,915 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-18 03:44:59,920 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-18 03:44:59,920 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-18 03:44:59,920 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-18 03:44:59,921 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:44:59" (1/1) ... [2024-10-18 03:44:59,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 03:44:59,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 03:44:59,956 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 03:44:59,961 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 03:44:59,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-10-18 03:44:59,994 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-18 03:44:59,994 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-18 03:44:59,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-18 03:44:59,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-18 03:44:59,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-18 03:44:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-18 03:44:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-10-18 03:44:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-10-18 03:44:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-10-18 03:44:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-18 03:44:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-18 03:44:59,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-18 03:44:59,996 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 03:45:00,111 INFO L238 CfgBuilder]: Building ICFG [2024-10-18 03:45:00,113 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-18 03:45:00,281 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-18 03:45:00,281 INFO L287 CfgBuilder]: Performing block encoding [2024-10-18 03:45:00,415 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-18 03:45:00,415 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-18 03:45:00,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 03:45:00 BoogieIcfgContainer [2024-10-18 03:45:00,416 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-18 03:45:00,419 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-18 03:45:00,419 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-18 03:45:00,422 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-18 03:45:00,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.10 03:44:59" (1/3) ... [2024-10-18 03:45:00,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43633d53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 03:45:00, skipping insertion in model container [2024-10-18 03:45:00,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:44:59" (2/3) ... [2024-10-18 03:45:00,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43633d53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 03:45:00, skipping insertion in model container [2024-10-18 03:45:00,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 03:45:00" (3/3) ... [2024-10-18 03:45:00,425 INFO L112 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2024-10-18 03:45:00,442 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-18 03:45:00,442 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-18 03:45:00,442 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-18 03:45:00,506 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-18 03:45:00,549 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 03:45:00,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 03:45:00,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 03:45:00,552 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 03:45:00,553 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 03:45:00,629 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 03:45:00,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:45:00,646 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-10-18 03:45:00,652 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;@7bb11a85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=RANDOM, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=50, mConComCheckerRandomSeed=213, mConComCheckerConditionCriterion=false [2024-10-18 03:45:00,652 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 03:45:00,973 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 03:45:00,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:45:00,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1901459519, now seen corresponding path program 1 times [2024-10-18 03:45:00,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 03:45:00,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [202255036] [2024-10-18 03:45:00,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:45:00,987 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 03:45:00,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 03:45:01,009 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 03:45:01,010 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 03:45:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:45:01,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-18 03:45:01,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 03:45:01,102 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 03:45:01,103 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 03:45:01,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-18 03:45:01,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [202255036] [2024-10-18 03:45:01,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [202255036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 03:45:01,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 03:45:01,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 03:45:01,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023113373] [2024-10-18 03:45:01,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 03:45:01,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 03:45:01,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-18 03:45:01,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 03:45:01,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 03:45:01,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:01,146 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 03:45:01,147 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 03:45:01,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:01,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:01,444 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 (3)] Forceful destruction successful, exit code 0 [2024-10-18 03:45:01,638 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 03:45:01,638 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 03:45:01,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:45:01,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1726443972, now seen corresponding path program 1 times [2024-10-18 03:45:01,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 03:45:01,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [589543825] [2024-10-18 03:45:01,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:45:01,640 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 03:45:01,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 03:45:01,645 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 03:45:01,647 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 03:45:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:45:01,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-18 03:45:01,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 03:45:01,800 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-18 03:45:01,801 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 03:45:01,904 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 03:45:01,910 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 03:45:01,943 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 03:45:01,943 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 03:45:01,943 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-18 03:45:01,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [589543825] [2024-10-18 03:45:01,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [589543825] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 03:45:01,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 03:45:01,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-18 03:45:01,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671230306] [2024-10-18 03:45:01,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 03:45:01,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-18 03:45:01,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-18 03:45:01,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-18 03:45:01,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-18 03:45:01,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:01,947 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 03:45:01,947 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 03:45:01,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:01,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:02,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:02,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 03:45:02,256 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 03:45:02,451 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 03:45:02,452 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 03:45:02,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:45:02,453 INFO L85 PathProgramCache]: Analyzing trace with hash -102633002, now seen corresponding path program 1 times [2024-10-18 03:45:02,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 03:45:02,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017983055] [2024-10-18 03:45:02,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:45:02,453 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 03:45:02,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 03:45:02,456 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 03:45:02,457 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 03:45:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:45:02,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-18 03:45:02,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 03:45:02,574 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2024-10-18 03:45:02,575 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 03:45:02,586 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 03:45:02,611 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 03:45:02,666 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 03:45:02,669 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 03:45:02,689 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 03:45:02,691 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 03:45:02,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-18 03:45:02,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017983055] [2024-10-18 03:45:02,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2017983055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 03:45:02,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 03:45:02,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-18 03:45:02,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864582994] [2024-10-18 03:45:02,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 03:45:02,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-18 03:45:02,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-18 03:45:02,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-18 03:45:02,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-18 03:45:02,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:02,696 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 03:45:02,696 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 03:45:02,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:02,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 03:45:02,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:02,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:02,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 03:45:02,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-18 03:45:02,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-18 03:45:02,996 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 03:45:03,192 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 03:45:03,199 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-18 03:45:03,201 INFO L312 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2024-10-18 03:45:03,204 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 03:45:03,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 03:45:03,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 03:45:03,208 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 03:45:03,209 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 03:45:03,239 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 03:45:03,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:45:03,239 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 03:45:03,240 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;@7bb11a85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=RANDOM, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=50, mConComCheckerRandomSeed=213, mConComCheckerConditionCriterion=false [2024-10-18 03:45:03,240 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 03:45:03,366 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 03:45:03,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:45:03,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1941491556, now seen corresponding path program 1 times [2024-10-18 03:45:03,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 03:45:03,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1397857255] [2024-10-18 03:45:03,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:45:03,370 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 03:45:03,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 03:45:03,373 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 03:45:03,375 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 03:45:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:45:03,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-18 03:45:03,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 03:45:03,417 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 03:45:03,417 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 03:45:03,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-18 03:45:03,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1397857255] [2024-10-18 03:45:03,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1397857255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 03:45:03,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 03:45:03,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 03:45:03,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760424712] [2024-10-18 03:45:03,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 03:45:03,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 03:45:03,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-18 03:45:03,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 03:45:03,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 03:45:03,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:03,419 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 03:45:03,419 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 03:45:03,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:03,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:03,648 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 03:45:03,845 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 03:45:03,846 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 03:45:03,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:45:03,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1255275433, now seen corresponding path program 1 times [2024-10-18 03:45:03,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 03:45:03,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1627421192] [2024-10-18 03:45:03,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:45:03,847 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 03:45:03,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 03:45:03,851 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 03:45:03,852 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 03:45:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:45:03,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-18 03:45:03,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 03:45:03,934 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-18 03:45:03,934 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 03:45:04,001 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 03:45:04,005 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 03:45:04,033 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 03:45:04,034 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 03:45:04,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-18 03:45:04,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1627421192] [2024-10-18 03:45:04,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1627421192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 03:45:04,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 03:45:04,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-18 03:45:04,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140637562] [2024-10-18 03:45:04,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 03:45:04,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-18 03:45:04,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-18 03:45:04,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-18 03:45:04,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-18 03:45:04,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:04,035 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 03:45:04,035 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 03:45:04,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:04,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:04,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:04,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 03:45:04,161 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 03:45:04,360 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 03:45:04,360 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 03:45:04,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:45:04,361 INFO L85 PathProgramCache]: Analyzing trace with hash 567669754, now seen corresponding path program 1 times [2024-10-18 03:45:04,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 03:45:04,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51182067] [2024-10-18 03:45:04,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:45:04,362 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 03:45:04,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 03:45:04,363 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 03:45:04,364 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 03:45:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 03:45:04,422 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 03:45:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 03:45:04,470 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-18 03:45:04,470 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 03:45:04,470 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-18 03:45:04,480 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 (9)] Forceful destruction successful, exit code 0 [2024-10-18 03:45:04,673 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 03:45:04,678 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-18 03:45:04,678 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-10-18 03:45:04,679 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 03:45:04,679 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-18 03:45:04,704 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-18 03:45:04,707 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 03:45:04,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 03:45:04,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 03:45:04,710 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 03:45:04,715 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 03:45:04,748 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 03:45:04,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:45:04,749 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 03:45:04,749 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;@7bb11a85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=RANDOM, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=50, mConComCheckerRandomSeed=213, mConComCheckerConditionCriterion=false [2024-10-18 03:45:04,749 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 03:45:05,600 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 03:45:05,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:45:05,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1753159339, now seen corresponding path program 1 times [2024-10-18 03:45:05,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 03:45:05,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1072850424] [2024-10-18 03:45:05,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:45:05,601 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 03:45:05,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 03:45:05,604 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 03:45:05,605 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 03:45:05,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:45:05,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-18 03:45:05,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 03:45:05,649 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 03:45:05,649 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 03:45:05,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-18 03:45:05,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1072850424] [2024-10-18 03:45:05,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1072850424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 03:45:05,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 03:45:05,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 03:45:05,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283815846] [2024-10-18 03:45:05,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 03:45:05,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 03:45:05,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-18 03:45:05,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 03:45:05,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 03:45:05,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:05,650 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 03:45:05,650 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 03:45:05,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:06,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:06,247 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 03:45:06,446 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 03:45:06,447 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 03:45:06,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:45:06,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1668501579, now seen corresponding path program 1 times [2024-10-18 03:45:06,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 03:45:06,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480917012] [2024-10-18 03:45:06,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:45:06,448 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 03:45:06,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 03:45:06,450 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 03:45:06,451 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 03:45:06,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:45:06,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-18 03:45:06,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 03:45:06,558 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-18 03:45:06,559 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 03:45:06,636 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 03:45:06,641 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 03:45:06,681 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 03:45:06,682 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 03:45:06,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-18 03:45:06,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480917012] [2024-10-18 03:45:06,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [480917012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 03:45:06,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 03:45:06,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-18 03:45:06,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811746547] [2024-10-18 03:45:06,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 03:45:06,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-18 03:45:06,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-18 03:45:06,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-18 03:45:06,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-18 03:45:06,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:06,683 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 03:45:06,683 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 03:45:06,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:06,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:06,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:06,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 03:45:06,918 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 (12)] Ended with exit code 0 [2024-10-18 03:45:07,111 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 03:45:07,112 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 03:45:07,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:45:07,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1301353490, now seen corresponding path program 1 times [2024-10-18 03:45:07,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 03:45:07,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [459822641] [2024-10-18 03:45:07,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:45:07,113 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 03:45:07,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 03:45:07,114 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 03:45:07,115 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 03:45:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:45:07,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-18 03:45:07,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 03:45:07,212 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-18 03:45:07,212 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 03:45:07,280 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 03:45:07,309 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-18 03:45:07,309 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 03:45:07,375 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 03:45:07,378 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 03:45:07,415 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 03:45:07,416 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 03:45:07,475 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|) |c_thr1Thread2of2ForFork0_~v~0#1|))) (and (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) (or (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| |c_thr1Thread2of2ForFork0_~vn~0#1|)) |c_thr1Thread2of2ForFork0_~#casret~0#1.base| v_DerPreprocessor_4) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of2ForFork0_~v~0#1|)) (not .cse0))))) is different from false [2024-10-18 03:45:07,499 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 03:45:07,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 03:45:07,508 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 03:45:07,511 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 03:45:07,515 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 03:45:07,622 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 03:45:07,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-18 03:45:07,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [459822641] [2024-10-18 03:45:07,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [459822641] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 03:45:07,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-18 03:45:07,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-10-18 03:45:07,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490229391] [2024-10-18 03:45:07,623 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-18 03:45:07,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-18 03:45:07,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-18 03:45:07,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-18 03:45:07,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=101, Unknown=2, NotChecked=42, Total=182 [2024-10-18 03:45:07,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:07,624 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 03:45:07,624 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 03:45:07,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:07,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 03:45:07,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:07,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:07,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 03:45:07,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-18 03:45:07,919 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 (13)] Ended with exit code 0 [2024-10-18 03:45:08,114 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 03:45:08,115 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 03:45:08,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:45:08,115 INFO L85 PathProgramCache]: Analyzing trace with hash -763680015, now seen corresponding path program 1 times [2024-10-18 03:45:08,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 03:45:08,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1398623092] [2024-10-18 03:45:08,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:45:08,116 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 03:45:08,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 03:45:08,118 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 03:45:08,119 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 03:45:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 03:45:08,193 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 03:45:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 03:45:08,242 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-18 03:45:08,242 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 03:45:08,242 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-18 03:45:08,247 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 03:45:08,443 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 03:45:08,444 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-18 03:45:08,444 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-10-18 03:45:08,445 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 03:45:08,445 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-18 03:45:08,463 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-18 03:45:08,464 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 03:45:08,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 03:45:08,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 03:45:08,466 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 03:45:08,467 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 03:45:08,499 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 03:45:08,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:45:08,500 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-10-18 03:45:08,500 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;@7bb11a85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=RANDOM, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=50, mConComCheckerRandomSeed=213, mConComCheckerConditionCriterion=false [2024-10-18 03:45:08,500 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 03:45:10,430 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 03:45:10,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:45:10,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1980423421, now seen corresponding path program 1 times [2024-10-18 03:45:10,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 03:45:10,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057764635] [2024-10-18 03:45:10,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:45:10,431 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 03:45:10,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 03:45:10,434 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 03:45:10,435 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 03:45:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:45:10,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-18 03:45:10,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 03:45:10,486 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 03:45:10,486 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 03:45:10,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-18 03:45:10,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1057764635] [2024-10-18 03:45:10,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1057764635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 03:45:10,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 03:45:10,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 03:45:10,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266804051] [2024-10-18 03:45:10,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 03:45:10,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 03:45:10,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-18 03:45:10,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 03:45:10,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 03:45:10,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:10,487 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 03:45:10,487 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 03:45:10,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:11,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:11,439 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 03:45:11,632 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 03:45:11,632 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 03:45:11,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:45:11,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1408669934, now seen corresponding path program 1 times [2024-10-18 03:45:11,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 03:45:11,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1819956765] [2024-10-18 03:45:11,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:45:11,633 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 03:45:11,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 03:45:11,637 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 03:45:11,640 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 03:45:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:45:11,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-18 03:45:11,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 03:45:11,976 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-18 03:45:11,976 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 03:45:12,026 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 03:45:12,027 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 03:45:12,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-18 03:45:12,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1819956765] [2024-10-18 03:45:12,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1819956765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 03:45:12,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 03:45:12,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-18 03:45:12,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667970982] [2024-10-18 03:45:12,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 03:45:12,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-18 03:45:12,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-18 03:45:12,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-18 03:45:12,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-18 03:45:12,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:12,028 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 03:45:12,028 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 03:45:12,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:12,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:12,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:12,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-18 03:45:12,445 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 03:45:12,635 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 03:45:12,635 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 03:45:12,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:45:12,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1103172430, now seen corresponding path program 1 times [2024-10-18 03:45:12,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 03:45:12,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [890547074] [2024-10-18 03:45:12,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:45:12,636 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 03:45:12,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 03:45:12,638 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 03:45:12,638 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 03:45:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:45:12,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-18 03:45:12,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 03:45:12,751 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2024-10-18 03:45:12,751 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 03:45:12,759 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 03:45:12,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-18 03:45:12,788 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 03:45:12,800 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 03:45:12,822 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 03:45:12,822 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 03:45:12,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-18 03:45:12,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [890547074] [2024-10-18 03:45:12,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [890547074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 03:45:12,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 03:45:12,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-18 03:45:12,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944470060] [2024-10-18 03:45:12,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 03:45:12,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-18 03:45:12,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-18 03:45:12,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-18 03:45:12,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-18 03:45:12,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:12,824 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 03:45:12,824 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 03:45:12,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:12,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-18 03:45:12,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:13,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:13,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-18 03:45:13,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-18 03:45:13,235 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 (18)] Ended with exit code 0 [2024-10-18 03:45:13,429 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 03:45:13,429 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 03:45:13,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:45:13,430 INFO L85 PathProgramCache]: Analyzing trace with hash 562594897, now seen corresponding path program 1 times [2024-10-18 03:45:13,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 03:45:13,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1281220884] [2024-10-18 03:45:13,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:45:13,430 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 03:45:13,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 03:45:13,432 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 03:45:13,432 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 03:45:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:45:13,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-18 03:45:13,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 03:45:13,547 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-18 03:45:13,547 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 03:45:13,610 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 03:45:13,613 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 03:45:13,631 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 03:45:13,631 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 03:45:13,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-18 03:45:13,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1281220884] [2024-10-18 03:45:13,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1281220884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 03:45:13,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 03:45:13,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-18 03:45:13,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125496023] [2024-10-18 03:45:13,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 03:45:13,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-18 03:45:13,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-18 03:45:13,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-18 03:45:13,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-18 03:45:13,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:13,632 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 03:45:13,633 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 03:45:13,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:13,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-18 03:45:13,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-18 03:45:13,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:13,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:13,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-18 03:45:13,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-18 03:45:13,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 03:45:13,974 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 (19)] Ended with exit code 0 [2024-10-18 03:45:14,170 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 03:45:14,171 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 03:45:14,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:45:14,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1499213391, now seen corresponding path program 1 times [2024-10-18 03:45:14,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 03:45:14,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [919852552] [2024-10-18 03:45:14,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:45:14,172 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 03:45:14,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 03:45:14,173 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 03:45:14,174 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 03:45:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:45:14,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-18 03:45:14,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 03:45:14,302 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-18 03:45:14,303 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 03:45:14,388 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 03:45:14,392 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 03:45:14,425 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 03:45:14,461 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-18 03:45:14,462 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 03:45:14,534 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 03:45:14,537 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 03:45:14,567 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 03:45:14,567 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 03:45:14,618 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 03:45:14,645 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 03:45:14,653 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 03:45:16,679 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (_ BitVec 32))) (or (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))) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| v_DerPreprocessor_5) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1)))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|))))) is different from false [2024-10-18 03:45:16,919 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 03:45:16,966 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 03:45:16,999 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 03:45:17,158 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 03:45:17,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-18 03:45:17,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [919852552] [2024-10-18 03:45:17,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [919852552] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 03:45:17,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-18 03:45:17,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2024-10-18 03:45:17,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63638620] [2024-10-18 03:45:17,159 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-18 03:45:17,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-18 03:45:17,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-18 03:45:17,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-18 03:45:17,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=162, Unknown=14, NotChecked=224, Total=462 [2024-10-18 03:45:17,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:17,160 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 03:45:17,160 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 03:45:17,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:17,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-18 03:45:17,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-18 03:45:17,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 03:45:17,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:18,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:18,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-18 03:45:18,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-18 03:45:18,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 03:45:18,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-18 03:45:18,567 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 03:45:18,763 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 03:45:18,763 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 03:45:18,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:45:18,764 INFO L85 PathProgramCache]: Analyzing trace with hash 2110429268, now seen corresponding path program 1 times [2024-10-18 03:45:18,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 03:45:18,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2014833727] [2024-10-18 03:45:18,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:45:18,764 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 03:45:18,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 03:45:18,765 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 03:45:18,766 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 03:45:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:45:18,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-18 03:45:18,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 03:45:18,929 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-18 03:45:18,930 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 03:45:19,087 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 03:45:19,209 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-10-18 03:45:19,209 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 03:45:19,452 INFO L349 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2024-10-18 03:45:19,452 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 03:45:19,469 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 03:45:19,490 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 03:45:19,518 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 03:45:19,603 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 03:45:19,941 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-10-18 03:45:19,941 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 03:45:20,136 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-18 03:45:20,137 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 03:45:20,484 INFO L349 Elim1Store]: treesize reduction 28, result has 15.2 percent of original size [2024-10-18 03:45:20,484 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 03:45:20,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-18 03:45:20,515 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-18 03:45:20,515 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 03:45:20,529 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 03:45:20,650 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 03:45:20,650 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 03:45:20,737 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 03:45:20,766 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 03:45:21,391 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 03:45:24,002 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 03:45:24,283 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 03:45:24,407 INFO L349 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2024-10-18 03:45:24,407 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 03:45:24,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 03:45:24,434 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 03:45:24,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 03:45:24,479 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 03:45:24,495 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 03:45:24,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 03:45:24,554 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 03:45:24,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 03:45:24,616 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 03:45:29,270 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 2 times theorem prover too weak. 0 trivial. 4 not checked. [2024-10-18 03:45:29,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-18 03:45:29,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2014833727] [2024-10-18 03:45:29,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2014833727] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 03:45:29,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-18 03:45:29,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2024-10-18 03:45:29,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451692886] [2024-10-18 03:45:29,270 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-18 03:45:29,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-18 03:45:29,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-18 03:45:29,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-18 03:45:29,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=402, Unknown=28, NotChecked=230, Total=756 [2024-10-18 03:45:29,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:29,272 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 03:45:29,272 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 03:45:29,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:29,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-18 03:45:29,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-18 03:45:29,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 03:45:29,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-18 03:45:29,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:45:33,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, 1] [2024-10-18 03:45:36,215 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 03:45:38,395 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 03:45:40,509 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 03:45:42,827 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 03:45:45,764 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 03:45:47,829 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 03:45:50,206 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 03:45:52,840 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 03:45:55,555 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 03:45:57,583 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 03:45:59,830 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 03:46:01,191 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 03:46:03,876 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 03:46:05,899 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 03:46:11,435 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 03:46:13,517 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 03:46:15,545 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 03:46:18,336 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 03:46:18,752 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 03:46:22,697 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 03:46:24,779 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 03:46:26,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 03:46:27,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:46:27,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-18 03:46:27,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-18 03:46:27,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 03:46:27,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-18 03:46:27,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-18 03:46:27,270 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 03:46:27,465 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 03:46:27,465 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 03:46:27,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:46:27,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1277000128, now seen corresponding path program 1 times [2024-10-18 03:46:27,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 03:46:27,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [597410673] [2024-10-18 03:46:27,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:46:27,466 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 03:46:27,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 03:46:27,470 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 03:46:27,471 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 03:46:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:46:27,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-18 03:46:27,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 03:46:27,628 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2024-10-18 03:46:27,628 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 03:46:27,639 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 03:46:27,648 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 03:46:27,721 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 03:46:27,726 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 03:46:27,750 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 03:46:27,750 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 03:46:27,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-18 03:46:27,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [597410673] [2024-10-18 03:46:27,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [597410673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 03:46:27,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 03:46:27,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-18 03:46:27,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676555206] [2024-10-18 03:46:27,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 03:46:27,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-18 03:46:27,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-18 03:46:27,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-18 03:46:27,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-18 03:46:27,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:46:27,751 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 03:46:27,751 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 03:46:27,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:46:27,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-18 03:46:27,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-18 03:46:27,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 03:46:27,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-18 03:46:27,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-10-18 03:46:27,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:46:30,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:46:30,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-18 03:46:30,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-18 03:46:30,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 03:46:30,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-18 03:46:30,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-18 03:46:30,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 03:46:30,479 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 (22)] Forceful destruction successful, exit code 0 [2024-10-18 03:46:30,675 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 03:46:30,675 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 03:46:30,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 03:46:30,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1825917863, now seen corresponding path program 1 times [2024-10-18 03:46:30,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 03:46:30,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [381801891] [2024-10-18 03:46:30,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:46:30,799 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 03:46:30,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 03:46:30,801 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 03:46:30,802 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 03:46:30,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 03:46:30,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-18 03:46:30,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 03:46:30,988 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-18 03:46:30,988 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 03:46:31,069 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 03:46:31,111 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-18 03:46:31,111 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 03:46:31,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-18 03:46:31,228 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 03:46:31,232 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 03:46:31,307 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-10-18 03:46:31,307 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 03:46:31,435 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 03:46:31,487 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 03:46:31,487 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 03:46:32,284 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 03:46:32,368 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 03:46:32,377 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 03:46:37,278 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 5 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 03:46:37,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-18 03:46:37,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [381801891] [2024-10-18 03:46:37,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [381801891] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 03:46:37,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-18 03:46:37,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2024-10-18 03:46:37,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589351907] [2024-10-18 03:46:37,279 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-18 03:46:37,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-18 03:46:37,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-18 03:46:37,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-18 03:46:37,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=290, Unknown=18, NotChecked=36, Total=420 [2024-10-18 03:46:37,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:46:37,280 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 03:46:37,280 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 03:46:37,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:46:37,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-18 03:46:37,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-18 03:46:37,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 03:46:37,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-18 03:46:37,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-10-18 03:46:37,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-18 03:46:37,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:46:56,720 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 ((.cse7 (bvadd (_ bv1 32) .cse1))) (let ((.cse6 (select (select |c_#memory_int| (_ bv3 32)) (_ bv0 32))) (.cse0 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| .cse7))) (.cse2 (= (_ bv0 32) .cse7)) (.cse3 (= |c_thr1Thread3of3ForFork0_~v~0#1| .cse1)) (.cse5 (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (_ bv3 32)))))) (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 (= (_ bv3 32) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) .cse5) (not (= (_ bv0 32) .cse6)) (= |c_thr1Thread2of3ForFork0_~v~0#1| .cse6) (or (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) (= (_ bv0 32) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) (= (_ bv3 32) |c_~#value~0.base|) .cse5))))) is different from false [2024-10-18 03:46:59,000 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 03:47:00,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 03:47:00,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 03:47:00,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-18 03:47:00,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-18 03:47:00,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 03:47:00,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-18 03:47:00,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-18 03:47:00,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 03:47:00,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-18 03:47:00,520 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 03:47:00,716 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 03:47:00,716 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 03:47:00,981 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 40 treesize of output 28 [2024-10-18 03:47:01,016 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 30 treesize of output 22 [2024-10-18 03:47:09,588 INFO L85 PathProgramCache]: Analyzing trace with hash 453977815, now seen corresponding path program 1 times [2024-10-18 03:47:09,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 03:47:09,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 03:47:09,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-18 03:47:09,707 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: Unsupported internal sort: RoundingMode 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.ConditionalCommutativityCounterexampleChecker.getInterpolants(ConditionalCommutativityCounterexampleChecker.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isCounterexampleFeasible(PartialOrderCegarLoop.java:420) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Unsupported internal sort: RoundingMode at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.assertTerm(SMTInterpol.java:672) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertTerm(ManagedScript.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAssertCodeBlocks.annotateAndAssertTerm(AnnotateAndAssertCodeBlocks.java:193) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAssertCodeBlocks.annotateAndAssertNonCall(AnnotateAndAssertCodeBlocks.java:109) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:101) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:317) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:215) ... 29 more [2024-10-18 03:47:09,711 INFO L158 Benchmark]: Toolchain (without parser) took 130307.81ms. Allocated memory was 92.3MB in the beginning and 308.3MB in the end (delta: 216.0MB). Free memory was 61.7MB in the beginning and 248.8MB in the end (delta: -187.1MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. [2024-10-18 03:47:09,712 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 92.3MB. Free memory is still 68.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-18 03:47:09,712 INFO L158 Benchmark]: CACSL2BoogieTranslator took 427.59ms. Allocated memory is still 92.3MB. Free memory was 61.7MB in the beginning and 69.8MB in the end (delta: -8.1MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. [2024-10-18 03:47:09,712 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.98ms. Allocated memory is still 92.3MB. Free memory was 69.8MB in the beginning and 67.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-18 03:47:09,712 INFO L158 Benchmark]: Boogie Preprocessor took 42.90ms. Allocated memory is still 92.3MB. Free memory was 67.7MB in the beginning and 66.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-18 03:47:09,712 INFO L158 Benchmark]: RCFGBuilder took 496.76ms. Allocated memory is still 92.3MB. Free memory was 66.1MB in the beginning and 40.2MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-18 03:47:09,712 INFO L158 Benchmark]: TraceAbstraction took 129292.50ms. Allocated memory was 92.3MB in the beginning and 308.3MB in the end (delta: 216.0MB). Free memory was 38.9MB in the beginning and 248.8MB in the end (delta: -210.0MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. [2024-10-18 03:47:09,713 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.12ms. Allocated memory is still 92.3MB. Free memory is still 68.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 427.59ms. Allocated memory is still 92.3MB. Free memory was 61.7MB in the beginning and 69.8MB in the end (delta: -8.1MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.98ms. Allocated memory is still 92.3MB. Free memory was 69.8MB in the beginning and 67.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.90ms. Allocated memory is still 92.3MB. Free memory was 67.7MB in the beginning and 66.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 496.76ms. Allocated memory is still 92.3MB. Free memory was 66.1MB in the beginning and 40.2MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 129292.50ms. Allocated memory was 92.3MB in the beginning and 308.3MB in the end (delta: 216.0MB). Free memory was 38.9MB in the beginning and 248.8MB in the end (delta: -210.0MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 256, independent: 224, independent conditional: 69, independent unconditional: 155, 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: 234, independent: 224, independent conditional: 69, independent unconditional: 155, 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: 234, independent: 224, independent conditional: 69, independent unconditional: 155, 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: 234, independent: 224, independent conditional: 69, independent unconditional: 155, 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: 244, independent: 224, independent conditional: 69, independent unconditional: 155, 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: 244, independent: 224, independent conditional: 0, independent unconditional: 224, 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: 244, independent: 224, independent conditional: 0, independent unconditional: 224, 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: 881, independent: 330, independent conditional: 0, independent unconditional: 330, dependent: 551, dependent conditional: 0, dependent unconditional: 551, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 244, independent: 98, independent conditional: 0, independent unconditional: 98, 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: 69, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 244, independent: 224, independent conditional: 69, independent unconditional: 155, 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: 244, independent: 224, independent conditional: 0, independent unconditional: 224, 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: 244, independent: 224, independent conditional: 0, independent unconditional: 224, 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: 881, independent: 330, independent conditional: 0, independent unconditional: 330, dependent: 551, dependent conditional: 0, dependent unconditional: 551, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 244, independent: 98, independent conditional: 0, independent unconditional: 98, 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: 69 ], 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: 256, independent: 224, independent conditional: 69, independent unconditional: 155, 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: 234, independent: 224, independent conditional: 69, independent unconditional: 155, 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: 234, independent: 224, independent conditional: 69, independent unconditional: 155, 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: 234, independent: 224, independent conditional: 69, independent unconditional: 155, 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: 244, independent: 224, independent conditional: 69, independent unconditional: 155, 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: 244, independent: 224, independent conditional: 0, independent unconditional: 224, 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: 244, independent: 224, independent conditional: 0, independent unconditional: 224, 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: 881, independent: 330, independent conditional: 0, independent unconditional: 330, dependent: 551, dependent conditional: 0, dependent unconditional: 551, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 244, independent: 98, independent conditional: 0, independent unconditional: 98, 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: 69, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 244, independent: 224, independent conditional: 69, independent unconditional: 155, 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: 244, independent: 224, independent conditional: 0, independent unconditional: 224, 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: 244, independent: 224, independent conditional: 0, independent unconditional: 224, 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: 881, independent: 330, independent conditional: 0, independent unconditional: 330, dependent: 551, dependent conditional: 0, dependent unconditional: 551, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 244, independent: 98, independent conditional: 0, independent unconditional: 98, 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: 69 ], Independence queries for same thread: 22 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 171, independent: 154, independent conditional: 33, independent unconditional: 121, 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: 159, independent: 154, independent conditional: 33, independent unconditional: 121, 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: 159, independent: 154, independent conditional: 33, independent unconditional: 121, 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: 159, independent: 154, independent conditional: 33, independent unconditional: 121, 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: 164, independent: 154, independent conditional: 33, independent unconditional: 121, 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: 164, independent: 154, independent conditional: 0, independent unconditional: 154, 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: 164, independent: 154, independent conditional: 0, independent unconditional: 154, 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: 337, independent: 108, independent conditional: 0, independent unconditional: 108, dependent: 229, dependent conditional: 0, dependent unconditional: 229, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 164, independent: 55, independent conditional: 0, independent unconditional: 55, 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: 33, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 164, independent: 154, independent conditional: 33, independent unconditional: 121, 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: 164, independent: 154, independent conditional: 0, independent unconditional: 154, 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: 164, independent: 154, independent conditional: 0, independent unconditional: 154, 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: 337, independent: 108, independent conditional: 0, independent unconditional: 108, dependent: 229, dependent conditional: 0, dependent unconditional: 229, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 164, independent: 55, independent conditional: 0, independent unconditional: 55, 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: 33 ], 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: 171, independent: 154, independent conditional: 33, independent unconditional: 121, 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: 159, independent: 154, independent conditional: 33, independent unconditional: 121, 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: 159, independent: 154, independent conditional: 33, independent unconditional: 121, 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: 159, independent: 154, independent conditional: 33, independent unconditional: 121, 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: 164, independent: 154, independent conditional: 33, independent unconditional: 121, 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: 164, independent: 154, independent conditional: 0, independent unconditional: 154, 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: 164, independent: 154, independent conditional: 0, independent unconditional: 154, 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: 337, independent: 108, independent conditional: 0, independent unconditional: 108, dependent: 229, dependent conditional: 0, dependent unconditional: 229, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 164, independent: 55, independent conditional: 0, independent unconditional: 55, 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: 33, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 164, independent: 154, independent conditional: 33, independent unconditional: 121, 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: 164, independent: 154, independent conditional: 0, independent unconditional: 154, 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: 164, independent: 154, independent conditional: 0, independent unconditional: 154, 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: 337, independent: 108, independent conditional: 0, independent unconditional: 108, dependent: 229, dependent conditional: 0, dependent unconditional: 229, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 164, independent: 55, independent conditional: 0, independent unconditional: 55, 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: 33 ], Independence queries for same thread: 12 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 505, independent: 452, independent conditional: 92, independent unconditional: 360, 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: 471, independent: 452, independent conditional: 92, independent unconditional: 360, 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: 471, independent: 452, independent conditional: 92, independent unconditional: 360, 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: 471, independent: 452, independent conditional: 92, independent unconditional: 360, 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: 490, independent: 452, independent conditional: 92, independent unconditional: 360, 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: 490, independent: 452, independent conditional: 0, independent unconditional: 452, 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: 490, independent: 452, independent conditional: 0, independent unconditional: 452, 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: 1471, independent: 473, independent conditional: 0, independent unconditional: 473, dependent: 998, dependent conditional: 0, dependent unconditional: 998, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 490, independent: 146, independent conditional: 0, independent unconditional: 146, 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: 92, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 490, independent: 452, independent conditional: 92, independent unconditional: 360, 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: 490, independent: 452, independent conditional: 0, independent unconditional: 452, 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: 490, independent: 452, independent conditional: 0, independent unconditional: 452, 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: 1471, independent: 473, independent conditional: 0, independent unconditional: 473, dependent: 998, dependent conditional: 0, dependent unconditional: 998, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 490, independent: 146, independent conditional: 0, independent unconditional: 146, 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: 92 ], Independence queries for same thread: 34, Persistent sets #1 benchmarks: Persistent set computation time: 1.5s, 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: 505, independent: 452, independent conditional: 92, independent unconditional: 360, 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: 471, independent: 452, independent conditional: 92, independent unconditional: 360, 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: 471, independent: 452, independent conditional: 92, independent unconditional: 360, 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: 471, independent: 452, independent conditional: 92, independent unconditional: 360, 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: 490, independent: 452, independent conditional: 92, independent unconditional: 360, 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: 490, independent: 452, independent conditional: 0, independent unconditional: 452, 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: 490, independent: 452, independent conditional: 0, independent unconditional: 452, 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: 1471, independent: 473, independent conditional: 0, independent unconditional: 473, dependent: 998, dependent conditional: 0, dependent unconditional: 998, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 490, independent: 146, independent conditional: 0, independent unconditional: 146, 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: 92, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 490, independent: 452, independent conditional: 92, independent unconditional: 360, 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: 490, independent: 452, independent conditional: 0, independent unconditional: 452, 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: 490, independent: 452, independent conditional: 0, independent unconditional: 452, 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: 1471, independent: 473, independent conditional: 0, independent unconditional: 473, dependent: 998, dependent conditional: 0, dependent unconditional: 998, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 490, independent: 146, independent conditional: 0, independent unconditional: 146, 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: 92 ], Independence queries for same thread: 34 - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Unsupported internal sort: RoundingMode de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Unsupported internal sort: RoundingMode: 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 03:47:09,747 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 03:47:09,943 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 03:47:10,143 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 03:47:10,344 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 03:47:10,584 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: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Unsupported internal sort: RoundingMode