./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-complex/safestack_relacy.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-complex/safestack_relacy.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 516fee84c55ddb7fa4275a43ad5a2da6ea994abf63bbbbd8ed5c82108d65f7b0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:20:54,147 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:20:54,256 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 10:20:54,263 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:20:54,264 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:20:54,310 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:20:54,310 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:20:54,311 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:20:54,311 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:20:54,311 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:20:54,312 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:20:54,312 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:20:54,313 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:20:54,315 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:20:54,315 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:20:54,319 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:20:54,320 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:20:54,320 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:20:54,320 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:20:54,320 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:20:54,320 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:20:54,324 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:20:54,325 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:20:54,325 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:20:54,325 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:20:54,325 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:20:54,325 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:20:54,325 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:20:54,326 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:20:54,326 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:20:54,326 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:20:54,326 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:20:54,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:20:54,327 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:20:54,327 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:20:54,327 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:20:54,327 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:20:54,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:20:54,328 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:20:54,328 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:20:54,333 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:20:54,334 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:20:54,338 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/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 -> 516fee84c55ddb7fa4275a43ad5a2da6ea994abf63bbbbd8ed5c82108d65f7b0 [2024-11-10 10:20:54,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:20:54,726 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:20:54,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:20:54,729 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:20:54,730 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:20:54,730 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-complex/safestack_relacy.i [2024-11-10 10:20:56,032 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:20:56,313 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:20:56,314 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-complex/safestack_relacy.i [2024-11-10 10:20:56,345 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05dba0955/7f0d942dc63a4b15ae4c8bb5b071fb08/FLAGf5dfc274f [2024-11-10 10:20:56,360 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05dba0955/7f0d942dc63a4b15ae4c8bb5b071fb08 [2024-11-10 10:20:56,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:20:56,364 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:20:56,368 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:20:56,368 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:20:56,372 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:20:56,374 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:20:56" (1/1) ... [2024-11-10 10:20:56,374 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d2f888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:56, skipping insertion in model container [2024-11-10 10:20:56,375 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:20:56" (1/1) ... [2024-11-10 10:20:56,512 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:20:57,028 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-complex/safestack_relacy.i[76630,76643] [2024-11-10 10:20:57,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:20:57,041 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:20:57,091 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-complex/safestack_relacy.i[76630,76643] [2024-11-10 10:20:57,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:20:57,163 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:20:57,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:57 WrapperNode [2024-11-10 10:20:57,163 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:20:57,164 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:20:57,164 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:20:57,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:20:57,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:57" (1/1) ... [2024-11-10 10:20:57,189 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:57" (1/1) ... [2024-11-10 10:20:57,224 INFO L138 Inliner]: procedures = 458, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 168 [2024-11-10 10:20:57,225 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:20:57,225 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:20:57,225 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:20:57,225 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:20:57,233 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:57" (1/1) ... [2024-11-10 10:20:57,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:57" (1/1) ... [2024-11-10 10:20:57,239 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:57" (1/1) ... [2024-11-10 10:20:57,258 INFO L175 MemorySlicer]: Split 37 memory accesses to 3 slices as follows [2, 5, 30]. 81 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 3, 8]. The 13 writes are split as follows [0, 1, 12]. [2024-11-10 10:20:57,261 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:57" (1/1) ... [2024-11-10 10:20:57,261 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:57" (1/1) ... [2024-11-10 10:20:57,275 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:57" (1/1) ... [2024-11-10 10:20:57,276 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:57" (1/1) ... [2024-11-10 10:20:57,279 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:57" (1/1) ... [2024-11-10 10:20:57,281 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:57" (1/1) ... [2024-11-10 10:20:57,286 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:20:57,292 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:20:57,292 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:20:57,295 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:20:57,295 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:57" (1/1) ... [2024-11-10 10:20:57,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:20:57,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:20:57,356 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 10:20:57,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 10:20:57,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 10:20:57,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 10:20:57,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 10:20:57,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:20:57,395 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-10 10:20:57,395 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-10 10:20:57,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:20:57,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:20:57,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 10:20:57,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 10:20:57,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 10:20:57,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 10:20:57,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 10:20:57,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 10:20:57,398 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 10:20:57,608 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:20:57,614 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:20:57,807 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 10:20:57,807 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:20:57,942 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:20:57,943 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:20:57,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:20:57 BoogieIcfgContainer [2024-11-10 10:20:57,943 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:20:57,944 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:20:57,944 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:20:57,947 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:20:57,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:20:56" (1/3) ... [2024-11-10 10:20:57,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2415e66e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:20:57, skipping insertion in model container [2024-11-10 10:20:57,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:57" (2/3) ... [2024-11-10 10:20:57,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2415e66e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:20:57, skipping insertion in model container [2024-11-10 10:20:57,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:20:57" (3/3) ... [2024-11-10 10:20:57,953 INFO L112 eAbstractionObserver]: Analyzing ICFG safestack_relacy.i [2024-11-10 10:20:57,981 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:20:57,981 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 10:20:57,981 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 10:20:58,046 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-10 10:20:58,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 74 transitions, 155 flow [2024-11-10 10:20:58,107 INFO L124 PetriNetUnfolderBase]: 18/84 cut-off events. [2024-11-10 10:20:58,107 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 10:20:58,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 84 events. 18/84 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 166 event pairs, 0 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 58. Up to 4 conditions per place. [2024-11-10 10:20:58,111 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 74 transitions, 155 flow [2024-11-10 10:20:58,115 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 72 transitions, 148 flow [2024-11-10 10:20:58,125 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:20:58,130 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;@2ab41273, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:20:58,132 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-10 10:20:58,139 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:20:58,141 INFO L124 PetriNetUnfolderBase]: 6/35 cut-off events. [2024-11-10 10:20:58,141 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:20:58,141 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:58,142 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:20:58,143 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadErr0ASSERT_VIOLATIONERROR_FUNCTION, threadErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:20:58,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:58,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1665222419, now seen corresponding path program 1 times [2024-11-10 10:20:58,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:58,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644528310] [2024-11-10 10:20:58,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:58,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:58,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:58,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 10:20:58,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:58,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644528310] [2024-11-10 10:20:58,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644528310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:58,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:58,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:20:58,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201500671] [2024-11-10 10:20:58,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:58,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:20:58,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:58,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:20:58,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:20:58,483 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 74 [2024-11-10 10:20:58,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 72 transitions, 148 flow. Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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-10 10:20:58,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:58,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 74 [2024-11-10 10:20:58,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:58,638 INFO L124 PetriNetUnfolderBase]: 143/352 cut-off events. [2024-11-10 10:20:58,639 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:20:58,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 352 events. 143/352 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1890 event pairs, 112 based on Foata normal form. 80/400 useless extension candidates. Maximal degree in co-relation 607. Up to 288 conditions per place. [2024-11-10 10:20:58,642 INFO L140 encePairwiseOnDemand]: 66/74 looper letters, 44 selfloop transitions, 0 changer transitions 0/64 dead transitions. [2024-11-10 10:20:58,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 64 transitions, 220 flow [2024-11-10 10:20:58,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 10:20:58,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 10:20:58,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 92 transitions. [2024-11-10 10:20:58,654 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6216216216216216 [2024-11-10 10:20:58,656 INFO L175 Difference]: Start difference. First operand has 60 places, 72 transitions, 148 flow. Second operand 2 states and 92 transitions. [2024-11-10 10:20:58,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 64 transitions, 220 flow [2024-11-10 10:20:58,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 64 transitions, 220 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:20:58,663 INFO L231 Difference]: Finished difference. Result has 61 places, 64 transitions, 132 flow [2024-11-10 10:20:58,665 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=132, PETRI_PLACES=61, PETRI_TRANSITIONS=64} [2024-11-10 10:20:58,669 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 1 predicate places. [2024-11-10 10:20:58,669 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 64 transitions, 132 flow [2024-11-10 10:20:58,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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-10 10:20:58,670 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:58,670 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:20:58,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:20:58,671 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadErr0ASSERT_VIOLATIONERROR_FUNCTION, threadErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:20:58,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:58,672 INFO L85 PathProgramCache]: Analyzing trace with hash 224500081, now seen corresponding path program 1 times [2024-11-10 10:20:58,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:58,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747460495] [2024-11-10 10:20:58,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:58,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:58,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 10:20:58,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:58,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747460495] [2024-11-10 10:20:58,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747460495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:58,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:58,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:20:58,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615232632] [2024-11-10 10:20:58,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:58,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:20:58,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:58,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:20:58,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:20:58,857 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 74 [2024-11-10 10:20:58,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 64 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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-10 10:20:58,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:58,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 74 [2024-11-10 10:20:58,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:58,992 INFO L124 PetriNetUnfolderBase]: 143/356 cut-off events. [2024-11-10 10:20:58,992 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:20:58,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 653 conditions, 356 events. 143/356 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1900 event pairs, 112 based on Foata normal form. 1/326 useless extension candidates. Maximal degree in co-relation 649. Up to 282 conditions per place. [2024-11-10 10:20:58,998 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 44 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2024-11-10 10:20:58,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 66 transitions, 232 flow [2024-11-10 10:20:58,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:20:58,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:20:58,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2024-11-10 10:20:59,001 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.40878378378378377 [2024-11-10 10:20:59,001 INFO L175 Difference]: Start difference. First operand has 61 places, 64 transitions, 132 flow. Second operand 4 states and 121 transitions. [2024-11-10 10:20:59,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 66 transitions, 232 flow [2024-11-10 10:20:59,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 66 transitions, 232 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:20:59,004 INFO L231 Difference]: Finished difference. Result has 65 places, 65 transitions, 148 flow [2024-11-10 10:20:59,004 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=65, PETRI_TRANSITIONS=65} [2024-11-10 10:20:59,005 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 5 predicate places. [2024-11-10 10:20:59,005 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 65 transitions, 148 flow [2024-11-10 10:20:59,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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-10 10:20:59,005 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:59,005 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:20:59,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:20:59,006 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadErr0ASSERT_VIOLATIONERROR_FUNCTION, threadErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:20:59,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:59,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1452824791, now seen corresponding path program 1 times [2024-11-10 10:20:59,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:59,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492803737] [2024-11-10 10:20:59,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:59,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:59,147 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 10:20:59,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:59,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492803737] [2024-11-10 10:20:59,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492803737] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:20:59,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247482104] [2024-11-10 10:20:59,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:59,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:20:59,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:20:59,150 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:20:59,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 10:20:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:59,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 10:20:59,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:20:59,298 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 10:20:59,298 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:20:59,325 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 10:20:59,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247482104] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:20:59,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:20:59,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-10 10:20:59,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259919370] [2024-11-10 10:20:59,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:20:59,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 10:20:59,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:59,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 10:20:59,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-10 10:20:59,337 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 74 [2024-11-10 10:20:59,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 65 transitions, 148 flow. Second operand has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 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-10 10:20:59,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:59,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 74 [2024-11-10 10:20:59,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:59,454 INFO L124 PetriNetUnfolderBase]: 143/360 cut-off events. [2024-11-10 10:20:59,454 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 10:20:59,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 672 conditions, 360 events. 143/360 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1861 event pairs, 112 based on Foata normal form. 1/330 useless extension candidates. Maximal degree in co-relation 666. Up to 282 conditions per place. [2024-11-10 10:20:59,456 INFO L140 encePairwiseOnDemand]: 68/74 looper letters, 46 selfloop transitions, 7 changer transitions 0/70 dead transitions. [2024-11-10 10:20:59,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 266 flow [2024-11-10 10:20:59,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:20:59,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:20:59,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2024-11-10 10:20:59,458 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.35135135135135137 [2024-11-10 10:20:59,458 INFO L175 Difference]: Start difference. First operand has 65 places, 65 transitions, 148 flow. Second operand 6 states and 156 transitions. [2024-11-10 10:20:59,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 266 flow [2024-11-10 10:20:59,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 70 transitions, 260 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:20:59,459 INFO L231 Difference]: Finished difference. Result has 70 places, 67 transitions, 174 flow [2024-11-10 10:20:59,459 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=70, PETRI_TRANSITIONS=67} [2024-11-10 10:20:59,460 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 10 predicate places. [2024-11-10 10:20:59,460 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 67 transitions, 174 flow [2024-11-10 10:20:59,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 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-10 10:20:59,461 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:59,461 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:20:59,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 10:20:59,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:20:59,666 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadErr0ASSERT_VIOLATIONERROR_FUNCTION, threadErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:20:59,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:59,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1644890819, now seen corresponding path program 2 times [2024-11-10 10:20:59,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:59,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873821942] [2024-11-10 10:20:59,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:59,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:59,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:20:59,693 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 10:20:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:20:59,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 10:20:59,722 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 10:20:59,723 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-11-10 10:20:59,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-11-10 10:20:59,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-11-10 10:20:59,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 10:20:59,725 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-10 10:20:59,726 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 10:20:59,726 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-10 10:20:59,758 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 10:20:59,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 123 transitions, 262 flow [2024-11-10 10:20:59,769 INFO L124 PetriNetUnfolderBase]: 34/153 cut-off events. [2024-11-10 10:20:59,770 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-10 10:20:59,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 153 events. 34/153 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 489 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 113. Up to 8 conditions per place. [2024-11-10 10:20:59,771 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 123 transitions, 262 flow [2024-11-10 10:20:59,772 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 123 transitions, 262 flow [2024-11-10 10:20:59,773 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:20:59,774 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;@2ab41273, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:20:59,774 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-10 10:20:59,777 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:20:59,778 INFO L124 PetriNetUnfolderBase]: 11/64 cut-off events. [2024-11-10 10:20:59,778 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 10:20:59,778 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:59,778 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:20:59,779 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadErr0ASSERT_VIOLATIONERROR_FUNCTION, threadErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-10 10:20:59,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:59,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1908933462, now seen corresponding path program 1 times [2024-11-10 10:20:59,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:59,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584027] [2024-11-10 10:20:59,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:59,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:59,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:20:59,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:59,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584027] [2024-11-10 10:20:59,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:59,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:59,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:20:59,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778684513] [2024-11-10 10:20:59,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:59,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:20:59,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:59,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:20:59,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:20:59,811 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 123 [2024-11-10 10:20:59,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 123 transitions, 262 flow. Second operand has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 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-10 10:20:59,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:59,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 123 [2024-11-10 10:20:59,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:21:01,469 INFO L124 PetriNetUnfolderBase]: 9707/15601 cut-off events. [2024-11-10 10:21:01,470 INFO L125 PetriNetUnfolderBase]: For 245/245 co-relation queries the response was YES. [2024-11-10 10:21:01,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30016 conditions, 15601 events. 9707/15601 cut-off events. For 245/245 co-relation queries the response was YES. Maximal size of possible extension queue 745. Compared 121287 event pairs, 8177 based on Foata normal form. 3178/17317 useless extension candidates. Maximal degree in co-relation 25930. Up to 14263 conditions per place. [2024-11-10 10:21:01,564 INFO L140 encePairwiseOnDemand]: 110/123 looper letters, 80 selfloop transitions, 0 changer transitions 0/110 dead transitions. [2024-11-10 10:21:01,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 110 transitions, 396 flow [2024-11-10 10:21:01,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 10:21:01,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 10:21:01,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 153 transitions. [2024-11-10 10:21:01,568 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6219512195121951 [2024-11-10 10:21:01,568 INFO L175 Difference]: Start difference. First operand has 100 places, 123 transitions, 262 flow. Second operand 2 states and 153 transitions. [2024-11-10 10:21:01,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 110 transitions, 396 flow [2024-11-10 10:21:01,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 110 transitions, 396 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:21:01,572 INFO L231 Difference]: Finished difference. Result has 101 places, 110 transitions, 236 flow [2024-11-10 10:21:01,572 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=236, PETRI_PLACES=101, PETRI_TRANSITIONS=110} [2024-11-10 10:21:01,573 INFO L277 CegarLoopForPetriNet]: 100 programPoint places, 1 predicate places. [2024-11-10 10:21:01,574 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 110 transitions, 236 flow [2024-11-10 10:21:01,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 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-10 10:21:01,575 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:21:01,575 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:21:01,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 10:21:01,576 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadErr0ASSERT_VIOLATIONERROR_FUNCTION, threadErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-10 10:21:01,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:21:01,577 INFO L85 PathProgramCache]: Analyzing trace with hash -658749425, now seen corresponding path program 1 times [2024-11-10 10:21:01,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:21:01,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119267127] [2024-11-10 10:21:01,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:21:01,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:21:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:21:01,699 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-10 10:21:01,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:21:01,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119267127] [2024-11-10 10:21:01,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119267127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:21:01,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:21:01,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:21:01,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103725051] [2024-11-10 10:21:01,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:21:01,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:21:01,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:21:01,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:21:01,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:21:01,707 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 123 [2024-11-10 10:21:01,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 110 transitions, 236 flow. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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-10 10:21:01,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:21:01,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 123 [2024-11-10 10:21:01,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:21:03,019 INFO L124 PetriNetUnfolderBase]: 9707/15605 cut-off events. [2024-11-10 10:21:03,019 INFO L125 PetriNetUnfolderBase]: For 245/245 co-relation queries the response was YES. [2024-11-10 10:21:03,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30025 conditions, 15605 events. 9707/15605 cut-off events. For 245/245 co-relation queries the response was YES. Maximal size of possible extension queue 745. Compared 121287 event pairs, 8177 based on Foata normal form. 1/14145 useless extension candidates. Maximal degree in co-relation 30020. Up to 14257 conditions per place. [2024-11-10 10:21:03,104 INFO L140 encePairwiseOnDemand]: 118/123 looper letters, 80 selfloop transitions, 4 changer transitions 0/112 dead transitions. [2024-11-10 10:21:03,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 112 transitions, 408 flow [2024-11-10 10:21:03,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:21:03,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:21:03,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 197 transitions. [2024-11-10 10:21:03,106 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.40040650406504064 [2024-11-10 10:21:03,106 INFO L175 Difference]: Start difference. First operand has 101 places, 110 transitions, 236 flow. Second operand 4 states and 197 transitions. [2024-11-10 10:21:03,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 112 transitions, 408 flow [2024-11-10 10:21:03,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 112 transitions, 408 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:21:03,111 INFO L231 Difference]: Finished difference. Result has 105 places, 111 transitions, 252 flow [2024-11-10 10:21:03,112 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=252, PETRI_PLACES=105, PETRI_TRANSITIONS=111} [2024-11-10 10:21:03,113 INFO L277 CegarLoopForPetriNet]: 100 programPoint places, 5 predicate places. [2024-11-10 10:21:03,113 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 111 transitions, 252 flow [2024-11-10 10:21:03,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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-10 10:21:03,113 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:21:03,114 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:21:03,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 10:21:03,114 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadErr0ASSERT_VIOLATIONERROR_FUNCTION, threadErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-10 10:21:03,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:21:03,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1066523211, now seen corresponding path program 1 times [2024-11-10 10:21:03,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:21:03,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474739232] [2024-11-10 10:21:03,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:21:03,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:21:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:21:03,233 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-10 10:21:03,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:21:03,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474739232] [2024-11-10 10:21:03,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474739232] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:21:03,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867848850] [2024-11-10 10:21:03,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:21:03,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:21:03,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:21:03,236 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:21:03,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 10:21:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:21:03,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 10:21:03,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:21:03,378 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-10 10:21:03,379 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:21:03,407 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-10 10:21:03,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867848850] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:21:03,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:21:03,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-10 10:21:03,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462272059] [2024-11-10 10:21:03,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:21:03,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 10:21:03,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:21:03,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 10:21:03,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-10 10:21:03,411 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 123 [2024-11-10 10:21:03,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 111 transitions, 252 flow. Second operand has 8 states, 8 states have (on average 29.875) internal successors, (239), 8 states have internal predecessors, (239), 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-10 10:21:03,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:21:03,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 123 [2024-11-10 10:21:03,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:21:04,620 INFO L124 PetriNetUnfolderBase]: 9707/15609 cut-off events. [2024-11-10 10:21:04,621 INFO L125 PetriNetUnfolderBase]: For 248/248 co-relation queries the response was YES. [2024-11-10 10:21:04,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30044 conditions, 15609 events. 9707/15609 cut-off events. For 248/248 co-relation queries the response was YES. Maximal size of possible extension queue 745. Compared 120986 event pairs, 8177 based on Foata normal form. 1/14149 useless extension candidates. Maximal degree in co-relation 30037. Up to 14257 conditions per place. [2024-11-10 10:21:04,861 INFO L140 encePairwiseOnDemand]: 117/123 looper letters, 82 selfloop transitions, 7 changer transitions 0/116 dead transitions. [2024-11-10 10:21:04,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 116 transitions, 442 flow [2024-11-10 10:21:04,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:21:04,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:21:04,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 252 transitions. [2024-11-10 10:21:04,863 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.34146341463414637 [2024-11-10 10:21:04,863 INFO L175 Difference]: Start difference. First operand has 105 places, 111 transitions, 252 flow. Second operand 6 states and 252 transitions. [2024-11-10 10:21:04,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 116 transitions, 442 flow [2024-11-10 10:21:04,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 116 transitions, 436 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:21:04,865 INFO L231 Difference]: Finished difference. Result has 110 places, 113 transitions, 278 flow [2024-11-10 10:21:04,865 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=278, PETRI_PLACES=110, PETRI_TRANSITIONS=113} [2024-11-10 10:21:04,866 INFO L277 CegarLoopForPetriNet]: 100 programPoint places, 10 predicate places. [2024-11-10 10:21:04,866 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 113 transitions, 278 flow [2024-11-10 10:21:04,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.875) internal successors, (239), 8 states have internal predecessors, (239), 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-10 10:21:04,866 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:21:04,866 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:21:04,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 10:21:05,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-10 10:21:05,070 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadErr0ASSERT_VIOLATIONERROR_FUNCTION, threadErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-10 10:21:05,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:21:05,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1693663141, now seen corresponding path program 2 times [2024-11-10 10:21:05,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:21:05,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774488251] [2024-11-10 10:21:05,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:21:05,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:21:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:21:05,101 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 10:21:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:21:05,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 10:21:05,135 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 10:21:05,139 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-11-10 10:21:05,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-11-10 10:21:05,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-11-10 10:21:05,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-11-10 10:21:05,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 10:21:05,140 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-10 10:21:05,140 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 10:21:05,141 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-10 10:21:05,203 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-10 10:21:05,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 172 transitions, 371 flow [2024-11-10 10:21:05,244 INFO L124 PetriNetUnfolderBase]: 55/239 cut-off events. [2024-11-10 10:21:05,244 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-10 10:21:05,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 239 events. 55/239 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 926 event pairs, 1 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 178. Up to 16 conditions per place. [2024-11-10 10:21:05,247 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 172 transitions, 371 flow [2024-11-10 10:21:05,251 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 172 transitions, 371 flow [2024-11-10 10:21:05,252 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:21:05,253 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;@2ab41273, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:21:05,253 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-10 10:21:05,258 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:21:05,264 INFO L124 PetriNetUnfolderBase]: 11/60 cut-off events. [2024-11-10 10:21:05,264 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 10:21:05,264 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:21:05,265 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:21:05,265 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadErr0ASSERT_VIOLATIONERROR_FUNCTION, threadErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-10 10:21:05,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:21:05,265 INFO L85 PathProgramCache]: Analyzing trace with hash 815573521, now seen corresponding path program 1 times [2024-11-10 10:21:05,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:21:05,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546048842] [2024-11-10 10:21:05,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:21:05,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:21:05,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:21:05,312 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-10 10:21:05,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:21:05,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546048842] [2024-11-10 10:21:05,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546048842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:21:05,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:21:05,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:21:05,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528237881] [2024-11-10 10:21:05,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:21:05,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:21:05,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:21:05,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:21:05,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:21:05,313 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 172 [2024-11-10 10:21:05,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 172 transitions, 371 flow. Second operand has 2 states, 2 states have (on average 46.5) internal successors, (93), 2 states have internal predecessors, (93), 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-10 10:21:05,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:21:05,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 172 [2024-11-10 10:21:05,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand