./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! data-race) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'cdf629ba70521b99830442583c87012a34d164ca28f01f7e59d76ae2f1e525ff'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cdf629ba70521b99830442583c87012a34d164ca28f01f7e59d76ae2f1e525ff --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 15:33:16,485 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 15:33:16,580 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-07 15:33:16,586 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 15:33:16,586 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 15:33:16,607 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 15:33:16,608 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 15:33:16,608 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 15:33:16,608 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 15:33:16,608 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 15:33:16,609 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 15:33:16,609 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 15:33:16,609 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 15:33:16,610 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 15:33:16,610 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 15:33:16,610 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 15:33:16,610 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 15:33:16,610 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 15:33:16,610 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 15:33:16,610 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 15:33:16,610 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 15:33:16,611 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 15:33:16,611 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-07 15:33:16,612 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 15:33:16,612 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 15:33:16,612 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 15:33:16,612 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 15:33:16,612 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 15:33:16,612 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 15:33:16,612 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 15:33:16,612 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 15:33:16,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:33:16,612 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 15:33:16,612 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 15:33:16,612 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 15:33:16,612 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 15:33:16,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 15:33:16,612 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 15:33:16,612 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 15:33:16,612 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 15:33:16,612 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 15:33:16,612 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-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 ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer 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 -> cdf629ba70521b99830442583c87012a34d164ca28f01f7e59d76ae2f1e525ff [2024-11-07 15:33:16,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 15:33:16,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 15:33:16,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 15:33:16,891 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 15:33:16,891 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 15:33:16,896 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i [2024-11-07 15:33:18,119 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 15:33:18,503 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 15:33:18,504 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i [2024-11-07 15:33:18,515 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43c1947b7/7551c795da48494791ab1a650894180b/FLAG46c2cba58 [2024-11-07 15:33:18,528 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43c1947b7/7551c795da48494791ab1a650894180b [2024-11-07 15:33:18,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 15:33:18,532 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 15:33:18,534 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 15:33:18,534 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 15:33:18,537 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 15:33:18,538 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:33:18" (1/1) ... [2024-11-07 15:33:18,539 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@180ee2b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:33:18, skipping insertion in model container [2024-11-07 15:33:18,539 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:33:18" (1/1) ... [2024-11-07 15:33:18,561 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 15:33:18,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:33:18,780 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 15:33:18,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:33:18,843 INFO L204 MainTranslator]: Completed translation [2024-11-07 15:33:18,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:33:18 WrapperNode [2024-11-07 15:33:18,845 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 15:33:18,845 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 15:33:18,846 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 15:33:18,846 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 15:33:18,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:33:18" (1/1) ... [2024-11-07 15:33:18,859 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:33:18" (1/1) ... [2024-11-07 15:33:18,870 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 75 [2024-11-07 15:33:18,870 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 15:33:18,871 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 15:33:18,871 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 15:33:18,871 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 15:33:18,875 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:33:18" (1/1) ... [2024-11-07 15:33:18,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:33:18" (1/1) ... [2024-11-07 15:33:18,876 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:33:18" (1/1) ... [2024-11-07 15:33:18,877 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:33:18" (1/1) ... [2024-11-07 15:33:18,879 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:33:18" (1/1) ... [2024-11-07 15:33:18,881 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:33:18" (1/1) ... [2024-11-07 15:33:18,882 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:33:18" (1/1) ... [2024-11-07 15:33:18,882 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:33:18" (1/1) ... [2024-11-07 15:33:18,883 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 15:33:18,884 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 15:33:18,884 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 15:33:18,884 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 15:33:18,885 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:33:18" (1/1) ... [2024-11-07 15:33:18,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:33:18,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:33:18,907 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 15:33:18,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 15:33:18,927 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-11-07 15:33:18,927 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-11-07 15:33:18,927 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-07 15:33:18,927 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-07 15:33:18,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 15:33:18,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 15:33:18,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 15:33:18,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 15:33:18,928 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-07 15:33:19,009 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 15:33:19,010 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 15:33:19,102 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 15:33:19,102 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 15:33:19,109 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 15:33:19,109 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 15:33:19,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:33:19 BoogieIcfgContainer [2024-11-07 15:33:19,110 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 15:33:19,111 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 15:33:19,111 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 15:33:19,115 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 15:33:19,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:33:18" (1/3) ... [2024-11-07 15:33:19,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5084329e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:33:19, skipping insertion in model container [2024-11-07 15:33:19,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:33:18" (2/3) ... [2024-11-07 15:33:19,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5084329e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:33:19, skipping insertion in model container [2024-11-07 15:33:19,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:33:19" (3/3) ... [2024-11-07 15:33:19,116 INFO L112 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-1.i [2024-11-07 15:33:19,126 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 15:33:19,126 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2024-11-07 15:33:19,126 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 15:33:19,162 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 15:33:19,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 111 transitions, 230 flow [2024-11-07 15:33:19,250 INFO L124 PetriNetUnfolderBase]: 6/124 cut-off events. [2024-11-07 15:33:19,252 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:33:19,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 124 events. 6/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 170 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 92. Up to 4 conditions per place. [2024-11-07 15:33:19,259 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 111 transitions, 230 flow [2024-11-07 15:33:19,263 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 110 transitions, 227 flow [2024-11-07 15:33:19,268 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:33:19,278 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=PETRI_NET, 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;@35011967, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:33:19,281 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-07 15:33:19,289 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 15:33:19,289 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2024-11-07 15:33:19,289 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:33:19,289 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:33:19,290 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:33:19,290 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:33:19,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:33:19,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1524266874, now seen corresponding path program 1 times [2024-11-07 15:33:19,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:33:19,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242344919] [2024-11-07 15:33:19,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:33:19,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:33:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:33:19,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:33:19,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:33:19,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242344919] [2024-11-07 15:33:19,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242344919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:33:19,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:33:19,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:33:19,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104802884] [2024-11-07 15:33:19,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:33:19,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:33:19,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:33:19,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:33:19,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:33:19,484 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 111 [2024-11-07 15:33:19,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 110 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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-11-07 15:33:19,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:33:19,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 111 [2024-11-07 15:33:19,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:33:19,559 INFO L124 PetriNetUnfolderBase]: 12/229 cut-off events. [2024-11-07 15:33:19,559 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-07 15:33:19,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 229 events. 12/229 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 770 event pairs, 11 based on Foata normal form. 18/205 useless extension candidates. Maximal degree in co-relation 209. Up to 31 conditions per place. [2024-11-07 15:33:19,561 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 9 selfloop transitions, 2 changer transitions 1/103 dead transitions. [2024-11-07 15:33:19,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 103 transitions, 235 flow [2024-11-07 15:33:19,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:33:19,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:33:19,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2024-11-07 15:33:19,583 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8948948948948949 [2024-11-07 15:33:19,584 INFO L175 Difference]: Start difference. First operand has 111 places, 110 transitions, 227 flow. Second operand 3 states and 298 transitions. [2024-11-07 15:33:19,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 103 transitions, 235 flow [2024-11-07 15:33:19,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 103 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:33:19,597 INFO L231 Difference]: Finished difference. Result has 109 places, 102 transitions, 214 flow [2024-11-07 15:33:19,603 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=109, PETRI_TRANSITIONS=102} [2024-11-07 15:33:19,605 INFO L277 CegarLoopForPetriNet]: 111 programPoint places, -2 predicate places. [2024-11-07 15:33:19,605 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 102 transitions, 214 flow [2024-11-07 15:33:19,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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-11-07 15:33:19,609 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:33:19,609 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:33:19,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 15:33:19,609 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:33:19,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:33:19,610 INFO L85 PathProgramCache]: Analyzing trace with hash 850971737, now seen corresponding path program 1 times [2024-11-07 15:33:19,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:33:19,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609435781] [2024-11-07 15:33:19,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:33:19,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:33:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:33:19,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:33:19,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:33:19,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609435781] [2024-11-07 15:33:19,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609435781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:33:19,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:33:19,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:33:19,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362154875] [2024-11-07 15:33:19,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:33:19,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:33:19,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:33:19,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:33:19,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:33:19,728 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 111 [2024-11-07 15:33:19,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 102 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 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-11-07 15:33:19,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:33:19,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 111 [2024-11-07 15:33:19,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:33:19,748 INFO L124 PetriNetUnfolderBase]: 6/165 cut-off events. [2024-11-07 15:33:19,748 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-07 15:33:19,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 165 events. 6/165 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 433 event pairs, 5 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 174. Up to 23 conditions per place. [2024-11-07 15:33:19,749 INFO L140 encePairwiseOnDemand]: 108/111 looper letters, 10 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2024-11-07 15:33:19,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 101 transitions, 236 flow [2024-11-07 15:33:19,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:33:19,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:33:19,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2024-11-07 15:33:19,751 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8768768768768769 [2024-11-07 15:33:19,751 INFO L175 Difference]: Start difference. First operand has 109 places, 102 transitions, 214 flow. Second operand 3 states and 292 transitions. [2024-11-07 15:33:19,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 101 transitions, 236 flow [2024-11-07 15:33:19,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 101 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:33:19,753 INFO L231 Difference]: Finished difference. Result has 107 places, 101 transitions, 212 flow [2024-11-07 15:33:19,753 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=107, PETRI_TRANSITIONS=101} [2024-11-07 15:33:19,754 INFO L277 CegarLoopForPetriNet]: 111 programPoint places, -4 predicate places. [2024-11-07 15:33:19,754 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 101 transitions, 212 flow [2024-11-07 15:33:19,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 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-11-07 15:33:19,756 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:33:19,756 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:33:19,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 15:33:19,756 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:33:19,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:33:19,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1456105701, now seen corresponding path program 1 times [2024-11-07 15:33:19,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:33:19,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560898131] [2024-11-07 15:33:19,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:33:19,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:33:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:33:19,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:33:19,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:33:19,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560898131] [2024-11-07 15:33:19,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560898131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:33:19,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:33:19,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:33:19,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702543797] [2024-11-07 15:33:19,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:33:19,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:33:19,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:33:19,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:33:19,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:33:19,834 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 111 [2024-11-07 15:33:19,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 101 transitions, 212 flow. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 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-11-07 15:33:19,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:33:19,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 111 [2024-11-07 15:33:19,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:33:19,898 INFO L124 PetriNetUnfolderBase]: 11/217 cut-off events. [2024-11-07 15:33:19,899 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-07 15:33:19,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 217 events. 11/217 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 780 event pairs, 10 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 230. Up to 32 conditions per place. [2024-11-07 15:33:19,902 INFO L140 encePairwiseOnDemand]: 106/111 looper letters, 10 selfloop transitions, 1 changer transitions 0/97 dead transitions. [2024-11-07 15:33:19,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 97 transitions, 226 flow [2024-11-07 15:33:19,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:33:19,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:33:19,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2024-11-07 15:33:19,904 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8648648648648649 [2024-11-07 15:33:19,904 INFO L175 Difference]: Start difference. First operand has 107 places, 101 transitions, 212 flow. Second operand 3 states and 288 transitions. [2024-11-07 15:33:19,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 97 transitions, 226 flow [2024-11-07 15:33:19,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 97 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:33:19,906 INFO L231 Difference]: Finished difference. Result has 103 places, 97 transitions, 202 flow [2024-11-07 15:33:19,906 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=103, PETRI_TRANSITIONS=97} [2024-11-07 15:33:19,907 INFO L277 CegarLoopForPetriNet]: 111 programPoint places, -8 predicate places. [2024-11-07 15:33:19,907 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 97 transitions, 202 flow [2024-11-07 15:33:19,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 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-11-07 15:33:19,907 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:33:19,907 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:33:19,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 15:33:19,907 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:33:19,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:33:19,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1667615661, now seen corresponding path program 1 times [2024-11-07 15:33:19,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:33:19,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305483093] [2024-11-07 15:33:19,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:33:19,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:33:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:33:19,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:33:19,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:33:19,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305483093] [2024-11-07 15:33:19,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305483093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:33:19,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:33:19,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:33:19,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257818239] [2024-11-07 15:33:19,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:33:19,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:33:19,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:33:19,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:33:19,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:33:19,961 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 111 [2024-11-07 15:33:19,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 97 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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-11-07 15:33:19,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:33:19,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 111 [2024-11-07 15:33:19,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:33:19,984 INFO L124 PetriNetUnfolderBase]: 8/175 cut-off events. [2024-11-07 15:33:19,984 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-07 15:33:19,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 175 events. 8/175 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 487 event pairs, 2 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 180. Up to 19 conditions per place. [2024-11-07 15:33:19,985 INFO L140 encePairwiseOnDemand]: 105/111 looper letters, 9 selfloop transitions, 4 changer transitions 0/100 dead transitions. [2024-11-07 15:33:19,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 100 transitions, 237 flow [2024-11-07 15:33:19,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:33:19,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:33:19,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2024-11-07 15:33:19,986 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9099099099099099 [2024-11-07 15:33:19,986 INFO L175 Difference]: Start difference. First operand has 103 places, 97 transitions, 202 flow. Second operand 3 states and 303 transitions. [2024-11-07 15:33:19,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 100 transitions, 237 flow [2024-11-07 15:33:19,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 100 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:33:19,988 INFO L231 Difference]: Finished difference. Result has 105 places, 99 transitions, 229 flow [2024-11-07 15:33:19,989 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=229, PETRI_PLACES=105, PETRI_TRANSITIONS=99} [2024-11-07 15:33:19,989 INFO L277 CegarLoopForPetriNet]: 111 programPoint places, -6 predicate places. [2024-11-07 15:33:19,989 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 99 transitions, 229 flow [2024-11-07 15:33:19,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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-11-07 15:33:19,990 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:33:19,990 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:33:19,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 15:33:19,990 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:33:19,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:33:19,990 INFO L85 PathProgramCache]: Analyzing trace with hash -385399741, now seen corresponding path program 1 times [2024-11-07 15:33:19,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:33:19,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226571450] [2024-11-07 15:33:19,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:33:19,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:33:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:33:20,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:33:20,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:33:20,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226571450] [2024-11-07 15:33:20,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226571450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:33:20,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:33:20,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:33:20,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013681300] [2024-11-07 15:33:20,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:33:20,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:33:20,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:33:20,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:33:20,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:33:20,063 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 111 [2024-11-07 15:33:20,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 99 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 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-11-07 15:33:20,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:33:20,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 111 [2024-11-07 15:33:20,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:33:20,082 INFO L124 PetriNetUnfolderBase]: 7/210 cut-off events. [2024-11-07 15:33:20,083 INFO L125 PetriNetUnfolderBase]: For 23/25 co-relation queries the response was YES. [2024-11-07 15:33:20,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 210 events. 7/210 cut-off events. For 23/25 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 675 event pairs, 2 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 247. Up to 23 conditions per place. [2024-11-07 15:33:20,087 INFO L140 encePairwiseOnDemand]: 106/111 looper letters, 11 selfloop transitions, 4 changer transitions 0/102 dead transitions. [2024-11-07 15:33:20,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 102 transitions, 269 flow [2024-11-07 15:33:20,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:33:20,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:33:20,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 302 transitions. [2024-11-07 15:33:20,088 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9069069069069069 [2024-11-07 15:33:20,088 INFO L175 Difference]: Start difference. First operand has 105 places, 99 transitions, 229 flow. Second operand 3 states and 302 transitions. [2024-11-07 15:33:20,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 102 transitions, 269 flow [2024-11-07 15:33:20,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 102 transitions, 259 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:33:20,090 INFO L231 Difference]: Finished difference. Result has 107 places, 102 transitions, 253 flow [2024-11-07 15:33:20,090 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=253, PETRI_PLACES=107, PETRI_TRANSITIONS=102} [2024-11-07 15:33:20,094 INFO L277 CegarLoopForPetriNet]: 111 programPoint places, -4 predicate places. [2024-11-07 15:33:20,094 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 102 transitions, 253 flow [2024-11-07 15:33:20,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 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-11-07 15:33:20,095 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:33:20,095 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:33:20,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 15:33:20,095 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:33:20,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:33:20,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1187427640, now seen corresponding path program 1 times [2024-11-07 15:33:20,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:33:20,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951129631] [2024-11-07 15:33:20,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:33:20,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:33:20,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:33:20,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:33:20,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:33:20,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951129631] [2024-11-07 15:33:20,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951129631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:33:20,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:33:20,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:33:20,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944682374] [2024-11-07 15:33:20,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:33:20,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 15:33:20,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:33:20,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 15:33:20,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 15:33:20,208 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 111 [2024-11-07 15:33:20,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 102 transitions, 253 flow. Second operand has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 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-11-07 15:33:20,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:33:20,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 111 [2024-11-07 15:33:20,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:33:20,263 INFO L124 PetriNetUnfolderBase]: 4/197 cut-off events. [2024-11-07 15:33:20,263 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-11-07 15:33:20,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 197 events. 4/197 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 577 event pairs, 1 based on Foata normal form. 1/186 useless extension candidates. Maximal degree in co-relation 236. Up to 16 conditions per place. [2024-11-07 15:33:20,264 INFO L140 encePairwiseOnDemand]: 107/111 looper letters, 14 selfloop transitions, 0 changer transitions 4/105 dead transitions. [2024-11-07 15:33:20,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 105 transitions, 295 flow [2024-11-07 15:33:20,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 15:33:20,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 15:33:20,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 469 transitions. [2024-11-07 15:33:20,266 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8450450450450451 [2024-11-07 15:33:20,266 INFO L175 Difference]: Start difference. First operand has 107 places, 102 transitions, 253 flow. Second operand 5 states and 469 transitions. [2024-11-07 15:33:20,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 105 transitions, 295 flow [2024-11-07 15:33:20,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 105 transitions, 287 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:33:20,269 INFO L231 Difference]: Finished difference. Result has 112 places, 101 transitions, 249 flow [2024-11-07 15:33:20,269 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=249, PETRI_PLACES=112, PETRI_TRANSITIONS=101} [2024-11-07 15:33:20,270 INFO L277 CegarLoopForPetriNet]: 111 programPoint places, 1 predicate places. [2024-11-07 15:33:20,270 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 101 transitions, 249 flow [2024-11-07 15:33:20,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 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-11-07 15:33:20,271 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:33:20,271 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:33:20,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 15:33:20,271 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:33:20,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:33:20,272 INFO L85 PathProgramCache]: Analyzing trace with hash -103993823, now seen corresponding path program 1 times [2024-11-07 15:33:20,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:33:20,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352419332] [2024-11-07 15:33:20,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:33:20,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:33:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:33:20,294 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 15:33:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:33:20,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 15:33:20,333 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 15:33:20,334 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining) [2024-11-07 15:33:20,335 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2024-11-07 15:33:20,336 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2024-11-07 15:33:20,336 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2024-11-07 15:33:20,336 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2024-11-07 15:33:20,336 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2024-11-07 15:33:20,336 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2024-11-07 15:33:20,336 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2024-11-07 15:33:20,336 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2024-11-07 15:33:20,336 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2024-11-07 15:33:20,336 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2024-11-07 15:33:20,336 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2024-11-07 15:33:20,336 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2024-11-07 15:33:20,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2024-11-07 15:33:20,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2024-11-07 15:33:20,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 15:33:20,337 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:33:20,387 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 15:33:20,390 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 15:33:20,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:33:20 BasicIcfg [2024-11-07 15:33:20,394 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 15:33:20,394 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 15:33:20,394 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 15:33:20,394 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 15:33:20,395 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:33:19" (3/4) ... [2024-11-07 15:33:20,395 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-07 15:33:20,455 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 15:33:20,455 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 15:33:20,456 INFO L158 Benchmark]: Toolchain (without parser) took 1924.19ms. Allocated memory is still 109.1MB. Free memory was 84.2MB in the beginning and 47.5MB in the end (delta: 36.7MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. [2024-11-07 15:33:20,456 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 83.9MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 15:33:20,456 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.35ms. Allocated memory is still 109.1MB. Free memory was 84.1MB in the beginning and 64.8MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 15:33:20,456 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.80ms. Allocated memory is still 109.1MB. Free memory was 64.8MB in the beginning and 63.1MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 15:33:20,456 INFO L158 Benchmark]: Boogie Preprocessor took 12.77ms. Allocated memory is still 109.1MB. Free memory was 63.1MB in the beginning and 62.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 15:33:20,457 INFO L158 Benchmark]: RCFGBuilder took 226.14ms. Allocated memory is still 109.1MB. Free memory was 62.1MB in the beginning and 49.0MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 15:33:20,457 INFO L158 Benchmark]: TraceAbstraction took 1282.52ms. Allocated memory is still 109.1MB. Free memory was 48.4MB in the beginning and 54.2MB in the end (delta: -5.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 15:33:20,457 INFO L158 Benchmark]: Witness Printer took 60.97ms. Allocated memory is still 109.1MB. Free memory was 54.2MB in the beginning and 47.5MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 15:33:20,458 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.29ms. Allocated memory is still 83.9MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 311.35ms. Allocated memory is still 109.1MB. Free memory was 84.1MB in the beginning and 64.8MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.80ms. Allocated memory is still 109.1MB. Free memory was 64.8MB in the beginning and 63.1MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 12.77ms. Allocated memory is still 109.1MB. Free memory was 63.1MB in the beginning and 62.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 226.14ms. Allocated memory is still 109.1MB. Free memory was 62.1MB in the beginning and 49.0MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1282.52ms. Allocated memory is still 109.1MB. Free memory was 48.4MB in the beginning and 54.2MB in the end (delta: -5.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 60.97ms. Allocated memory is still 109.1MB. Free memory was 54.2MB in the beginning and 47.5MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 693]: Data race detected Data race detected The following path leads to a data race: [L690] 0 volatile int x; VAL [x=0] [L691] 0 volatile int n; VAL [n=0, x=0] [L701] 0 pthread_t t1, t2; VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=0, x=0] [L702] 0 int i; VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=0, x=0] [L703] 0 x = 0 VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=0, x=0] [L704] 0 n = __VERIFIER_nondet_uint() VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=39, x=0] [L705] EXPR 0 n >= 20 VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=39, x=0] [L705] EXPR 0 n >= 20 && n < 40 VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=39, x=0] [L705] EXPR 0 n < 40 VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=39, x=0] [L705] EXPR 0 n >= 20 && n < 40 VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=39, x=0] [L705] CALL 0 assume_abort_if_not(n >= 20 && n < 40) [L687] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, n=39, x=0] [L705] RET 0 assume_abort_if_not(n >= 20 && n < 40) [L706] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=39, t1=-1, x=0] [L707] 0 i = 0 VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, i=0, n=39, t1=-1, x=0] [L707] 0 i < n VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, i=0, n=39, t1=-1, x=0] [L707] COND TRUE 0 i < n VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, i=0, n=39, t1=-1, x=0] [L708] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [\old(arg)={0:0}, \old(argc)=52, \old(argv)={53:51}, argc=52, i=0, n=39, t1=-1, t2=0, x=0] [L696] 2 int t; VAL [\old(arg)={0:0}, arg={0:0}, n=39, x=0] [L693] 1 x < n VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, n=39, x=0] [L697] 2 t = x VAL [\old(arg)={0:0}, arg={0:0}, n=39, t=0, x=0] [L698] 2 x = t + 1 VAL [\old(arg)={0:0}, arg={0:0}, n=39, t=0, x=1] [L693] 1 x < n VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, n=39, t=0, x=1] Now there is a data race on ~x~0 between C: x = t + 1 [698] and C: x < n [693] - UnprovableResult [Line: 697]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 704]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: 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: 708]: 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 with 1 thread instances CFG has 5 procedures, 142 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 147 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 51 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 153 IncrementalHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 27 mSDtfsCounter, 153 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=253occurred in iteration=5, InterpolantAutomatonStates: 20, 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, 308 NumberOfCodeBlocks, 308 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 236 ConstructedInterpolants, 0 QuantifiedInterpolants, 253 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-07 15:33:20,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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