./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/weaver/popl20-more-buffer-series3.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c031a4ce44fce05276ee0c322906dbff86776176e55e116d257d2b83e85a253c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:45:27,871 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:45:27,915 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:45:27,920 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:45:27,920 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:45:27,935 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:45:27,935 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:45:27,935 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:45:27,936 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:45:27,936 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:45:27,936 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:45:27,936 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:45:27,936 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:45:27,936 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:45:27,936 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:45:27,936 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:45:27,936 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:45:27,937 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:45:27,937 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:45:27,937 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:45:27,937 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:45:27,937 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:45:27,937 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:45:27,937 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:45:27,937 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:45:27,937 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:45:27,937 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:45:27,937 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:45:27,938 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:45:27,938 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:45:27,938 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:45:27,938 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:45:27,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:45:27,938 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:45:27,938 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:45:27,938 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:45:27,938 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:45:27,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:45:27,938 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:45:27,938 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:45:27,939 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:45:27,939 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:45:27,939 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:45:27,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:45:27,939 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:45:27,939 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:45:27,939 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:45:27,939 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:45:27,939 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 ! call(reach_error())) ) 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 -> c031a4ce44fce05276ee0c322906dbff86776176e55e116d257d2b83e85a253c [2025-01-09 16:45:28,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:45:28,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:45:28,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:45:28,166 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:45:28,167 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:45:28,167 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c [2025-01-09 16:45:29,269 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/994fefaf5/198821be7ecd44c3974f2280434fdd23/FLAGe5cd7b695 [2025-01-09 16:45:29,529 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:45:29,539 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c [2025-01-09 16:45:29,570 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/994fefaf5/198821be7ecd44c3974f2280434fdd23/FLAGe5cd7b695 [2025-01-09 16:45:29,834 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/994fefaf5/198821be7ecd44c3974f2280434fdd23 [2025-01-09 16:45:29,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:45:29,839 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:45:29,841 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:45:29,844 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:45:29,848 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:45:29,852 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:45:29" (1/1) ... [2025-01-09 16:45:29,853 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59a2629a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:29, skipping insertion in model container [2025-01-09 16:45:29,853 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:45:29" (1/1) ... [2025-01-09 16:45:29,877 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:45:29,994 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c[4403,4416] [2025-01-09 16:45:30,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:45:30,008 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:45:30,036 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c[4403,4416] [2025-01-09 16:45:30,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:45:30,059 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:45:30,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:30 WrapperNode [2025-01-09 16:45:30,060 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:45:30,061 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:45:30,061 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:45:30,061 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:45:30,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:30" (1/1) ... [2025-01-09 16:45:30,071 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:30" (1/1) ... [2025-01-09 16:45:30,099 INFO L138 Inliner]: procedures = 26, calls = 67, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 319 [2025-01-09 16:45:30,099 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:45:30,099 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:45:30,099 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:45:30,099 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:45:30,106 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:30" (1/1) ... [2025-01-09 16:45:30,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:30" (1/1) ... [2025-01-09 16:45:30,113 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:30" (1/1) ... [2025-01-09 16:45:30,122 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-01-09 16:45:30,122 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:30" (1/1) ... [2025-01-09 16:45:30,122 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:30" (1/1) ... [2025-01-09 16:45:30,127 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:30" (1/1) ... [2025-01-09 16:45:30,128 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:30" (1/1) ... [2025-01-09 16:45:30,130 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:30" (1/1) ... [2025-01-09 16:45:30,131 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:30" (1/1) ... [2025-01-09 16:45:30,132 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:30" (1/1) ... [2025-01-09 16:45:30,137 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:45:30,138 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:45:30,138 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:45:30,138 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:45:30,139 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:30" (1/1) ... [2025-01-09 16:45:30,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:45:30,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:45:30,167 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) [2025-01-09 16:45:30,172 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 [2025-01-09 16:45:30,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:45:30,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:45:30,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:45:30,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:45:30,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:45:30,187 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:45:30,187 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:45:30,187 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:45:30,187 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:45:30,187 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:45:30,187 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:45:30,187 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-09 16:45:30,187 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-09 16:45:30,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:45:30,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:45:30,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 16:45:30,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 16:45:30,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 16:45:30,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:45:30,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:45:30,189 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:45:30,258 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:45:30,259 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:45:30,599 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:45:30,599 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:45:30,850 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:45:30,850 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:45:30,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:45:30 BoogieIcfgContainer [2025-01-09 16:45:30,851 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:45:30,852 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:45:30,852 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:45:30,855 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:45:30,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:45:29" (1/3) ... [2025-01-09 16:45:30,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f13faeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:45:30, skipping insertion in model container [2025-01-09 16:45:30,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:30" (2/3) ... [2025-01-09 16:45:30,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f13faeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:45:30, skipping insertion in model container [2025-01-09 16:45:30,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:45:30" (3/3) ... [2025-01-09 16:45:30,856 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series3.wvr.c [2025-01-09 16:45:30,868 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:45:30,869 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-series3.wvr.c that has 5 procedures, 46 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2025-01-09 16:45:30,869 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:45:30,923 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-09 16:45:30,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 52 transitions, 132 flow [2025-01-09 16:45:30,980 INFO L124 PetriNetUnfolderBase]: 7/48 cut-off events. [2025-01-09 16:45:30,982 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 16:45:30,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 48 events. 7/48 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 83 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2025-01-09 16:45:30,986 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 52 transitions, 132 flow [2025-01-09 16:45:30,988 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 47 transitions, 118 flow [2025-01-09 16:45:30,993 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:45:31,007 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;@537adef7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:45:31,008 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-09 16:45:31,020 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:45:31,020 INFO L124 PetriNetUnfolderBase]: 7/46 cut-off events. [2025-01-09 16:45:31,020 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 16:45:31,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:31,021 INFO L206 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] [2025-01-09 16:45:31,021 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:45:31,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:31,025 INFO L85 PathProgramCache]: Analyzing trace with hash -820230749, now seen corresponding path program 1 times [2025-01-09 16:45:31,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:31,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823636180] [2025-01-09 16:45:31,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:45:31,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:31,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 16:45:31,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:45:31,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:45:31,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:31,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:45:31,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:31,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823636180] [2025-01-09 16:45:31,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823636180] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:45:31,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:45:31,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:45:31,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928206086] [2025-01-09 16:45:31,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:45:31,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:45:31,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:31,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:45:31,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:45:31,386 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 52 [2025-01-09 16:45:31,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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) [2025-01-09 16:45:31,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:31,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 52 [2025-01-09 16:45:31,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:31,856 INFO L124 PetriNetUnfolderBase]: 2408/3680 cut-off events. [2025-01-09 16:45:31,856 INFO L125 PetriNetUnfolderBase]: For 197/197 co-relation queries the response was YES. [2025-01-09 16:45:31,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6951 conditions, 3680 events. 2408/3680 cut-off events. For 197/197 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 20813 event pairs, 472 based on Foata normal form. 1/3449 useless extension candidates. Maximal degree in co-relation 6259. Up to 2067 conditions per place. [2025-01-09 16:45:31,880 INFO L140 encePairwiseOnDemand]: 48/52 looper letters, 43 selfloop transitions, 3 changer transitions 1/64 dead transitions. [2025-01-09 16:45:31,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 64 transitions, 261 flow [2025-01-09 16:45:31,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:45:31,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:45:31,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2025-01-09 16:45:31,889 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7115384615384616 [2025-01-09 16:45:31,890 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 118 flow. Second operand 3 states and 111 transitions. [2025-01-09 16:45:31,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 64 transitions, 261 flow [2025-01-09 16:45:31,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 64 transitions, 235 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-09 16:45:31,903 INFO L231 Difference]: Finished difference. Result has 48 places, 49 transitions, 121 flow [2025-01-09 16:45:31,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=48, PETRI_TRANSITIONS=49} [2025-01-09 16:45:31,908 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2025-01-09 16:45:31,908 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 49 transitions, 121 flow [2025-01-09 16:45:31,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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) [2025-01-09 16:45:31,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:31,909 INFO L206 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] [2025-01-09 16:45:31,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:45:31,910 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:45:31,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:31,910 INFO L85 PathProgramCache]: Analyzing trace with hash 256186289, now seen corresponding path program 1 times [2025-01-09 16:45:31,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:31,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034034789] [2025-01-09 16:45:31,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:45:31,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:31,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 16:45:31,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 16:45:31,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:45:31,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:32,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:45:32,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:32,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034034789] [2025-01-09 16:45:32,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034034789] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:45:32,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:45:32,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:45:32,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453194503] [2025-01-09 16:45:32,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:45:32,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:45:32,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:32,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:45:32,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:45:32,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 52 [2025-01-09 16:45:32,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 49 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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) [2025-01-09 16:45:32,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:32,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 52 [2025-01-09 16:45:32,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:32,487 INFO L124 PetriNetUnfolderBase]: 2669/4039 cut-off events. [2025-01-09 16:45:32,487 INFO L125 PetriNetUnfolderBase]: For 675/675 co-relation queries the response was YES. [2025-01-09 16:45:32,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8393 conditions, 4039 events. 2669/4039 cut-off events. For 675/675 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 23784 event pairs, 761 based on Foata normal form. 104/3861 useless extension candidates. Maximal degree in co-relation 3111. Up to 2321 conditions per place. [2025-01-09 16:45:32,534 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 52 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2025-01-09 16:45:32,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 71 transitions, 287 flow [2025-01-09 16:45:32,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:45:32,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:45:32,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2025-01-09 16:45:32,537 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7371794871794872 [2025-01-09 16:45:32,537 INFO L175 Difference]: Start difference. First operand has 48 places, 49 transitions, 121 flow. Second operand 3 states and 115 transitions. [2025-01-09 16:45:32,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 71 transitions, 287 flow [2025-01-09 16:45:32,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 71 transitions, 283 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:45:32,539 INFO L231 Difference]: Finished difference. Result has 50 places, 50 transitions, 132 flow [2025-01-09 16:45:32,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=50, PETRI_TRANSITIONS=50} [2025-01-09 16:45:32,540 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2025-01-09 16:45:32,540 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 50 transitions, 132 flow [2025-01-09 16:45:32,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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) [2025-01-09 16:45:32,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:32,541 INFO L206 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] [2025-01-09 16:45:32,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:45:32,541 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:45:32,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:32,541 INFO L85 PathProgramCache]: Analyzing trace with hash 772456633, now seen corresponding path program 1 times [2025-01-09 16:45:32,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:32,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912618994] [2025-01-09 16:45:32,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:45:32,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:32,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 16:45:32,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 16:45:32,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:45:32,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:32,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:45:32,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:32,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912618994] [2025-01-09 16:45:32,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912618994] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:45:32,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:45:32,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:45:32,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076514981] [2025-01-09 16:45:32,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:45:32,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:45:32,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:32,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:45:32,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:45:32,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 52 [2025-01-09 16:45:32,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 50 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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) [2025-01-09 16:45:32,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:32,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 52 [2025-01-09 16:45:32,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:32,974 INFO L124 PetriNetUnfolderBase]: 2977/4712 cut-off events. [2025-01-09 16:45:32,975 INFO L125 PetriNetUnfolderBase]: For 1586/1601 co-relation queries the response was YES. [2025-01-09 16:45:32,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10160 conditions, 4712 events. 2977/4712 cut-off events. For 1586/1601 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 30115 event pairs, 955 based on Foata normal form. 69/4578 useless extension candidates. Maximal degree in co-relation 4634. Up to 2600 conditions per place. [2025-01-09 16:45:32,997 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 52 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2025-01-09 16:45:32,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 71 transitions, 303 flow [2025-01-09 16:45:32,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:45:32,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:45:32,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2025-01-09 16:45:32,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7243589743589743 [2025-01-09 16:45:32,998 INFO L175 Difference]: Start difference. First operand has 50 places, 50 transitions, 132 flow. Second operand 3 states and 113 transitions. [2025-01-09 16:45:32,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 71 transitions, 303 flow [2025-01-09 16:45:32,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 71 transitions, 300 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:45:33,000 INFO L231 Difference]: Finished difference. Result has 52 places, 51 transitions, 144 flow [2025-01-09 16:45:33,000 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=52, PETRI_TRANSITIONS=51} [2025-01-09 16:45:33,000 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2025-01-09 16:45:33,001 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 51 transitions, 144 flow [2025-01-09 16:45:33,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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) [2025-01-09 16:45:33,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:33,001 INFO L206 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] [2025-01-09 16:45:33,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:45:33,001 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:45:33,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:33,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1310762296, now seen corresponding path program 1 times [2025-01-09 16:45:33,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:33,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471045538] [2025-01-09 16:45:33,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:45:33,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:33,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 16:45:33,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 16:45:33,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:45:33,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:33,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:45:33,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:33,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471045538] [2025-01-09 16:45:33,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471045538] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:45:33,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:45:33,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:45:33,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942844572] [2025-01-09 16:45:33,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:45:33,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:45:33,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:33,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:45:33,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:45:33,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 52 [2025-01-09 16:45:33,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 51 transitions, 144 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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) [2025-01-09 16:45:33,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:33,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 52 [2025-01-09 16:45:33,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:33,599 INFO L124 PetriNetUnfolderBase]: 3555/5552 cut-off events. [2025-01-09 16:45:33,599 INFO L125 PetriNetUnfolderBase]: For 2345/2404 co-relation queries the response was YES. [2025-01-09 16:45:33,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12739 conditions, 5552 events. 3555/5552 cut-off events. For 2345/2404 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 36614 event pairs, 2675 based on Foata normal form. 108/5296 useless extension candidates. Maximal degree in co-relation 6200. Up to 4011 conditions per place. [2025-01-09 16:45:33,679 INFO L140 encePairwiseOnDemand]: 48/52 looper letters, 59 selfloop transitions, 3 changer transitions 0/79 dead transitions. [2025-01-09 16:45:33,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 79 transitions, 347 flow [2025-01-09 16:45:33,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:45:33,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:45:33,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2025-01-09 16:45:33,681 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6778846153846154 [2025-01-09 16:45:33,681 INFO L175 Difference]: Start difference. First operand has 52 places, 51 transitions, 144 flow. Second operand 4 states and 141 transitions. [2025-01-09 16:45:33,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 79 transitions, 347 flow [2025-01-09 16:45:33,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 79 transitions, 344 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:45:33,683 INFO L231 Difference]: Finished difference. Result has 56 places, 53 transitions, 162 flow [2025-01-09 16:45:33,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=56, PETRI_TRANSITIONS=53} [2025-01-09 16:45:33,683 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2025-01-09 16:45:33,683 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 53 transitions, 162 flow [2025-01-09 16:45:33,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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) [2025-01-09 16:45:33,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:33,684 INFO L206 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] [2025-01-09 16:45:33,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:45:33,684 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:45:33,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:33,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1357798254, now seen corresponding path program 1 times [2025-01-09 16:45:33,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:33,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132867255] [2025-01-09 16:45:33,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:45:33,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:33,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 16:45:33,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 16:45:33,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:45:33,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:33,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:45:33,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:33,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132867255] [2025-01-09 16:45:33,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132867255] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:45:33,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:45:33,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:45:33,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170279079] [2025-01-09 16:45:33,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:45:33,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:45:33,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:33,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:45:33,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:45:33,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 52 [2025-01-09 16:45:33,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 53 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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) [2025-01-09 16:45:33,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:33,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 52 [2025-01-09 16:45:33,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:34,256 INFO L124 PetriNetUnfolderBase]: 4275/7007 cut-off events. [2025-01-09 16:45:34,256 INFO L125 PetriNetUnfolderBase]: For 2986/3106 co-relation queries the response was YES. [2025-01-09 16:45:34,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15839 conditions, 7007 events. 4275/7007 cut-off events. For 2986/3106 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 49655 event pairs, 3295 based on Foata normal form. 151/6798 useless extension candidates. Maximal degree in co-relation 13291. Up to 4871 conditions per place. [2025-01-09 16:45:34,288 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 58 selfloop transitions, 6 changer transitions 0/81 dead transitions. [2025-01-09 16:45:34,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 81 transitions, 370 flow [2025-01-09 16:45:34,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:45:34,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:45:34,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2025-01-09 16:45:34,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6230769230769231 [2025-01-09 16:45:34,289 INFO L175 Difference]: Start difference. First operand has 56 places, 53 transitions, 162 flow. Second operand 5 states and 162 transitions. [2025-01-09 16:45:34,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 81 transitions, 370 flow [2025-01-09 16:45:34,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 81 transitions, 366 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:45:34,294 INFO L231 Difference]: Finished difference. Result has 62 places, 57 transitions, 197 flow [2025-01-09 16:45:34,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=197, PETRI_PLACES=62, PETRI_TRANSITIONS=57} [2025-01-09 16:45:34,297 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 9 predicate places. [2025-01-09 16:45:34,297 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 57 transitions, 197 flow [2025-01-09 16:45:34,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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) [2025-01-09 16:45:34,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:34,297 INFO L206 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] [2025-01-09 16:45:34,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:45:34,298 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:45:34,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:34,298 INFO L85 PathProgramCache]: Analyzing trace with hash -986175112, now seen corresponding path program 1 times [2025-01-09 16:45:34,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:34,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061487854] [2025-01-09 16:45:34,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:45:34,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:34,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 16:45:34,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 16:45:34,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:45:34,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:34,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:45:34,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:34,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061487854] [2025-01-09 16:45:34,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061487854] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:45:34,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:45:34,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:45:34,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708350996] [2025-01-09 16:45:34,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:45:34,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:45:34,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:34,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:45:34,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:45:34,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 52 [2025-01-09 16:45:34,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 57 transitions, 197 flow. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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) [2025-01-09 16:45:34,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:34,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 52 [2025-01-09 16:45:34,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:35,553 INFO L124 PetriNetUnfolderBase]: 9681/15204 cut-off events. [2025-01-09 16:45:35,554 INFO L125 PetriNetUnfolderBase]: For 6301/6517 co-relation queries the response was YES. [2025-01-09 16:45:35,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34967 conditions, 15204 events. 9681/15204 cut-off events. For 6301/6517 co-relation queries the response was YES. Maximal size of possible extension queue 790. Compared 112513 event pairs, 3907 based on Foata normal form. 17/14270 useless extension candidates. Maximal degree in co-relation 29556. Up to 5705 conditions per place. [2025-01-09 16:45:35,614 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 94 selfloop transitions, 9 changer transitions 0/117 dead transitions. [2025-01-09 16:45:35,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 117 transitions, 592 flow [2025-01-09 16:45:35,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:45:35,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:45:35,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2025-01-09 16:45:35,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6282051282051282 [2025-01-09 16:45:35,616 INFO L175 Difference]: Start difference. First operand has 62 places, 57 transitions, 197 flow. Second operand 6 states and 196 transitions. [2025-01-09 16:45:35,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 117 transitions, 592 flow [2025-01-09 16:45:35,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 117 transitions, 585 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-09 16:45:35,621 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 248 flow [2025-01-09 16:45:35,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=248, PETRI_PLACES=70, PETRI_TRANSITIONS=61} [2025-01-09 16:45:35,622 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 17 predicate places. [2025-01-09 16:45:35,622 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 248 flow [2025-01-09 16:45:35,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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) [2025-01-09 16:45:35,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:35,623 INFO L206 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] [2025-01-09 16:45:35,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:45:35,623 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:45:35,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:35,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1159719603, now seen corresponding path program 1 times [2025-01-09 16:45:35,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:35,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468582968] [2025-01-09 16:45:35,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:45:35,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:35,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 16:45:35,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 16:45:35,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:45:35,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:35,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:45:35,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:35,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468582968] [2025-01-09 16:45:35,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468582968] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:45:35,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:45:35,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:45:35,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382622376] [2025-01-09 16:45:35,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:45:35,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:45:35,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:35,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:45:35,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:45:35,928 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 52 [2025-01-09 16:45:35,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 248 flow. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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) [2025-01-09 16:45:35,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:35,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 52 [2025-01-09 16:45:35,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:36,609 INFO L124 PetriNetUnfolderBase]: 7717/12264 cut-off events. [2025-01-09 16:45:36,610 INFO L125 PetriNetUnfolderBase]: For 6046/6220 co-relation queries the response was YES. [2025-01-09 16:45:36,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29162 conditions, 12264 events. 7717/12264 cut-off events. For 6046/6220 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 88175 event pairs, 2994 based on Foata normal form. 5/11395 useless extension candidates. Maximal degree in co-relation 22611. Up to 5797 conditions per place. [2025-01-09 16:45:36,651 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 62 selfloop transitions, 6 changer transitions 30/112 dead transitions. [2025-01-09 16:45:36,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 112 transitions, 587 flow [2025-01-09 16:45:36,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:45:36,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:45:36,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 192 transitions. [2025-01-09 16:45:36,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2025-01-09 16:45:36,652 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 248 flow. Second operand 6 states and 192 transitions. [2025-01-09 16:45:36,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 112 transitions, 587 flow [2025-01-09 16:45:36,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 112 transitions, 578 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-01-09 16:45:36,659 INFO L231 Difference]: Finished difference. Result has 77 places, 59 transitions, 244 flow [2025-01-09 16:45:36,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=244, PETRI_PLACES=77, PETRI_TRANSITIONS=59} [2025-01-09 16:45:36,659 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 24 predicate places. [2025-01-09 16:45:36,660 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 59 transitions, 244 flow [2025-01-09 16:45:36,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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) [2025-01-09 16:45:36,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:36,660 INFO L206 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] [2025-01-09 16:45:36,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:45:36,660 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:45:36,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:36,660 INFO L85 PathProgramCache]: Analyzing trace with hash 684029431, now seen corresponding path program 1 times [2025-01-09 16:45:36,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:36,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733854955] [2025-01-09 16:45:36,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:45:36,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:36,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 16:45:36,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 16:45:36,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:45:36,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:36,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:45:36,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:36,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733854955] [2025-01-09 16:45:36,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733854955] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:45:36,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:45:36,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:45:36,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231128129] [2025-01-09 16:45:36,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:45:36,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:45:36,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:36,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:45:36,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:45:36,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 52 [2025-01-09 16:45:36,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 59 transitions, 244 flow. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 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) [2025-01-09 16:45:36,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:36,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 52 [2025-01-09 16:45:36,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:37,436 INFO L124 PetriNetUnfolderBase]: 4953/7836 cut-off events. [2025-01-09 16:45:37,436 INFO L125 PetriNetUnfolderBase]: For 5854/5888 co-relation queries the response was YES. [2025-01-09 16:45:37,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20170 conditions, 7836 events. 4953/7836 cut-off events. For 5854/5888 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 51771 event pairs, 693 based on Foata normal form. 328/8063 useless extension candidates. Maximal degree in co-relation 16897. Up to 4737 conditions per place. [2025-01-09 16:45:37,477 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 67 selfloop transitions, 5 changer transitions 2/89 dead transitions. [2025-01-09 16:45:37,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 89 transitions, 500 flow [2025-01-09 16:45:37,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:45:37,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:45:37,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 173 transitions. [2025-01-09 16:45:37,478 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5544871794871795 [2025-01-09 16:45:37,478 INFO L175 Difference]: Start difference. First operand has 77 places, 59 transitions, 244 flow. Second operand 6 states and 173 transitions. [2025-01-09 16:45:37,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 89 transitions, 500 flow [2025-01-09 16:45:37,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 89 transitions, 482 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-01-09 16:45:37,491 INFO L231 Difference]: Finished difference. Result has 73 places, 57 transitions, 220 flow [2025-01-09 16:45:37,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=73, PETRI_TRANSITIONS=57} [2025-01-09 16:45:37,491 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 20 predicate places. [2025-01-09 16:45:37,491 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 57 transitions, 220 flow [2025-01-09 16:45:37,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 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) [2025-01-09 16:45:37,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:37,492 INFO L206 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] [2025-01-09 16:45:37,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:45:37,492 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:45:37,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:37,492 INFO L85 PathProgramCache]: Analyzing trace with hash -2040570982, now seen corresponding path program 1 times [2025-01-09 16:45:37,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:37,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117787064] [2025-01-09 16:45:37,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:45:37,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:37,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 16:45:37,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 16:45:37,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:45:37,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:37,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:45:37,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:37,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117787064] [2025-01-09 16:45:37,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117787064] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:45:37,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:45:37,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:45:37,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896342600] [2025-01-09 16:45:37,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:45:37,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:45:37,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:37,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:45:37,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:45:37,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 52 [2025-01-09 16:45:37,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 57 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 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) [2025-01-09 16:45:37,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:37,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 52 [2025-01-09 16:45:37,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:38,184 INFO L124 PetriNetUnfolderBase]: 3441/5314 cut-off events. [2025-01-09 16:45:38,184 INFO L125 PetriNetUnfolderBase]: For 4664/4856 co-relation queries the response was YES. [2025-01-09 16:45:38,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13958 conditions, 5314 events. 3441/5314 cut-off events. For 4664/4856 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 32401 event pairs, 480 based on Foata normal form. 368/5599 useless extension candidates. Maximal degree in co-relation 12126. Up to 3395 conditions per place. [2025-01-09 16:45:38,213 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 68 selfloop transitions, 5 changer transitions 1/89 dead transitions. [2025-01-09 16:45:38,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 89 transitions, 484 flow [2025-01-09 16:45:38,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:45:38,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:45:38,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 175 transitions. [2025-01-09 16:45:38,214 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5608974358974359 [2025-01-09 16:45:38,214 INFO L175 Difference]: Start difference. First operand has 73 places, 57 transitions, 220 flow. Second operand 6 states and 175 transitions. [2025-01-09 16:45:38,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 89 transitions, 484 flow [2025-01-09 16:45:38,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 89 transitions, 460 flow, removed 4 selfloop flow, removed 7 redundant places. [2025-01-09 16:45:38,218 INFO L231 Difference]: Finished difference. Result has 70 places, 56 transitions, 210 flow [2025-01-09 16:45:38,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2025-01-09 16:45:38,218 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 17 predicate places. [2025-01-09 16:45:38,218 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 210 flow [2025-01-09 16:45:38,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 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) [2025-01-09 16:45:38,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:38,219 INFO L206 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] [2025-01-09 16:45:38,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:45:38,219 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:45:38,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:38,220 INFO L85 PathProgramCache]: Analyzing trace with hash -812599324, now seen corresponding path program 1 times [2025-01-09 16:45:38,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:38,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038775366] [2025-01-09 16:45:38,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:45:38,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:38,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 16:45:38,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 16:45:38,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:45:38,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:45:38,259 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:45:38,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 16:45:38,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 16:45:38,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:45:38,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:45:38,311 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:45:38,311 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:45:38,312 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-01-09 16:45:38,313 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-01-09 16:45:38,313 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-01-09 16:45:38,313 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-01-09 16:45:38,313 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-01-09 16:45:38,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:45:38,314 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:45:38,380 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 16:45:38,380 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:45:38,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:45:38 BasicIcfg [2025-01-09 16:45:38,384 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:45:38,384 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:45:38,384 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:45:38,384 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:45:38,385 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:45:30" (3/4) ... [2025-01-09 16:45:38,385 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 16:45:38,463 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 76. [2025-01-09 16:45:38,530 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 16:45:38,530 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 16:45:38,530 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:45:38,531 INFO L158 Benchmark]: Toolchain (without parser) took 8691.74ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 110.3MB in the beginning and 895.3MB in the end (delta: -785.0MB). Peak memory consumption was 519.1MB. Max. memory is 16.1GB. [2025-01-09 16:45:38,531 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:45:38,531 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.78ms. Allocated memory is still 142.6MB. Free memory was 110.3MB in the beginning and 97.3MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:45:38,532 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.19ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 95.3MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:45:38,532 INFO L158 Benchmark]: Boogie Preprocessor took 38.16ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 92.1MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:45:38,532 INFO L158 Benchmark]: RCFGBuilder took 712.80ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 68.0MB in the end (delta: 24.1MB). Peak memory consumption was 65.1MB. Max. memory is 16.1GB. [2025-01-09 16:45:38,532 INFO L158 Benchmark]: TraceAbstraction took 7531.73ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 68.0MB in the beginning and 920.4MB in the end (delta: -852.4MB). Peak memory consumption was 445.6MB. Max. memory is 16.1GB. [2025-01-09 16:45:38,532 INFO L158 Benchmark]: Witness Printer took 146.51ms. Allocated memory is still 1.4GB. Free memory was 920.4MB in the beginning and 895.3MB in the end (delta: 25.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 16:45:38,533 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.19ms. Allocated memory is still 201.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.78ms. Allocated memory is still 142.6MB. Free memory was 110.3MB in the beginning and 97.3MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.19ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 95.3MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.16ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 92.1MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 712.80ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 68.0MB in the end (delta: 24.1MB). Peak memory consumption was 65.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7531.73ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 68.0MB in the beginning and 920.4MB in the end (delta: -852.4MB). Peak memory consumption was 445.6MB. Max. memory is 16.1GB. * Witness Printer took 146.51ms. Allocated memory is still 1.4GB. Free memory was 920.4MB in the beginning and 895.3MB in the end (delta: 25.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 155]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L41] 0 int *q1, *q2, *f; [L42] 0 int q1_front, q1_back, q2_front, q2_back, i, j, n1, n2, N, total; [L129] 0 pthread_t t1, t2, t3, t4; [L131] 0 N = __VERIFIER_nondet_int() [L132] 0 n1 = __VERIFIER_nondet_int() [L133] 0 n2 = __VERIFIER_nondet_int() [L134] 0 q1_front = __VERIFIER_nondet_int() [L135] 0 q1_back = q1_front [L136] 0 q2_front = __VERIFIER_nondet_int() [L137] 0 q2_back = q2_front [L138] CALL, EXPR 0 create_fresh_int_array(n1) [L161] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size >= 0) [L162] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L162] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L164] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L165] 0 int i = 0; VAL [N=1, \old(size)=1, arr={-6:0}, f={0:0}, i=0, i=0, j=0, n1=1, n2=1, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND TRUE 0 i < size [L166] 0 arr[i] = __VERIFIER_nondet_int() [L165] 0 i++ VAL [N=1, \old(size)=1, arr={-6:0}, f={0:0}, i=0, i=1, j=0, n1=1, n2=1, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND FALSE 0 !(i < size) [L168] 0 return arr; [L138] RET, EXPR 0 create_fresh_int_array(n1) [L138] 0 q1 = create_fresh_int_array(n1) [L139] CALL, EXPR 0 create_fresh_int_array(n2) [L161] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size >= 0) [L162] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L162] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L164] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L165] 0 int i = 0; VAL [N=1, \old(size)=1, arr={-4:0}, f={0:0}, i=0, i=0, j=0, n1=1, n2=1, q1={-6:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND TRUE 0 i < size [L166] 0 arr[i] = __VERIFIER_nondet_int() [L165] 0 i++ VAL [N=1, \old(size)=1, arr={-4:0}, f={0:0}, i=0, i=1, j=0, n1=1, n2=1, q1={-6:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND FALSE 0 !(i < size) [L168] 0 return arr; [L139] RET, EXPR 0 create_fresh_int_array(n2) [L139] 0 q2 = create_fresh_int_array(n2) [L140] CALL, EXPR 0 create_fresh_int_array(N) [L161] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size >= 0) [L162] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L162] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L164] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L165] 0 int i = 0; VAL [N=1, \old(size)=1, arr={-5:0}, f={0:0}, i=0, i=0, j=0, n1=1, n2=1, q1={-6:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND TRUE 0 i < size [L166] 0 arr[i] = __VERIFIER_nondet_int() [L165] 0 i++ VAL [N=1, \old(size)=1, arr={-5:0}, f={0:0}, i=0, i=1, j=0, n1=1, n2=1, q1={-6:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND FALSE 0 !(i < size) [L168] 0 return arr; [L140] RET, EXPR 0 create_fresh_int_array(N) [L140] 0 f = create_fresh_int_array(N) [L142] CALL 0 assume_abort_if_not(N >= 0) [L38] COND FALSE 0 !(!cond) [L142] RET 0 assume_abort_if_not(N >= 0) [L145] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [N=1, f={-5:0}, i=0, j=0, n1=1, n2=1, q1={-6:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, total=0] [L146] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [N=1, f={-5:0}, i=0, j=0, n1=1, n2=1, q1={-6:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, total=0] [L71] 2 _Bool cond = j < N; VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=0, j=0, n1=1, n2=1, q1={-6:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L73] COND TRUE 2 \read(cond) VAL [N=1, f={-5:0}, i=0, j=0, n1=1, n2=1, q1={-6:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L75] CALL 2 assume_abort_if_not(q2_back >= 0 && q2_back < n2) [L38] COND FALSE 2 !(!cond) [L75] RET 2 assume_abort_if_not(q2_back >= 0 && q2_back < n2) [L76] EXPR 2 f[j] [L76] CALL 2 assume_abort_if_not(f[j] > -2147483648) [L38] COND FALSE 2 !(!cond) [L76] RET 2 assume_abort_if_not(f[j] > -2147483648) [L77] EXPR 2 q2[q2_back] [L77] EXPR 2 f[j] [L77] CALL 2 assume_abort_if_not(q2[q2_back] == -f[j]) [L38] COND FALSE 2 !(!cond) [L77] RET 2 assume_abort_if_not(q2[q2_back] == -f[j]) [L78] CALL 2 assume_abort_if_not(q2_back < 2147483647) [L38] COND FALSE 2 !(!cond) [L78] RET 2 assume_abort_if_not(q2_back < 2147483647) [L79] 2 j++ VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-6:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L147] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [N=1, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-6:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, total=0] [L148] FCALL, FORK 0 pthread_create(&t4, 0, thread4, 0) VAL [N=1, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-6:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=0] [L112] 4 _Bool cond = j < N || q2_front < q2_back; VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-6:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L114] COND FALSE 4 !(\read(cond)) [L125] 4 return 0; [L82] 2 q2_back++ VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-6:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=1, q2_front=0, total=0] [L85] 2 cond = j < N VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-6:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=1, q2_front=0, total=0] [L73] COND FALSE 2 !(\read(cond)) [L89] 2 return 0; [L49] 1 _Bool cond = i < N; VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-6:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=1, q2_front=0, total=0] [L51] COND TRUE 1 \read(cond) VAL [N=1, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-6:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=1, q2_front=0, total=0] [L53] CALL 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1) [L38] COND FALSE 1 !(!cond) [L53] RET 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1) [L54] EXPR 1 q1[q1_back] [L54] EXPR 1 f[i] [L54] CALL 1 assume_abort_if_not(q1[q1_back] == f[i]) [L38] COND FALSE 1 !(!cond) [L54] RET 1 assume_abort_if_not(q1[q1_back] == f[i]) [L55] CALL 1 assume_abort_if_not(q1_back < 2147483647) [L38] COND FALSE 1 !(!cond) [L55] RET 1 assume_abort_if_not(q1_back < 2147483647) [L56] 1 i++ VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-6:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=1, q2_front=0, total=0] [L59] 1 q1_back++ VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-6:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=1, q2_front=0, total=0] [L62] 1 cond = i < N VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-6:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=1, q2_front=0, total=0] [L51] COND FALSE 1 !(\read(cond)) [L66] 1 return 0; [L94] 3 _Bool cond = i < N || q1_front < q1_back; VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-6:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=1, q2_front=0, total=0] [L96] COND TRUE 3 \read(cond) VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-6:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=1, q2_front=0, total=0] [L98] CALL 3 assume_abort_if_not(q1_front < q1_back && q1_front >= 0 && q1_front < n1) [L38] COND FALSE 3 !(!cond) [L98] RET 3 assume_abort_if_not(q1_front < q1_back && q1_front >= 0 && q1_front < n1) [L99] EXPR 3 q1[q1_front] [L99] CALL, EXPR 3 plus(total, q1[q1_front]) [L172] CALL 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L38] COND FALSE 3 !(!cond) [L172] RET 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L173] CALL 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 3 !(!cond) [L173] RET 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L174] 3 return a + b; [L99] RET, EXPR 3 plus(total, q1[q1_front]) [L99] 3 total = plus(total, q1[q1_front]) [L100] 3 q1_front++ VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-6:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=1, q2_front=0, total=7] [L103] 3 cond = i < N || q1_front < q1_back VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-6:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=1, q2_front=0, total=7] [L96] COND FALSE 3 !(\read(cond)) [L107] 3 return 0; [L149] FCALL, JOIN 1 pthread_join(t1, 0) VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-6:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=1, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=7] [L150] FCALL, JOIN 2 pthread_join(t2, 0) VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-6:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=1, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=7] [L151] FCALL, JOIN 3 pthread_join(t3, 0) VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-6:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=1, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=7] [L152] FCALL, JOIN 4 pthread_join(t4, 0) VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-6:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=1, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=7] [L154] CALL 0 assume_abort_if_not(total != 0) [L38] COND FALSE 0 !(!cond) [L154] RET 0 assume_abort_if_not(total != 0) [L155] 0 reach_error() VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-6:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=1, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=7] - UnprovableResult [Line: 145]: 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: 148]: 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: 146]: 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: 147]: 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 9 procedures, 76 locations, 5 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: 7.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 456 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 407 mSDsluCounter, 28 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1061 IncrementalHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 4 mSDtfsCounter, 1061 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=248occurred in iteration=6, InterpolantAutomatonStates: 42, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 368 NumberOfCodeBlocks, 368 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 315 ConstructedInterpolants, 0 QuantifiedInterpolants, 727 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 14/14 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: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 16:45:38,550 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