./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/29_conditionals_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/pthread-ext/29_conditionals_vs.i', '-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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'c3f647420f42d7fdb333957b618cdd528a4c5a4cecdb35105a1a2630df70b3d6'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/29_conditionals_vs.i -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 c3f647420f42d7fdb333957b618cdd528a4c5a4cecdb35105a1a2630df70b3d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 11:08:17,095 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 11:08:17,207 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 11:08:17,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 11:08:17,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 11:08:17,247 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 11:08:17,249 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 11:08:17,249 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 11:08:17,249 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 11:08:17,250 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 11:08:17,251 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 11:08:17,251 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 11:08:17,251 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 11:08:17,251 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 11:08:17,251 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 11:08:17,252 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 11:08:17,252 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 11:08:17,252 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 11:08:17,252 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 11:08:17,252 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 11:08:17,252 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 11:08:17,252 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 11:08:17,252 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 11:08:17,252 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 11:08:17,252 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 11:08:17,252 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 11:08:17,252 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 11:08:17,252 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 11:08:17,252 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 11:08:17,252 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 11:08:17,252 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 11:08:17,252 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 11:08:17,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:08:17,253 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 11:08:17,253 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 11:08:17,253 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 11:08:17,253 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 11:08:17,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 11:08:17,253 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 11:08:17,253 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 11:08:17,253 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 11:08:17,253 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 11:08:17,253 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 -> c3f647420f42d7fdb333957b618cdd528a4c5a4cecdb35105a1a2630df70b3d6 [2024-11-07 11:08:17,697 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 11:08:17,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 11:08:17,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 11:08:17,711 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 11:08:17,711 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 11:08:17,712 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/29_conditionals_vs.i [2024-11-07 11:08:18,946 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 11:08:19,159 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 11:08:19,160 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/29_conditionals_vs.i [2024-11-07 11:08:19,168 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/494494f2d/7197cc5c89114c2a839fb8bbc5c627d4/FLAG2b819d35a [2024-11-07 11:08:19,179 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/494494f2d/7197cc5c89114c2a839fb8bbc5c627d4 [2024-11-07 11:08:19,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 11:08:19,183 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 11:08:19,184 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 11:08:19,184 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 11:08:19,187 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 11:08:19,187 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:08:19" (1/1) ... [2024-11-07 11:08:19,188 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16c21ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:08:19, skipping insertion in model container [2024-11-07 11:08:19,188 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:08:19" (1/1) ... [2024-11-07 11:08:19,210 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 11:08:19,432 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/pthread-ext/29_conditionals_vs.i[30422,30435] [2024-11-07 11:08:19,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:08:19,454 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 11:08:19,495 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/pthread-ext/29_conditionals_vs.i[30422,30435] [2024-11-07 11:08:19,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:08:19,558 INFO L204 MainTranslator]: Completed translation [2024-11-07 11:08:19,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:08:19 WrapperNode [2024-11-07 11:08:19,563 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 11:08:19,564 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 11:08:19,564 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 11:08:19,564 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 11:08:19,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:08:19" (1/1) ... [2024-11-07 11:08:19,580 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:08:19" (1/1) ... [2024-11-07 11:08:19,594 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 58 [2024-11-07 11:08:19,596 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 11:08:19,597 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 11:08:19,597 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 11:08:19,597 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 11:08:19,602 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:08:19" (1/1) ... [2024-11-07 11:08:19,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:08:19" (1/1) ... [2024-11-07 11:08:19,604 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:08:19" (1/1) ... [2024-11-07 11:08:19,617 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 11:08:19,618 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:08:19" (1/1) ... [2024-11-07 11:08:19,618 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:08:19" (1/1) ... [2024-11-07 11:08:19,621 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:08:19" (1/1) ... [2024-11-07 11:08:19,627 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:08:19" (1/1) ... [2024-11-07 11:08:19,629 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:08:19" (1/1) ... [2024-11-07 11:08:19,629 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:08:19" (1/1) ... [2024-11-07 11:08:19,630 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 11:08:19,635 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 11:08:19,635 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 11:08:19,635 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 11:08:19,636 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:08:19" (1/1) ... [2024-11-07 11:08:19,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:08:19,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:08:19,684 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 11:08:19,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 11:08:19,729 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-07 11:08:19,729 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-07 11:08:19,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 11:08:19,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 11:08:19,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 11:08:19,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 11:08:19,730 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-07 11:08:19,896 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 11:08:19,898 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 11:08:19,993 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 11:08:19,994 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 11:08:20,049 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 11:08:20,049 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 11:08:20,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:08:20 BoogieIcfgContainer [2024-11-07 11:08:20,050 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 11:08:20,052 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 11:08:20,052 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 11:08:20,055 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 11:08:20,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 11:08:19" (1/3) ... [2024-11-07 11:08:20,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b286cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:08:20, skipping insertion in model container [2024-11-07 11:08:20,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:08:19" (2/3) ... [2024-11-07 11:08:20,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b286cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:08:20, skipping insertion in model container [2024-11-07 11:08:20,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:08:20" (3/3) ... [2024-11-07 11:08:20,057 INFO L112 eAbstractionObserver]: Analyzing ICFG 29_conditionals_vs.i [2024-11-07 11:08:20,067 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 11:08:20,067 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 11:08:20,068 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 11:08:20,094 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 11:08:20,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 19 transitions, 42 flow [2024-11-07 11:08:20,149 INFO L124 PetriNetUnfolderBase]: 3/21 cut-off events. [2024-11-07 11:08:20,159 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 11:08:20,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 21 events. 3/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 16. Up to 3 conditions per place. [2024-11-07 11:08:20,165 INFO L82 GeneralOperation]: Start removeDead. Operand has 19 places, 19 transitions, 42 flow [2024-11-07 11:08:20,171 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 19 transitions, 42 flow [2024-11-07 11:08:20,197 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 11:08:20,227 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;@4e3f5ce8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 11:08:20,228 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-07 11:08:20,235 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 11:08:20,236 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-11-07 11:08:20,236 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 11:08:20,236 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:08:20,237 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2024-11-07 11:08:20,238 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:08:20,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:08:20,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1558504319, now seen corresponding path program 1 times [2024-11-07 11:08:20,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:08:20,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803092647] [2024-11-07 11:08:20,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:08:20,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:08:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 11:08:20,352 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 11:08:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 11:08:20,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 11:08:20,376 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 11:08:20,376 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-11-07 11:08:20,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-11-07 11:08:20,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-11-07 11:08:20,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 11:08:20,378 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-07 11:08:20,380 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-07 11:08:20,380 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-07 11:08:20,395 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 11:08:20,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 33 transitions, 76 flow [2024-11-07 11:08:20,404 INFO L124 PetriNetUnfolderBase]: 6/38 cut-off events. [2024-11-07 11:08:20,404 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-07 11:08:20,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 38 events. 6/38 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 29. Up to 3 conditions per place. [2024-11-07 11:08:20,405 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 33 transitions, 76 flow [2024-11-07 11:08:20,405 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 33 transitions, 76 flow [2024-11-07 11:08:20,406 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 11:08:20,406 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;@4e3f5ce8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 11:08:20,406 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-07 11:08:20,416 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 11:08:20,416 INFO L124 PetriNetUnfolderBase]: 3/24 cut-off events. [2024-11-07 11:08:20,416 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-07 11:08:20,416 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:08:20,416 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2024-11-07 11:08:20,416 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 11:08:20,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:08:20,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1819771659, now seen corresponding path program 1 times [2024-11-07 11:08:20,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:08:20,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210911983] [2024-11-07 11:08:20,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:08:20,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:08:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 11:08:20,438 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 11:08:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 11:08:20,446 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 11:08:20,446 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 11:08:20,447 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-11-07 11:08:20,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-11-07 11:08:20,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-11-07 11:08:20,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-11-07 11:08:20,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 11:08:20,447 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-07 11:08:20,448 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-07 11:08:20,448 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-07 11:08:20,472 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 11:08:20,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 47 transitions, 112 flow [2024-11-07 11:08:20,485 INFO L124 PetriNetUnfolderBase]: 9/55 cut-off events. [2024-11-07 11:08:20,485 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-07 11:08:20,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 55 events. 9/55 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 125 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 45. Up to 4 conditions per place. [2024-11-07 11:08:20,486 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 47 transitions, 112 flow [2024-11-07 11:08:20,489 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 47 transitions, 112 flow [2024-11-07 11:08:20,491 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 11:08:20,492 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;@4e3f5ce8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 11:08:20,492 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-07 11:08:20,499 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 11:08:20,500 INFO L124 PetriNetUnfolderBase]: 3/25 cut-off events. [2024-11-07 11:08:20,500 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-07 11:08:20,500 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:08:20,500 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:08:20,500 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-07 11:08:20,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:08:20,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1846680817, now seen corresponding path program 1 times [2024-11-07 11:08:20,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:08:20,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826420813] [2024-11-07 11:08:20,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:08:20,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:08:20,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:08:20,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:08:20,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:08:20,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826420813] [2024-11-07 11:08:20,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826420813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:08:20,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:08:20,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:08:20,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139621303] [2024-11-07 11:08:20,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:08:20,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:08:20,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:08:20,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:08:20,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:08:20,680 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2024-11-07 11:08:20,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 47 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:08:20,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:08:20,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2024-11-07 11:08:20,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:08:21,385 INFO L124 PetriNetUnfolderBase]: 3454/5586 cut-off events. [2024-11-07 11:08:21,385 INFO L125 PetriNetUnfolderBase]: For 484/484 co-relation queries the response was YES. [2024-11-07 11:08:21,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10795 conditions, 5586 events. 3454/5586 cut-off events. For 484/484 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 34813 event pairs, 736 based on Foata normal form. 564/5799 useless extension candidates. Maximal degree in co-relation 4764. Up to 2085 conditions per place. [2024-11-07 11:08:21,426 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 52 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2024-11-07 11:08:21,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 72 transitions, 296 flow [2024-11-07 11:08:21,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:08:21,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 11:08:21,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2024-11-07 11:08:21,435 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7127659574468085 [2024-11-07 11:08:21,435 INFO L175 Difference]: Start difference. First operand has 45 places, 47 transitions, 112 flow. Second operand 4 states and 134 transitions. [2024-11-07 11:08:21,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 72 transitions, 296 flow [2024-11-07 11:08:21,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 72 transitions, 290 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-11-07 11:08:21,441 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 106 flow [2024-11-07 11:08:21,442 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2024-11-07 11:08:21,445 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2024-11-07 11:08:21,445 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 106 flow [2024-11-07 11:08:21,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:08:21,445 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:08:21,445 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:08:21,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 11:08:21,446 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-07 11:08:21,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:08:21,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1846679794, now seen corresponding path program 1 times [2024-11-07 11:08:21,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:08:21,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614331490] [2024-11-07 11:08:21,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:08:21,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:08:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:08:21,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:08:21,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:08:21,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614331490] [2024-11-07 11:08:21,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614331490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:08:21,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:08:21,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:08:21,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848593571] [2024-11-07 11:08:21,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:08:21,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:08:21,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:08:21,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:08:21,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:08:21,504 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 47 [2024-11-07 11:08:21,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:08:21,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:08:21,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 47 [2024-11-07 11:08:21,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:08:21,897 INFO L124 PetriNetUnfolderBase]: 3454/5328 cut-off events. [2024-11-07 11:08:21,898 INFO L125 PetriNetUnfolderBase]: For 397/397 co-relation queries the response was YES. [2024-11-07 11:08:21,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10724 conditions, 5328 events. 3454/5328 cut-off events. For 397/397 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 30938 event pairs, 736 based on Foata normal form. 129/5214 useless extension candidates. Maximal degree in co-relation 8547. Up to 2085 conditions per place. [2024-11-07 11:08:21,973 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 53 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2024-11-07 11:08:21,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 70 transitions, 290 flow [2024-11-07 11:08:21,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:08:21,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 11:08:21,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2024-11-07 11:08:21,975 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6382978723404256 [2024-11-07 11:08:21,975 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 106 flow. Second operand 4 states and 120 transitions. [2024-11-07 11:08:21,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 70 transitions, 290 flow [2024-11-07 11:08:21,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 287 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 11:08:21,981 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 101 flow [2024-11-07 11:08:21,981 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2024-11-07 11:08:21,982 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2024-11-07 11:08:21,982 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 101 flow [2024-11-07 11:08:21,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:08:21,982 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:08:21,982 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2024-11-07 11:08:21,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 11:08:21,983 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-07 11:08:21,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:08:21,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1817396894, now seen corresponding path program 1 times [2024-11-07 11:08:21,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:08:21,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565794274] [2024-11-07 11:08:21,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:08:21,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:08:21,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 11:08:21,992 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 11:08:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 11:08:21,999 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 11:08:21,999 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 11:08:21,999 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-11-07 11:08:22,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-11-07 11:08:22,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-11-07 11:08:22,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-11-07 11:08:22,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-11-07 11:08:22,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 11:08:22,000 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-07 11:08:22,001 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-07 11:08:22,001 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-07 11:08:22,025 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 11:08:22,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 61 transitions, 150 flow [2024-11-07 11:08:22,032 INFO L124 PetriNetUnfolderBase]: 12/72 cut-off events. [2024-11-07 11:08:22,032 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-07 11:08:22,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 72 events. 12/72 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 175 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 67. Up to 5 conditions per place. [2024-11-07 11:08:22,033 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 61 transitions, 150 flow [2024-11-07 11:08:22,033 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 61 transitions, 150 flow [2024-11-07 11:08:22,034 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 11:08:22,034 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;@4e3f5ce8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 11:08:22,034 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-07 11:08:22,037 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 11:08:22,037 INFO L124 PetriNetUnfolderBase]: 3/25 cut-off events. [2024-11-07 11:08:22,037 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-07 11:08:22,037 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:08:22,037 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:08:22,037 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 11:08:22,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:08:22,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1944933369, now seen corresponding path program 1 times [2024-11-07 11:08:22,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:08:22,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584468270] [2024-11-07 11:08:22,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:08:22,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:08:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:08:22,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:08:22,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:08:22,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584468270] [2024-11-07 11:08:22,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584468270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:08:22,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:08:22,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:08:22,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500649069] [2024-11-07 11:08:22,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:08:22,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:08:22,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:08:22,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:08:22,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:08:22,116 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 61 [2024-11-07 11:08:22,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 61 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:08:22,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:08:22,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 61 [2024-11-07 11:08:22,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:08:24,689 INFO L124 PetriNetUnfolderBase]: 28492/41307 cut-off events. [2024-11-07 11:08:24,689 INFO L125 PetriNetUnfolderBase]: For 5011/5011 co-relation queries the response was YES. [2024-11-07 11:08:24,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80861 conditions, 41307 events. 28492/41307 cut-off events. For 5011/5011 co-relation queries the response was YES. Maximal size of possible extension queue 1557. Compared 289028 event pairs, 6352 based on Foata normal form. 4892/44047 useless extension candidates. Maximal degree in co-relation 10947. Up to 15765 conditions per place. [2024-11-07 11:08:24,946 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 70 selfloop transitions, 3 changer transitions 0/97 dead transitions. [2024-11-07 11:08:24,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 97 transitions, 410 flow [2024-11-07 11:08:24,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:08:24,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 11:08:24,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2024-11-07 11:08:24,950 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-11-07 11:08:24,950 INFO L175 Difference]: Start difference. First operand has 58 places, 61 transitions, 150 flow. Second operand 4 states and 183 transitions. [2024-11-07 11:08:24,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 97 transitions, 410 flow [2024-11-07 11:08:24,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 97 transitions, 392 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-07 11:08:24,956 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 138 flow [2024-11-07 11:08:24,956 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2024-11-07 11:08:24,957 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 2 predicate places. [2024-11-07 11:08:24,957 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 138 flow [2024-11-07 11:08:24,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:08:24,957 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:08:24,957 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:08:24,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 11:08:24,958 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 11:08:24,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:08:24,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1944934392, now seen corresponding path program 1 times [2024-11-07 11:08:24,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:08:24,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306461404] [2024-11-07 11:08:24,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:08:24,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:08:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:08:24,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:08:24,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:08:24,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306461404] [2024-11-07 11:08:24,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306461404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:08:24,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:08:24,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:08:24,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803343133] [2024-11-07 11:08:24,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:08:24,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:08:24,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:08:24,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:08:24,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:08:25,002 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-07 11:08:25,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:08:25,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:08:25,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-07 11:08:25,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:08:27,001 INFO L124 PetriNetUnfolderBase]: 28492/39753 cut-off events. [2024-11-07 11:08:27,001 INFO L125 PetriNetUnfolderBase]: For 2566/2566 co-relation queries the response was YES. [2024-11-07 11:08:27,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79926 conditions, 39753 events. 28492/39753 cut-off events. For 2566/2566 co-relation queries the response was YES. Maximal size of possible extension queue 1427. Compared 258098 event pairs, 6352 based on Foata normal form. 777/39029 useless extension candidates. Maximal degree in co-relation 65082. Up to 15765 conditions per place. [2024-11-07 11:08:27,387 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 71 selfloop transitions, 2 changer transitions 0/95 dead transitions. [2024-11-07 11:08:27,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 95 transitions, 392 flow [2024-11-07 11:08:27,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:08:27,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 11:08:27,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2024-11-07 11:08:27,389 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.680327868852459 [2024-11-07 11:08:27,389 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 138 flow. Second operand 4 states and 166 transitions. [2024-11-07 11:08:27,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 95 transitions, 392 flow [2024-11-07 11:08:27,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 95 transitions, 389 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 11:08:27,397 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 133 flow [2024-11-07 11:08:27,397 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2024-11-07 11:08:27,397 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 1 predicate places. [2024-11-07 11:08:27,398 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 133 flow [2024-11-07 11:08:27,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:08:27,398 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:08:27,398 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:08:27,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 11:08:27,398 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 11:08:27,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:08:27,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1946095303, now seen corresponding path program 1 times [2024-11-07 11:08:27,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:08:27,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359830764] [2024-11-07 11:08:27,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:08:27,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:08:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:08:27,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 11:08:27,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:08:27,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359830764] [2024-11-07 11:08:27,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359830764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:08:27,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:08:27,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:08:27,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312510479] [2024-11-07 11:08:27,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:08:27,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:08:27,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:08:27,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:08:27,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:08:27,461 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 61 [2024-11-07 11:08:27,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:08:27,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:08:27,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 61 [2024-11-07 11:08:27,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:08:30,151 INFO L124 PetriNetUnfolderBase]: 38482/55572 cut-off events. [2024-11-07 11:08:30,152 INFO L125 PetriNetUnfolderBase]: For 3976/3976 co-relation queries the response was YES. [2024-11-07 11:08:30,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109068 conditions, 55572 events. 38482/55572 cut-off events. For 3976/3976 co-relation queries the response was YES. Maximal size of possible extension queue 2215. Compared 402472 event pairs, 8611 based on Foata normal form. 0/51210 useless extension candidates. Maximal degree in co-relation 81252. Up to 21195 conditions per place. [2024-11-07 11:08:30,711 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 68 selfloop transitions, 3 changer transitions 0/92 dead transitions. [2024-11-07 11:08:30,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 92 transitions, 377 flow [2024-11-07 11:08:30,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:08:30,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 11:08:30,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2024-11-07 11:08:30,714 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6885245901639344 [2024-11-07 11:08:30,714 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 133 flow. Second operand 4 states and 168 transitions. [2024-11-07 11:08:30,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 92 transitions, 377 flow [2024-11-07 11:08:30,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 92 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 11:08:30,722 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 134 flow [2024-11-07 11:08:30,722 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2024-11-07 11:08:30,723 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 2 predicate places. [2024-11-07 11:08:30,723 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 134 flow [2024-11-07 11:08:30,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:08:30,723 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:08:30,723 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:08:30,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 11:08:30,724 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 11:08:30,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:08:30,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1946096326, now seen corresponding path program 1 times [2024-11-07 11:08:30,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:08:30,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644184305] [2024-11-07 11:08:30,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:08:30,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:08:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:08:30,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 11:08:30,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:08:30,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644184305] [2024-11-07 11:08:30,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644184305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:08:30,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:08:30,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:08:30,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338279883] [2024-11-07 11:08:30,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:08:30,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:08:30,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:08:30,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:08:30,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:08:30,775 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-07 11:08:30,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:08:30,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:08:30,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-07 11:08:30,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:08:33,356 INFO L124 PetriNetUnfolderBase]: 38482/53508 cut-off events. [2024-11-07 11:08:33,356 INFO L125 PetriNetUnfolderBase]: For 3442/3442 co-relation queries the response was YES. [2024-11-07 11:08:33,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107517 conditions, 53508 events. 38482/53508 cut-off events. For 3442/3442 co-relation queries the response was YES. Maximal size of possible extension queue 2042. Compared 360808 event pairs, 8611 based on Foata normal form. 1032/51036 useless extension candidates. Maximal degree in co-relation 79704. Up to 21195 conditions per place. [2024-11-07 11:08:33,704 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 69 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2024-11-07 11:08:33,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 90 transitions, 370 flow [2024-11-07 11:08:33,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:08:33,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 11:08:33,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 164 transitions. [2024-11-07 11:08:33,715 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6721311475409836 [2024-11-07 11:08:33,716 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 134 flow. Second operand 4 states and 164 transitions. [2024-11-07 11:08:33,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 90 transitions, 370 flow [2024-11-07 11:08:33,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 90 transitions, 367 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 11:08:33,734 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 129 flow [2024-11-07 11:08:33,735 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2024-11-07 11:08:33,737 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 1 predicate places. [2024-11-07 11:08:33,737 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 129 flow [2024-11-07 11:08:33,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:08:33,741 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:08:33,741 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2024-11-07 11:08:33,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 11:08:33,741 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 11:08:33,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:08:33,742 INFO L85 PathProgramCache]: Analyzing trace with hash -736863984, now seen corresponding path program 1 times [2024-11-07 11:08:33,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:08:33,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666343906] [2024-11-07 11:08:33,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:08:33,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:08:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 11:08:33,765 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 11:08:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 11:08:33,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 11:08:33,802 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 11:08:33,802 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-11-07 11:08:33,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-11-07 11:08:33,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2024-11-07 11:08:33,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-11-07 11:08:33,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-11-07 11:08:33,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-07 11:08:33,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 11:08:33,803 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-07 11:08:33,803 WARN L244 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-07 11:08:33,803 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-11-07 11:08:33,843 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 11:08:33,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 75 transitions, 190 flow [2024-11-07 11:08:33,858 INFO L124 PetriNetUnfolderBase]: 15/89 cut-off events. [2024-11-07 11:08:33,858 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-11-07 11:08:33,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 89 events. 15/89 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 235 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 90. Up to 6 conditions per place. [2024-11-07 11:08:33,859 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 75 transitions, 190 flow [2024-11-07 11:08:33,860 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 75 transitions, 190 flow [2024-11-07 11:08:33,860 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 11:08:33,861 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;@4e3f5ce8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 11:08:33,861 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-07 11:08:33,865 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 11:08:33,868 INFO L124 PetriNetUnfolderBase]: 3/25 cut-off events. [2024-11-07 11:08:33,868 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-07 11:08:33,868 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:08:33,868 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:08:33,869 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 11:08:33,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:08:33,869 INFO L85 PathProgramCache]: Analyzing trace with hash -278289359, now seen corresponding path program 1 times [2024-11-07 11:08:33,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:08:33,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732043564] [2024-11-07 11:08:33,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:08:33,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:08:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:08:33,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:08:33,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:08:33,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732043564] [2024-11-07 11:08:33,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732043564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:08:33,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:08:33,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:08:33,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248464705] [2024-11-07 11:08:33,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:08:33,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:08:33,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:08:33,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:08:33,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:08:34,000 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 75 [2024-11-07 11:08:34,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 75 transitions, 190 flow. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:08:34,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:08:34,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 75 [2024-11-07 11:08:34,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:08:50,956 INFO L124 PetriNetUnfolderBase]: 217600/294522 cut-off events. [2024-11-07 11:08:50,956 INFO L125 PetriNetUnfolderBase]: For 46094/46094 co-relation queries the response was YES. [2024-11-07 11:08:51,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 581613 conditions, 294522 events. 217600/294522 cut-off events. For 46094/46094 co-relation queries the response was YES. Maximal size of possible extension queue 9086. Compared 2202215 event pairs, 49768 based on Foata normal form. 38646/320220 useless extension candidates. Maximal degree in co-relation 80810. Up to 114045 conditions per place. [2024-11-07 11:08:53,495 INFO L140 encePairwiseOnDemand]: 65/75 looper letters, 88 selfloop transitions, 3 changer transitions 0/122 dead transitions. [2024-11-07 11:08:53,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 122 transitions, 530 flow [2024-11-07 11:08:53,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:08:53,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 11:08:53,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 232 transitions. [2024-11-07 11:08:53,497 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7733333333333333 [2024-11-07 11:08:53,497 INFO L175 Difference]: Start difference. First operand has 71 places, 75 transitions, 190 flow. Second operand 4 states and 232 transitions. [2024-11-07 11:08:53,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 122 transitions, 530 flow [2024-11-07 11:08:53,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 122 transitions, 494 flow, removed 18 selfloop flow, removed 0 redundant places. [2024-11-07 11:08:53,514 INFO L231 Difference]: Finished difference. Result has 73 places, 68 transitions, 170 flow [2024-11-07 11:08:53,514 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=73, PETRI_TRANSITIONS=68} [2024-11-07 11:08:53,514 INFO L277 CegarLoopForPetriNet]: 71 programPoint places, 2 predicate places. [2024-11-07 11:08:53,514 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 68 transitions, 170 flow [2024-11-07 11:08:53,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:08:53,514 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:08:53,514 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:08:53,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 11:08:53,515 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 11:08:53,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:08:53,515 INFO L85 PathProgramCache]: Analyzing trace with hash -278288336, now seen corresponding path program 1 times [2024-11-07 11:08:53,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:08:53,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28920804] [2024-11-07 11:08:53,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:08:53,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:08:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:08:53,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 11:08:53,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:08:53,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28920804] [2024-11-07 11:08:53,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28920804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:08:53,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:08:53,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:08:53,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686418855] [2024-11-07 11:08:53,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:08:53,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:08:53,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:08:53,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:08:53,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:08:53,551 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 75 [2024-11-07 11:08:53,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 68 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:08:53,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:08:53,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 75 [2024-11-07 11:08:53,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand