./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking LOOP --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -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-deagle/arithmetic_prog_bad.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 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking LOOP --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -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-19 10:27:38,813 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-19 10:27:38,864 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-19 10:27:38,869 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-19 10:27:38,870 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-19 10:27:38,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-19 10:27:38,891 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-19 10:27:38,892 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-19 10:27:38,892 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-19 10:27:38,892 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-19 10:27:38,893 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-19 10:27:38,893 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-19 10:27:38,893 INFO L153 SettingsManager]: * Use SBE=true [2024-10-19 10:27:38,894 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-19 10:27:38,894 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-19 10:27:38,894 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-19 10:27:38,895 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-19 10:27:38,895 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-19 10:27:38,895 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-19 10:27:38,895 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-19 10:27:38,896 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-19 10:27:38,896 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-19 10:27:38,896 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-19 10:27:38,896 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-19 10:27:38,897 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-19 10:27:38,897 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-19 10:27:38,897 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-19 10:27:38,897 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-19 10:27:38,898 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-19 10:27:38,898 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-19 10:27:38,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 10:27:38,898 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-19 10:27:38,900 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-19 10:27:38,900 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-19 10:27:38,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-19 10:27:38,900 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-19 10:27:38,900 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-19 10:27:38,900 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-19 10:27:38,901 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-19 10:27:38,901 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-19 10:27:38,901 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-19 10:27:38,901 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 -> 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38 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 -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> LOOP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 5 [2024-10-19 10:27:39,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-19 10:27:39,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-19 10:27:39,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-19 10:27:39,107 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-19 10:27:39,108 INFO L274 PluginConnector]: CDTParser initialized [2024-10-19 10:27:39,108 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2024-10-19 10:27:40,294 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-19 10:27:40,468 INFO L384 CDTParser]: Found 1 translation units. [2024-10-19 10:27:40,469 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2024-10-19 10:27:40,482 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/88094f33c/825d71d321864ce1ac4045e215117db4/FLAGf66169f21 [2024-10-19 10:27:40,492 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/88094f33c/825d71d321864ce1ac4045e215117db4 [2024-10-19 10:27:40,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-19 10:27:40,495 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-19 10:27:40,496 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-19 10:27:40,496 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-19 10:27:40,500 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-19 10:27:40,500 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 10:27:40" (1/1) ... [2024-10-19 10:27:40,501 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40940383 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:27:40, skipping insertion in model container [2024-10-19 10:27:40,501 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 10:27:40" (1/1) ... [2024-10-19 10:27:40,535 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-19 10:27:40,892 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-deagle/arithmetic_prog_bad.i[39758,39771] [2024-10-19 10:27:40,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 10:27:40,908 INFO L200 MainTranslator]: Completed pre-run [2024-10-19 10:27:40,950 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-deagle/arithmetic_prog_bad.i[39758,39771] [2024-10-19 10:27:40,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 10:27:40,995 INFO L204 MainTranslator]: Completed translation [2024-10-19 10:27:40,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:27:40 WrapperNode [2024-10-19 10:27:40,996 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-19 10:27:40,997 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-19 10:27:40,997 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-19 10:27:40,997 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-19 10:27:41,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:27:40" (1/1) ... [2024-10-19 10:27:41,024 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:27:40" (1/1) ... [2024-10-19 10:27:41,045 INFO L138 Inliner]: procedures = 243, calls = 26, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2024-10-19 10:27:41,046 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-19 10:27:41,046 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-19 10:27:41,046 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-19 10:27:41,047 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-19 10:27:41,054 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:27:40" (1/1) ... [2024-10-19 10:27:41,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:27:40" (1/1) ... [2024-10-19 10:27:41,058 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:27:40" (1/1) ... [2024-10-19 10:27:41,062 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:27:40" (1/1) ... [2024-10-19 10:27:41,066 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:27:40" (1/1) ... [2024-10-19 10:27:41,072 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:27:40" (1/1) ... [2024-10-19 10:27:41,078 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:27:40" (1/1) ... [2024-10-19 10:27:41,079 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:27:40" (1/1) ... [2024-10-19 10:27:41,084 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-19 10:27:41,085 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-19 10:27:41,085 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-19 10:27:41,085 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-19 10:27:41,086 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:27:40" (1/1) ... [2024-10-19 10:27:41,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 10:27:41,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 10:27:41,118 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-19 10:27:41,120 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-19 10:27:41,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-10-19 10:27:41,152 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-19 10:27:41,152 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-19 10:27:41,152 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-19 10:27:41,152 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-19 10:27:41,153 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-19 10:27:41,153 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-19 10:27:41,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-19 10:27:41,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-19 10:27:41,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-19 10:27:41,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-19 10:27:41,154 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-19 10:27:41,260 INFO L238 CfgBuilder]: Building ICFG [2024-10-19 10:27:41,261 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-19 10:27:41,401 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-19 10:27:41,402 INFO L287 CfgBuilder]: Performing block encoding [2024-10-19 10:27:41,501 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-19 10:27:41,502 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-19 10:27:41,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 10:27:41 BoogieIcfgContainer [2024-10-19 10:27:41,502 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-19 10:27:41,504 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-19 10:27:41,504 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-19 10:27:41,506 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-19 10:27:41,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.10 10:27:40" (1/3) ... [2024-10-19 10:27:41,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16bac13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 10:27:41, skipping insertion in model container [2024-10-19 10:27:41,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:27:40" (2/3) ... [2024-10-19 10:27:41,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16bac13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 10:27:41, skipping insertion in model container [2024-10-19 10:27:41,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 10:27:41" (3/3) ... [2024-10-19 10:27:41,508 INFO L112 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2024-10-19 10:27:41,520 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-19 10:27:41,520 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-19 10:27:41,520 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-19 10:27:41,554 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-19 10:27:41,584 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 10:27:41,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 10:27:41,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 10:27:41,586 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-19 10:27:41,588 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-19 10:27:41,667 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 10:27:41,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 10:27:41,683 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-19 10:27:41,689 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;@1a36b547, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 10:27:41,689 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-19 10:27:42,148 INFO L85 PathProgramCache]: Analyzing trace with hash -674368938, now seen corresponding path program 1 times [2024-10-19 10:27:42,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:27:42,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:27:42,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:27:42,381 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-19 10:27:42,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:27:42,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:27:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:27:42,448 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-19 10:27:42,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 10:27:42,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-19 10:27:42,927 INFO L85 PathProgramCache]: Analyzing trace with hash -25444401, now seen corresponding path program 1 times [2024-10-19 10:27:42,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:27:42,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:27:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:27:43,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-19 10:27:43,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:27:43,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:27:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:27:43,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-19 10:27:43,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 10:27:43,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-19 10:27:43,407 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 10:27:43,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 10:27:43,409 INFO L85 PathProgramCache]: Analyzing trace with hash 2026554384, now seen corresponding path program 1 times [2024-10-19 10:27:43,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 10:27:43,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992040860] [2024-10-19 10:27:43,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:27:43,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:27:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:27:43,503 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-19 10:27:43,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 10:27:43,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992040860] [2024-10-19 10:27:43,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992040860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 10:27:43,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 10:27:43,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-19 10:27:43,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442068213] [2024-10-19 10:27:43,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 10:27:43,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-19 10:27:43,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 10:27:43,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 10:27:43,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-19 10:27:43,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 10:27:43,512 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 10:27:43,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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-19 10:27:43,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 10:27:43,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 10:27:43,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-19 10:27:43,645 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 10:27:43,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 10:27:43,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1993113704, now seen corresponding path program 1 times [2024-10-19 10:27:43,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 10:27:43,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320771393] [2024-10-19 10:27:43,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:27:43,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:27:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:27:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-19 10:27:43,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 10:27:43,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320771393] [2024-10-19 10:27:43,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320771393] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 10:27:43,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863121328] [2024-10-19 10:27:43,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:27:43,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 10:27:43,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 10:27:43,747 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-19 10:27:43,748 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-19 10:27:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:27:43,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-19 10:27:43,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 10:27:43,882 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-19 10:27:43,882 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-19 10:27:43,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863121328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 10:27:43,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-19 10:27:43,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-10-19 10:27:43,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906910979] [2024-10-19 10:27:43,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 10:27:43,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-19 10:27:43,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 10:27:43,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 10:27:43,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-19 10:27:43,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 10:27:43,885 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 10:27:43,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 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-19 10:27:43,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-19 10:27:43,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 10:27:43,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 10:27:43,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 10:27:43,961 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-19 10:27:44,148 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,SelfDestructingSolverStorable5 [2024-10-19 10:27:44,151 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 10:27:44,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 10:27:44,152 INFO L85 PathProgramCache]: Analyzing trace with hash 764258452, now seen corresponding path program 2 times [2024-10-19 10:27:44,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 10:27:44,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975468249] [2024-10-19 10:27:44,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:27:44,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:27:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:27:44,302 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 51 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-19 10:27:44,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 10:27:44,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975468249] [2024-10-19 10:27:44,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975468249] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 10:27:44,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874713207] [2024-10-19 10:27:44,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-19 10:27:44,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 10:27:44,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 10:27:44,306 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-19 10:27:44,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-19 10:27:44,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-19 10:27:44,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-19 10:27:44,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-19 10:27:44,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 10:27:44,471 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-19 10:27:44,472 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-19 10:27:44,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874713207] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 10:27:44,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-19 10:27:44,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-10-19 10:27:44,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406127154] [2024-10-19 10:27:44,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 10:27:44,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-19 10:27:44,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 10:27:44,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 10:27:44,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-19 10:27:44,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 10:27:44,476 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 10:27:44,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 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-19 10:27:44,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-19 10:27:44,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-19 10:27:44,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 10:27:44,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 10:27:44,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 10:27:44,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 10:27:44,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-19 10:27:44,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 10:27:44,738 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 10:27:44,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 10:27:44,739 INFO L85 PathProgramCache]: Analyzing trace with hash -155741166, now seen corresponding path program 2 times [2024-10-19 10:27:44,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 10:27:44,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257803725] [2024-10-19 10:27:44,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:27:44,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:27:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 10:27:44,768 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 10:27:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 10:27:44,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-19 10:27:44,807 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-19 10:27:44,808 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-10-19 10:27:44,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-10-19 10:27:44,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-10-19 10:27:44,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-19 10:27:44,818 INFO L414 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2024-10-19 10:27:44,868 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-19 10:27:44,868 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-19 10:27:44,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.10 10:27:44 BasicIcfg [2024-10-19 10:27:44,875 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-19 10:27:44,875 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-19 10:27:44,875 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-19 10:27:44,877 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-19 10:27:44,877 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 10:27:41" (3/4) ... [2024-10-19 10:27:44,878 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-19 10:27:44,943 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml [2024-10-19 10:27:44,944 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-19 10:27:44,944 INFO L158 Benchmark]: Toolchain (without parser) took 4448.89ms. Allocated memory was 140.5MB in the beginning and 232.8MB in the end (delta: 92.3MB). Free memory was 67.6MB in the beginning and 115.6MB in the end (delta: -48.0MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. [2024-10-19 10:27:44,946 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 140.5MB. Free memory is still 90.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-19 10:27:44,946 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.26ms. Allocated memory was 140.5MB in the beginning and 186.6MB in the end (delta: 46.1MB). Free memory was 67.3MB in the beginning and 135.6MB in the end (delta: -68.3MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2024-10-19 10:27:44,946 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.23ms. Allocated memory is still 186.6MB. Free memory was 135.6MB in the beginning and 133.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-19 10:27:44,947 INFO L158 Benchmark]: Boogie Preprocessor took 38.36ms. Allocated memory is still 186.6MB. Free memory was 133.6MB in the beginning and 131.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-19 10:27:44,947 INFO L158 Benchmark]: RCFGBuilder took 416.90ms. Allocated memory is still 186.6MB. Free memory was 131.5MB in the beginning and 94.8MB in the end (delta: 36.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-19 10:27:44,947 INFO L158 Benchmark]: TraceAbstraction took 3370.74ms. Allocated memory was 186.6MB in the beginning and 232.8MB in the end (delta: 46.1MB). Free memory was 93.7MB in the beginning and 128.2MB in the end (delta: -34.4MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2024-10-19 10:27:44,947 INFO L158 Benchmark]: Witness Printer took 68.54ms. Allocated memory is still 232.8MB. Free memory was 127.1MB in the beginning and 115.6MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-19 10:27:44,948 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.44ms. Allocated memory is still 140.5MB. Free memory is still 90.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 500.26ms. Allocated memory was 140.5MB in the beginning and 186.6MB in the end (delta: 46.1MB). Free memory was 67.3MB in the beginning and 135.6MB in the end (delta: -68.3MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.23ms. Allocated memory is still 186.6MB. Free memory was 135.6MB in the beginning and 133.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.36ms. Allocated memory is still 186.6MB. Free memory was 133.6MB in the beginning and 131.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 416.90ms. Allocated memory is still 186.6MB. Free memory was 131.5MB in the beginning and 94.8MB in the end (delta: 36.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3370.74ms. Allocated memory was 186.6MB in the beginning and 232.8MB in the end (delta: 46.1MB). Free memory was 93.7MB in the beginning and 128.2MB in the end (delta: -34.4MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * Witness Printer took 68.54ms. Allocated memory is still 232.8MB. Free memory was 127.1MB in the beginning and 115.6MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. 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: 1689, independent: 1407, independent conditional: 852, independent unconditional: 555, dependent: 282, dependent conditional: 256, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1468, independent: 1407, independent conditional: 852, independent unconditional: 555, dependent: 61, dependent conditional: 35, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1468, independent: 1407, independent conditional: 852, independent unconditional: 555, dependent: 61, dependent conditional: 35, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1468, independent: 1407, independent conditional: 852, independent unconditional: 555, dependent: 61, dependent conditional: 35, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1605, independent: 1407, independent conditional: 852, independent unconditional: 555, dependent: 198, dependent conditional: 146, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1605, independent: 1407, independent conditional: 83, independent unconditional: 1324, dependent: 198, dependent conditional: 35, dependent unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1605, independent: 1407, independent conditional: 83, independent unconditional: 1324, dependent: 198, dependent conditional: 35, dependent unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 406, independent: 371, independent conditional: 4, independent unconditional: 367, dependent: 35, dependent conditional: 12, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 406, independent: 358, independent conditional: 0, independent unconditional: 358, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 48, independent: 13, independent conditional: 1, independent unconditional: 12, dependent: 35, dependent conditional: 12, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 48, independent: 13, independent conditional: 1, independent unconditional: 12, dependent: 35, dependent conditional: 12, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 762, independent: 124, independent conditional: 6, independent unconditional: 118, dependent: 638, dependent conditional: 153, dependent unconditional: 485, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1605, independent: 1036, independent conditional: 79, independent unconditional: 957, dependent: 163, dependent conditional: 23, dependent unconditional: 140, unknown: 406, unknown conditional: 16, unknown unconditional: 390] , Statistics on independence cache: Total cache size (in pairs): 406, Positive cache size: 371, Positive conditional cache size: 4, Positive unconditional cache size: 367, Negative cache size: 35, Negative conditional cache size: 12, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 880, Maximal queried relation: 5, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1605, independent: 1407, independent conditional: 852, independent unconditional: 555, dependent: 198, dependent conditional: 146, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1605, independent: 1407, independent conditional: 83, independent unconditional: 1324, dependent: 198, dependent conditional: 35, dependent unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1605, independent: 1407, independent conditional: 83, independent unconditional: 1324, dependent: 198, dependent conditional: 35, dependent unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 406, independent: 371, independent conditional: 4, independent unconditional: 367, dependent: 35, dependent conditional: 12, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 406, independent: 358, independent conditional: 0, independent unconditional: 358, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 48, independent: 13, independent conditional: 1, independent unconditional: 12, dependent: 35, dependent conditional: 12, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 48, independent: 13, independent conditional: 1, independent unconditional: 12, dependent: 35, dependent conditional: 12, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 762, independent: 124, independent conditional: 6, independent unconditional: 118, dependent: 638, dependent conditional: 153, dependent unconditional: 485, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1605, independent: 1036, independent conditional: 79, independent unconditional: 957, dependent: 163, dependent conditional: 23, dependent unconditional: 140, unknown: 406, unknown conditional: 16, unknown unconditional: 390] , Statistics on independence cache: Total cache size (in pairs): 406, Positive cache size: 371, Positive conditional cache size: 4, Positive unconditional cache size: 367, Negative cache size: 35, Negative conditional cache size: 12, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 880 ], Independence queries for same thread: 221, Persistent sets #1 benchmarks: Persistent set computation time: 0.6s, Number of persistent set computation: 98, Number of trivial persistent sets: 78, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 488, independent: 468, independent conditional: 0, independent unconditional: 468, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1689, independent: 1407, independent conditional: 852, independent unconditional: 555, dependent: 282, dependent conditional: 256, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1468, independent: 1407, independent conditional: 852, independent unconditional: 555, dependent: 61, dependent conditional: 35, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1468, independent: 1407, independent conditional: 852, independent unconditional: 555, dependent: 61, dependent conditional: 35, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1468, independent: 1407, independent conditional: 852, independent unconditional: 555, dependent: 61, dependent conditional: 35, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1605, independent: 1407, independent conditional: 852, independent unconditional: 555, dependent: 198, dependent conditional: 146, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1605, independent: 1407, independent conditional: 83, independent unconditional: 1324, dependent: 198, dependent conditional: 35, dependent unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1605, independent: 1407, independent conditional: 83, independent unconditional: 1324, dependent: 198, dependent conditional: 35, dependent unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 406, independent: 371, independent conditional: 4, independent unconditional: 367, dependent: 35, dependent conditional: 12, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 406, independent: 358, independent conditional: 0, independent unconditional: 358, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 48, independent: 13, independent conditional: 1, independent unconditional: 12, dependent: 35, dependent conditional: 12, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 48, independent: 13, independent conditional: 1, independent unconditional: 12, dependent: 35, dependent conditional: 12, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 762, independent: 124, independent conditional: 6, independent unconditional: 118, dependent: 638, dependent conditional: 153, dependent unconditional: 485, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1605, independent: 1036, independent conditional: 79, independent unconditional: 957, dependent: 163, dependent conditional: 23, dependent unconditional: 140, unknown: 406, unknown conditional: 16, unknown unconditional: 390] , Statistics on independence cache: Total cache size (in pairs): 406, Positive cache size: 371, Positive conditional cache size: 4, Positive unconditional cache size: 367, Negative cache size: 35, Negative conditional cache size: 12, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 880, Maximal queried relation: 5, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1605, independent: 1407, independent conditional: 852, independent unconditional: 555, dependent: 198, dependent conditional: 146, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1605, independent: 1407, independent conditional: 83, independent unconditional: 1324, dependent: 198, dependent conditional: 35, dependent unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1605, independent: 1407, independent conditional: 83, independent unconditional: 1324, dependent: 198, dependent conditional: 35, dependent unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 406, independent: 371, independent conditional: 4, independent unconditional: 367, dependent: 35, dependent conditional: 12, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 406, independent: 358, independent conditional: 0, independent unconditional: 358, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 48, independent: 13, independent conditional: 1, independent unconditional: 12, dependent: 35, dependent conditional: 12, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 48, independent: 13, independent conditional: 1, independent unconditional: 12, dependent: 35, dependent conditional: 12, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 762, independent: 124, independent conditional: 6, independent unconditional: 118, dependent: 638, dependent conditional: 153, dependent unconditional: 485, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1605, independent: 1036, independent conditional: 79, independent unconditional: 957, dependent: 163, dependent conditional: 23, dependent unconditional: 140, unknown: 406, unknown conditional: 16, unknown unconditional: 390] , Statistics on independence cache: Total cache size (in pairs): 406, Positive cache size: 371, Positive conditional cache size: 4, Positive unconditional cache size: 367, Negative cache size: 35, Negative conditional cache size: 12, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 880 ], Independence queries for same thread: 221 - CounterExampleResult [Line: 919]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L870] 0 int num; [L871] 0 unsigned long total; [L872] 0 int flag; [L873] 0 pthread_mutex_t m; [L874] 0 pthread_cond_t empty, full; [L907] 0 pthread_t t1, t2; [L908] 0 num = 0 [L909] 0 total = 0 [L913] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [\old(arg)={0:0}, flag=0, m={3:0}, num=0, t1=2147483646, total=0] [L876] 1 int i; [L877] 1 i = 0 VAL [\old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, total=0] [L914] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, t1=2147483646, t2=2147483647, total=0] [L890] 2 int j; [L891] 2 j = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=0, total=0] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=1, total=0] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=0, total=0] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=0, total=0] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=1, total=0] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=1, total=0] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=1, total=0] [L880] COND TRUE 1 num > 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=0, total=1] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=0, total=1] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=1, total=1] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, total=1] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, total=1] [L878] COND FALSE 1 !(i < 3) [L887] 1 return ((void *)0); [L915] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, t1=2147483646, t2=2147483647, total=1] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=0, total=3] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=3, m={3:0}, num=0, total=3] [L892] COND FALSE 2 !(j < 3) [L902] 2 total = total + j [L903] 2 flag = 1 [L904] 2 return ((void *)0); [L916] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=2147483646, t2=2147483647, total=6] [L917] COND TRUE 0 \read(flag) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=2147483646, t2=2147483647, total=6] [L918] COND FALSE 0 !(total != ((3 * (3 + 1)) / 2)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=2147483646, t2=2147483647, total=6] [L919] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=2147483646, t2=2147483647, total=6] - UnprovableResult [Line: 913]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 914]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 55 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 2.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 327 NumberOfCodeBlocks, 327 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 269 ConstructedInterpolants, 0 QuantifiedInterpolants, 523 SizeOfPredicates, 0 NumberOfNonLiveVariables, 658 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 225/246 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: ConditionalCommutativityOverallTime: 0.0s, ConditionalCommutativityCheckTime: 0.8s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 2, ConditionalCommutativityCommutingCounterexamples: 0, ConditionalCommutativityConditionCalculations: 8, ConditionalCommutativityTraceChecks: 2, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2024-10-19 10:27:44,971 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-19 10:27:45,172 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE