./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-theta/exponential-64.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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-theta/exponential-64.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 c5877a70884380b10e463fa3cfc6b55a5014f8a8b2ecd81a270409b479a9f5bc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:57:28,195 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:57:28,260 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:57:28,269 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:57:28,271 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:57:28,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:57:28,304 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:57:28,304 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:57:28,305 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:57:28,309 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:57:28,309 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:57:28,309 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:57:28,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:57:28,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:57:28,310 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:57:28,311 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:57:28,311 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:57:28,311 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:57:28,311 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:57:28,312 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:57:28,312 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:57:28,313 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:57:28,313 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:57:28,313 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:57:28,313 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:57:28,314 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:57:28,314 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:57:28,314 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:57:28,315 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:57:28,315 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:57:28,315 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:57:28,316 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:57:28,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:57:28,316 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:57:28,317 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:57:28,317 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:57:28,317 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:57:28,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:57:28,318 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:57:28,318 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:57:28,318 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:57:28,319 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:57:28,319 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 -> c5877a70884380b10e463fa3cfc6b55a5014f8a8b2ecd81a270409b479a9f5bc [2024-11-19 01:57:28,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:57:28,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:57:28,637 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:57:28,638 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:57:28,639 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:57:28,640 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/exponential-64.i [2024-11-19 01:57:30,140 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:57:30,394 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:57:30,394 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/exponential-64.i [2024-11-19 01:57:30,417 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/638abe515/c4486c8d33374b15b62550cdd6fc9767/FLAG5723b58a2 [2024-11-19 01:57:30,432 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/638abe515/c4486c8d33374b15b62550cdd6fc9767 [2024-11-19 01:57:30,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:57:30,437 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:57:30,440 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:57:30,441 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:57:30,447 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:57:30,448 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:57:30" (1/1) ... [2024-11-19 01:57:30,451 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@337e513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:57:30, skipping insertion in model container [2024-11-19 01:57:30,451 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:57:30" (1/1) ... [2024-11-19 01:57:30,497 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:57:30,879 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-theta/exponential-64.i[33030,33043] [2024-11-19 01:57:30,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:57:30,911 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:57:30,953 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-theta/exponential-64.i[33030,33043] [2024-11-19 01:57:30,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:57:31,019 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:57:31,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:57:31 WrapperNode [2024-11-19 01:57:31,020 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:57:31,021 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:57:31,021 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:57:31,021 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:57:31,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:57:31" (1/1) ... [2024-11-19 01:57:31,048 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:57:31" (1/1) ... [2024-11-19 01:57:31,074 INFO L138 Inliner]: procedures = 169, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2024-11-19 01:57:31,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:57:31,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:57:31,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:57:31,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:57:31,087 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:57:31" (1/1) ... [2024-11-19 01:57:31,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:57:31" (1/1) ... [2024-11-19 01:57:31,092 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:57:31" (1/1) ... [2024-11-19 01:57:31,116 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-19 01:57:31,117 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:57:31" (1/1) ... [2024-11-19 01:57:31,118 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:57:31" (1/1) ... [2024-11-19 01:57:31,126 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:57:31" (1/1) ... [2024-11-19 01:57:31,130 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:57:31" (1/1) ... [2024-11-19 01:57:31,136 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:57:31" (1/1) ... [2024-11-19 01:57:31,141 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:57:31" (1/1) ... [2024-11-19 01:57:31,144 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:57:31,145 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:57:31,146 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:57:31,146 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:57:31,147 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:57:31" (1/1) ... [2024-11-19 01:57:31,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:57:31,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:57:31,186 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-19 01:57:31,191 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-19 01:57:31,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:57:31,245 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-19 01:57:31,245 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-19 01:57:31,245 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-19 01:57:31,245 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-19 01:57:31,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 01:57:31,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:57:31,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:57:31,247 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 01:57:31,371 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:57:31,374 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:57:31,571 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 01:57:31,571 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:57:31,664 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:57:31,665 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 01:57:31,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:57:31 BoogieIcfgContainer [2024-11-19 01:57:31,665 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:57:31,667 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:57:31,668 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:57:31,672 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:57:31,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:57:30" (1/3) ... [2024-11-19 01:57:31,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b1613b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:57:31, skipping insertion in model container [2024-11-19 01:57:31,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:57:31" (2/3) ... [2024-11-19 01:57:31,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b1613b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:57:31, skipping insertion in model container [2024-11-19 01:57:31,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:57:31" (3/3) ... [2024-11-19 01:57:31,675 INFO L112 eAbstractionObserver]: Analyzing ICFG exponential-64.i [2024-11-19 01:57:31,690 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:57:31,690 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:57:31,690 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 01:57:31,742 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 01:57:31,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 22 transitions, 52 flow [2024-11-19 01:57:31,812 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2024-11-19 01:57:31,816 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 01:57:31,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 30 events. 4/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 49 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 20. Up to 4 conditions per place. [2024-11-19 01:57:31,821 INFO L82 GeneralOperation]: Start removeDead. Operand has 26 places, 22 transitions, 52 flow [2024-11-19 01:57:31,823 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 18 transitions, 43 flow [2024-11-19 01:57:31,832 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:57:31,838 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;@1c7e6d77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:57:31,838 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-19 01:57:31,844 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 01:57:31,845 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2024-11-19 01:57:31,845 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 01:57:31,846 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:31,846 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 01:57:31,848 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:57:31,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:31,854 INFO L85 PathProgramCache]: Analyzing trace with hash 198549943, now seen corresponding path program 1 times [2024-11-19 01:57:31,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:31,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798715359] [2024-11-19 01:57:31,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:31,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:32,165 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-19 01:57:32,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:57:32,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798715359] [2024-11-19 01:57:32,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798715359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:57:32,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:57:32,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:57:32,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398253821] [2024-11-19 01:57:32,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:57:32,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:57:32,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:57:32,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:57:32,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:57:32,211 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 22 [2024-11-19 01:57:32,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 43 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-19 01:57:32,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:57:32,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 22 [2024-11-19 01:57:32,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:57:32,275 INFO L124 PetriNetUnfolderBase]: 23/67 cut-off events. [2024-11-19 01:57:32,275 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 01:57:32,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 67 events. 23/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 227 event pairs, 9 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 110. Up to 37 conditions per place. [2024-11-19 01:57:32,278 INFO L140 encePairwiseOnDemand]: 19/22 looper letters, 12 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2024-11-19 01:57:32,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 21 transitions, 77 flow [2024-11-19 01:57:32,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:57:32,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 01:57:32,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2024-11-19 01:57:32,291 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2024-11-19 01:57:32,293 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 43 flow. Second operand 3 states and 42 transitions. [2024-11-19 01:57:32,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 21 transitions, 77 flow [2024-11-19 01:57:32,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 21 transitions, 76 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 01:57:32,299 INFO L231 Difference]: Finished difference. Result has 25 places, 18 transitions, 50 flow [2024-11-19 01:57:32,301 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=25, PETRI_TRANSITIONS=18} [2024-11-19 01:57:32,304 INFO L277 CegarLoopForPetriNet]: 23 programPoint places, 2 predicate places. [2024-11-19 01:57:32,305 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 50 flow [2024-11-19 01:57:32,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-19 01:57:32,305 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:32,306 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-19 01:57:32,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 01:57:32,306 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:57:32,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:32,307 INFO L85 PathProgramCache]: Analyzing trace with hash 648166806, now seen corresponding path program 1 times [2024-11-19 01:57:32,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:32,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993308658] [2024-11-19 01:57:32,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:32,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:57:32,327 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:57:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:57:32,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:57:32,378 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:57:32,381 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-11-19 01:57:32,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-11-19 01:57:32,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-19 01:57:32,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 01:57:32,384 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-19 01:57:32,389 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-19 01:57:32,390 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-19 01:57:32,411 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 01:57:32,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 30 transitions, 80 flow [2024-11-19 01:57:32,423 INFO L124 PetriNetUnfolderBase]: 6/49 cut-off events. [2024-11-19 01:57:32,423 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 01:57:32,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 49 events. 6/49 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 43. Up to 6 conditions per place. [2024-11-19 01:57:32,424 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 30 transitions, 80 flow [2024-11-19 01:57:32,425 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 26 transitions, 70 flow [2024-11-19 01:57:32,427 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:57:32,428 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;@1c7e6d77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:57:32,428 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-19 01:57:32,445 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 01:57:32,445 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2024-11-19 01:57:32,445 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 01:57:32,445 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:32,445 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 01:57:32,446 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:57:32,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:32,449 INFO L85 PathProgramCache]: Analyzing trace with hash 227179093, now seen corresponding path program 1 times [2024-11-19 01:57:32,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:32,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618999283] [2024-11-19 01:57:32,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:32,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:32,586 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-19 01:57:32,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:57:32,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618999283] [2024-11-19 01:57:32,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618999283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:57:32,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:57:32,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:57:32,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76851638] [2024-11-19 01:57:32,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:57:32,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:57:32,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:57:32,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:57:32,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:57:32,591 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 30 [2024-11-19 01:57:32,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-19 01:57:32,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:57:32,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 30 [2024-11-19 01:57:32,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:57:32,738 INFO L124 PetriNetUnfolderBase]: 211/419 cut-off events. [2024-11-19 01:57:32,739 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-11-19 01:57:32,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 800 conditions, 419 events. 211/419 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2149 event pairs, 133 based on Foata normal form. 0/345 useless extension candidates. Maximal degree in co-relation 332. Up to 321 conditions per place. [2024-11-19 01:57:32,750 INFO L140 encePairwiseOnDemand]: 27/30 looper letters, 18 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2024-11-19 01:57:32,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 31 transitions, 120 flow [2024-11-19 01:57:32,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:57:32,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 01:57:32,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2024-11-19 01:57:32,753 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-19 01:57:32,754 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 70 flow. Second operand 3 states and 60 transitions. [2024-11-19 01:57:32,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 31 transitions, 120 flow [2024-11-19 01:57:32,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 31 transitions, 119 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 01:57:32,756 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 81 flow [2024-11-19 01:57:32,758 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2024-11-19 01:57:32,758 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2024-11-19 01:57:32,759 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 81 flow [2024-11-19 01:57:32,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-19 01:57:32,759 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:32,759 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:57:32,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 01:57:32,759 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:57:32,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:32,760 INFO L85 PathProgramCache]: Analyzing trace with hash 2102617054, now seen corresponding path program 1 times [2024-11-19 01:57:32,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:32,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273518716] [2024-11-19 01:57:32,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:32,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:32,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:57:32,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:57:32,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273518716] [2024-11-19 01:57:32,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273518716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:57:32,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:57:32,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:57:32,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43750950] [2024-11-19 01:57:32,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:57:32,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:57:32,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:57:32,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:57:32,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:57:32,900 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 30 [2024-11-19 01:57:32,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 81 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-19 01:57:32,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:57:32,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 30 [2024-11-19 01:57:32,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:57:33,002 INFO L124 PetriNetUnfolderBase]: 247/475 cut-off events. [2024-11-19 01:57:33,003 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-11-19 01:57:33,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 475 events. 247/475 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2583 event pairs, 191 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 400. Up to 333 conditions per place. [2024-11-19 01:57:33,012 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 18 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2024-11-19 01:57:33,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 32 transitions, 133 flow [2024-11-19 01:57:33,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:57:33,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 01:57:33,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2024-11-19 01:57:33,016 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6083333333333333 [2024-11-19 01:57:33,016 INFO L175 Difference]: Start difference. First operand has 37 places, 27 transitions, 81 flow. Second operand 4 states and 73 transitions. [2024-11-19 01:57:33,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 32 transitions, 133 flow [2024-11-19 01:57:33,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 32 transitions, 131 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 01:57:33,020 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 93 flow [2024-11-19 01:57:33,020 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=93, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2024-11-19 01:57:33,021 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2024-11-19 01:57:33,022 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 93 flow [2024-11-19 01:57:33,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-19 01:57:33,023 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:33,023 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:57:33,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 01:57:33,024 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:57:33,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:33,024 INFO L85 PathProgramCache]: Analyzing trace with hash 756593096, now seen corresponding path program 1 times [2024-11-19 01:57:33,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:33,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617143757] [2024-11-19 01:57:33,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:33,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:33,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:57:33,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:57:33,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617143757] [2024-11-19 01:57:33,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617143757] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:57:33,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796206210] [2024-11-19 01:57:33,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:33,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:57:33,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:57:33,142 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-19 01:57:33,143 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-19 01:57:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:33,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 01:57:33,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:57:33,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:57:33,319 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:57:33,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:57:33,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796206210] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:57:33,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:57:33,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2024-11-19 01:57:33,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465192380] [2024-11-19 01:57:33,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:57:33,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 01:57:33,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:57:33,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 01:57:33,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:57:33,365 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 30 [2024-11-19 01:57:33,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 93 flow. Second operand has 8 states, 8 states have (on average 15.875) internal successors, (127), 8 states have internal predecessors, (127), 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-19 01:57:33,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:57:33,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 30 [2024-11-19 01:57:33,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:57:33,454 INFO L124 PetriNetUnfolderBase]: 119/247 cut-off events. [2024-11-19 01:57:33,455 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-11-19 01:57:33,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 247 events. 119/247 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1148 event pairs, 33 based on Foata normal form. 20/261 useless extension candidates. Maximal degree in co-relation 512. Up to 96 conditions per place. [2024-11-19 01:57:33,457 INFO L140 encePairwiseOnDemand]: 27/30 looper letters, 19 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2024-11-19 01:57:33,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 31 transitions, 131 flow [2024-11-19 01:57:33,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:57:33,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 01:57:33,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2024-11-19 01:57:33,479 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5933333333333334 [2024-11-19 01:57:33,480 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 93 flow. Second operand 5 states and 89 transitions. [2024-11-19 01:57:33,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 31 transitions, 131 flow [2024-11-19 01:57:33,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 130 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 01:57:33,482 INFO L231 Difference]: Finished difference. Result has 38 places, 22 transitions, 74 flow [2024-11-19 01:57:33,482 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=74, PETRI_PLACES=38, PETRI_TRANSITIONS=22} [2024-11-19 01:57:33,483 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2024-11-19 01:57:33,483 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 22 transitions, 74 flow [2024-11-19 01:57:33,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.875) internal successors, (127), 8 states have internal predecessors, (127), 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-19 01:57:33,488 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:33,488 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-19 01:57:33,509 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-19 01:57:33,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:57:33,690 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:57:33,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:33,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1307663877, now seen corresponding path program 1 times [2024-11-19 01:57:33,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:33,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335510100] [2024-11-19 01:57:33,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:33,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:57:33,705 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:57:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:57:33,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:57:33,728 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:57:33,728 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-11-19 01:57:33,729 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-11-19 01:57:33,729 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-19 01:57:33,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 01:57:33,730 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-19 01:57:33,730 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-19 01:57:33,730 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-19 01:57:33,763 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 01:57:33,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 38 transitions, 112 flow [2024-11-19 01:57:33,776 INFO L124 PetriNetUnfolderBase]: 8/68 cut-off events. [2024-11-19 01:57:33,776 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-19 01:57:33,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 68 events. 8/68 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 128 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 70. Up to 8 conditions per place. [2024-11-19 01:57:33,777 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 38 transitions, 112 flow [2024-11-19 01:57:33,778 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 34 transitions, 101 flow [2024-11-19 01:57:33,779 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:57:33,780 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;@1c7e6d77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:57:33,780 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-19 01:57:33,782 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 01:57:33,782 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2024-11-19 01:57:33,783 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 01:57:33,783 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:33,783 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 01:57:33,783 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:57:33,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:33,784 INFO L85 PathProgramCache]: Analyzing trace with hash 263442683, now seen corresponding path program 1 times [2024-11-19 01:57:33,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:33,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177945702] [2024-11-19 01:57:33,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:33,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:33,824 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-19 01:57:33,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:57:33,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177945702] [2024-11-19 01:57:33,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177945702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:57:33,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:57:33,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:57:33,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475202793] [2024-11-19 01:57:33,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:57:33,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:57:33,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:57:33,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:57:33,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:57:33,827 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 38 [2024-11-19 01:57:33,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 101 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-19 01:57:33,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:57:33,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 38 [2024-11-19 01:57:33,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:57:34,059 INFO L124 PetriNetUnfolderBase]: 1347/2211 cut-off events. [2024-11-19 01:57:34,059 INFO L125 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2024-11-19 01:57:34,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4306 conditions, 2211 events. 1347/2211 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 13076 event pairs, 1013 based on Foata normal form. 0/1878 useless extension candidates. Maximal degree in co-relation 1892. Up to 1841 conditions per place. [2024-11-19 01:57:34,104 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 22 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2024-11-19 01:57:34,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 39 transitions, 159 flow [2024-11-19 01:57:34,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:57:34,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 01:57:34,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2024-11-19 01:57:34,106 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-19 01:57:34,106 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 101 flow. Second operand 3 states and 76 transitions. [2024-11-19 01:57:34,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 39 transitions, 159 flow [2024-11-19 01:57:34,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 39 transitions, 154 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-19 01:57:34,110 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 108 flow [2024-11-19 01:57:34,110 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2024-11-19 01:57:34,111 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2024-11-19 01:57:34,111 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 108 flow [2024-11-19 01:57:34,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-19 01:57:34,111 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:34,111 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:57:34,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 01:57:34,112 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:57:34,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:34,112 INFO L85 PathProgramCache]: Analyzing trace with hash 744679793, now seen corresponding path program 1 times [2024-11-19 01:57:34,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:34,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257787168] [2024-11-19 01:57:34,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:34,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:34,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:57:34,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:57:34,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257787168] [2024-11-19 01:57:34,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257787168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:57:34,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:57:34,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:57:34,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240880377] [2024-11-19 01:57:34,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:57:34,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:57:34,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:57:34,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:57:34,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:57:34,173 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 38 [2024-11-19 01:57:34,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 108 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-19 01:57:34,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:57:34,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 38 [2024-11-19 01:57:34,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:57:34,432 INFO L124 PetriNetUnfolderBase]: 1575/2523 cut-off events. [2024-11-19 01:57:34,432 INFO L125 PetriNetUnfolderBase]: For 262/262 co-relation queries the response was YES. [2024-11-19 01:57:34,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5056 conditions, 2523 events. 1575/2523 cut-off events. For 262/262 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 15218 event pairs, 1135 based on Foata normal form. 0/2314 useless extension candidates. Maximal degree in co-relation 2224. Up to 1853 conditions per place. [2024-11-19 01:57:34,451 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 24 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2024-11-19 01:57:34,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 42 transitions, 176 flow [2024-11-19 01:57:34,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:57:34,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 01:57:34,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2024-11-19 01:57:34,453 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-11-19 01:57:34,453 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 108 flow. Second operand 4 states and 95 transitions. [2024-11-19 01:57:34,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 42 transitions, 176 flow [2024-11-19 01:57:34,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 42 transitions, 174 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 01:57:34,456 INFO L231 Difference]: Finished difference. Result has 52 places, 36 transitions, 120 flow [2024-11-19 01:57:34,456 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2024-11-19 01:57:34,457 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 5 predicate places. [2024-11-19 01:57:34,457 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 120 flow [2024-11-19 01:57:34,457 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-19 01:57:34,458 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:34,458 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:57:34,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 01:57:34,458 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:57:34,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:34,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1610211003, now seen corresponding path program 1 times [2024-11-19 01:57:34,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:34,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248771331] [2024-11-19 01:57:34,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:34,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:34,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:57:34,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:57:34,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248771331] [2024-11-19 01:57:34,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248771331] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:57:34,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016700989] [2024-11-19 01:57:34,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:34,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:57:34,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:57:34,511 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-19 01:57:34,513 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-19 01:57:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:34,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 01:57:34,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:57:34,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:57:34,623 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:57:34,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:57:34,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016700989] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:57:34,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:57:34,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2024-11-19 01:57:34,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525270296] [2024-11-19 01:57:34,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:57:34,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 01:57:34,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:57:34,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 01:57:34,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:57:34,649 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 38 [2024-11-19 01:57:34,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 36 transitions, 120 flow. Second operand has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 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-19 01:57:34,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:57:34,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 38 [2024-11-19 01:57:34,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:57:34,799 INFO L124 PetriNetUnfolderBase]: 807/1335 cut-off events. [2024-11-19 01:57:34,799 INFO L125 PetriNetUnfolderBase]: For 516/516 co-relation queries the response was YES. [2024-11-19 01:57:34,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2762 conditions, 1335 events. 807/1335 cut-off events. For 516/516 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7267 event pairs, 113 based on Foata normal form. 84/1362 useless extension candidates. Maximal degree in co-relation 2752. Up to 528 conditions per place. [2024-11-19 01:57:34,811 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 31 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2024-11-19 01:57:34,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 48 transitions, 204 flow [2024-11-19 01:57:34,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:57:34,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 01:57:34,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2024-11-19 01:57:34,813 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6140350877192983 [2024-11-19 01:57:34,813 INFO L175 Difference]: Start difference. First operand has 52 places, 36 transitions, 120 flow. Second operand 6 states and 140 transitions. [2024-11-19 01:57:34,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 48 transitions, 204 flow [2024-11-19 01:57:34,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 48 transitions, 203 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 01:57:34,816 INFO L231 Difference]: Finished difference. Result has 51 places, 31 transitions, 107 flow [2024-11-19 01:57:34,816 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=107, PETRI_PLACES=51, PETRI_TRANSITIONS=31} [2024-11-19 01:57:34,817 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 4 predicate places. [2024-11-19 01:57:34,817 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 31 transitions, 107 flow [2024-11-19 01:57:34,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 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-19 01:57:34,817 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:34,818 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:57:34,835 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-19 01:57:35,018 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,SelfDestructingSolverStorable8 [2024-11-19 01:57:35,019 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:57:35,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:35,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1135638216, now seen corresponding path program 1 times [2024-11-19 01:57:35,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:35,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371968175] [2024-11-19 01:57:35,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:35,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:57:35,036 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:57:35,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:57:35,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:57:35,055 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:57:35,055 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-11-19 01:57:35,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-11-19 01:57:35,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-19 01:57:35,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 01:57:35,056 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-19 01:57:35,057 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-19 01:57:35,057 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-19 01:57:35,089 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 01:57:35,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 46 transitions, 148 flow [2024-11-19 01:57:35,101 INFO L124 PetriNetUnfolderBase]: 10/87 cut-off events. [2024-11-19 01:57:35,102 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-19 01:57:35,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 87 events. 10/87 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 165 event pairs, 0 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 99. Up to 10 conditions per place. [2024-11-19 01:57:35,102 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 46 transitions, 148 flow [2024-11-19 01:57:35,103 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 42 transitions, 136 flow [2024-11-19 01:57:35,106 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:57:35,107 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;@1c7e6d77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:57:35,107 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-19 01:57:35,110 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 01:57:35,110 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2024-11-19 01:57:35,110 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 01:57:35,110 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:35,110 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 01:57:35,111 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:57:35,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:35,111 INFO L85 PathProgramCache]: Analyzing trace with hash 307340713, now seen corresponding path program 1 times [2024-11-19 01:57:35,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:35,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241672888] [2024-11-19 01:57:35,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:35,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:35,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:35,192 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-19 01:57:35,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:57:35,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241672888] [2024-11-19 01:57:35,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241672888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:57:35,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:57:35,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:57:35,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045071767] [2024-11-19 01:57:35,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:57:35,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:57:35,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:57:35,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:57:35,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:57:35,195 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 46 [2024-11-19 01:57:35,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 42 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-19 01:57:35,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:57:35,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 46 [2024-11-19 01:57:35,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:57:36,385 INFO L124 PetriNetUnfolderBase]: 7427/10915 cut-off events. [2024-11-19 01:57:36,386 INFO L125 PetriNetUnfolderBase]: For 2844/2844 co-relation queries the response was YES. [2024-11-19 01:57:36,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21588 conditions, 10915 events. 7427/10915 cut-off events. For 2844/2844 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 68764 event pairs, 6069 based on Foata normal form. 0/9566 useless extension candidates. Maximal degree in co-relation 9764. Up to 9457 conditions per place. [2024-11-19 01:57:36,482 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 26 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2024-11-19 01:57:36,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 47 transitions, 202 flow [2024-11-19 01:57:36,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:57:36,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 01:57:36,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2024-11-19 01:57:36,485 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-19 01:57:36,485 INFO L175 Difference]: Start difference. First operand has 59 places, 42 transitions, 136 flow. Second operand 3 states and 92 transitions. [2024-11-19 01:57:36,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 47 transitions, 202 flow [2024-11-19 01:57:36,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 47 transitions, 189 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-11-19 01:57:36,497 INFO L231 Difference]: Finished difference. Result has 61 places, 43 transitions, 135 flow [2024-11-19 01:57:36,497 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=61, PETRI_TRANSITIONS=43} [2024-11-19 01:57:36,498 INFO L277 CegarLoopForPetriNet]: 59 programPoint places, 2 predicate places. [2024-11-19 01:57:36,498 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 43 transitions, 135 flow [2024-11-19 01:57:36,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-19 01:57:36,499 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:36,499 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:57:36,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 01:57:36,499 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:57:36,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:36,500 INFO L85 PathProgramCache]: Analyzing trace with hash 339211268, now seen corresponding path program 1 times [2024-11-19 01:57:36,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:36,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811298457] [2024-11-19 01:57:36,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:36,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:36,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:57:36,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:57:36,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811298457] [2024-11-19 01:57:36,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811298457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:57:36,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:57:36,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:57:36,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081754341] [2024-11-19 01:57:36,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:57:36,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:57:36,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:57:36,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:57:36,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:57:36,541 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 46 [2024-11-19 01:57:36,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 43 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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-19 01:57:36,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:57:36,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 46 [2024-11-19 01:57:36,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:57:38,136 INFO L124 PetriNetUnfolderBase]: 8679/12507 cut-off events. [2024-11-19 01:57:38,136 INFO L125 PetriNetUnfolderBase]: For 1830/1830 co-relation queries the response was YES. [2024-11-19 01:57:38,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25026 conditions, 12507 events. 8679/12507 cut-off events. For 1830/1830 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 78544 event pairs, 6351 based on Foata normal form. 0/11658 useless extension candidates. Maximal degree in co-relation 11312. Up to 9469 conditions per place. [2024-11-19 01:57:38,256 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 30 selfloop transitions, 3 changer transitions 0/52 dead transitions. [2024-11-19 01:57:38,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 52 transitions, 219 flow [2024-11-19 01:57:38,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:57:38,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 01:57:38,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2024-11-19 01:57:38,258 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6358695652173914 [2024-11-19 01:57:38,258 INFO L175 Difference]: Start difference. First operand has 61 places, 43 transitions, 135 flow. Second operand 4 states and 117 transitions. [2024-11-19 01:57:38,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 52 transitions, 219 flow [2024-11-19 01:57:38,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 52 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 01:57:38,265 INFO L231 Difference]: Finished difference. Result has 64 places, 44 transitions, 147 flow [2024-11-19 01:57:38,265 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=147, PETRI_PLACES=64, PETRI_TRANSITIONS=44} [2024-11-19 01:57:38,268 INFO L277 CegarLoopForPetriNet]: 59 programPoint places, 5 predicate places. [2024-11-19 01:57:38,268 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 44 transitions, 147 flow [2024-11-19 01:57:38,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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-19 01:57:38,268 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:38,268 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:57:38,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 01:57:38,268 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:57:38,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:38,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1925588662, now seen corresponding path program 1 times [2024-11-19 01:57:38,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:38,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777323209] [2024-11-19 01:57:38,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:38,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:38,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:57:38,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:57:38,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777323209] [2024-11-19 01:57:38,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777323209] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:57:38,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007262106] [2024-11-19 01:57:38,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:38,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:57:38,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:57:38,342 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:57:38,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 01:57:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:38,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 01:57:38,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:57:38,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:57:38,503 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:57:38,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:57:38,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007262106] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:57:38,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:57:38,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2024-11-19 01:57:38,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049221494] [2024-11-19 01:57:38,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:57:38,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 01:57:38,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:57:38,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 01:57:38,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:57:38,540 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 46 [2024-11-19 01:57:38,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 44 transitions, 147 flow. Second operand has 8 states, 8 states have (on average 23.875) internal successors, (191), 8 states have internal predecessors, (191), 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-19 01:57:38,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:57:38,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 46 [2024-11-19 01:57:38,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:57:39,560 INFO L124 PetriNetUnfolderBase]: 7911/11319 cut-off events. [2024-11-19 01:57:39,560 INFO L125 PetriNetUnfolderBase]: For 2850/2850 co-relation queries the response was YES. [2024-11-19 01:57:39,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24012 conditions, 11319 events. 7911/11319 cut-off events. For 2850/2850 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 67543 event pairs, 839 based on Foata normal form. 84/11022 useless extension candidates. Maximal degree in co-relation 13760. Up to 5377 conditions per place. [2024-11-19 01:57:39,664 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 48 selfloop transitions, 6 changer transitions 0/73 dead transitions. [2024-11-19 01:57:39,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 73 transitions, 317 flow [2024-11-19 01:57:39,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:57:39,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 01:57:39,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 182 transitions. [2024-11-19 01:57:39,666 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6594202898550725 [2024-11-19 01:57:39,666 INFO L175 Difference]: Start difference. First operand has 64 places, 44 transitions, 147 flow. Second operand 6 states and 182 transitions. [2024-11-19 01:57:39,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 73 transitions, 317 flow [2024-11-19 01:57:39,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 73 transitions, 311 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-19 01:57:39,700 INFO L231 Difference]: Finished difference. Result has 71 places, 47 transitions, 181 flow [2024-11-19 01:57:39,701 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=181, PETRI_PLACES=71, PETRI_TRANSITIONS=47} [2024-11-19 01:57:39,702 INFO L277 CegarLoopForPetriNet]: 59 programPoint places, 12 predicate places. [2024-11-19 01:57:39,702 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 47 transitions, 181 flow [2024-11-19 01:57:39,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.875) internal successors, (191), 8 states have internal predecessors, (191), 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-19 01:57:39,703 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:39,703 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:57:39,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 01:57:39,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:57:39,904 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:57:39,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:39,904 INFO L85 PathProgramCache]: Analyzing trace with hash -95023867, now seen corresponding path program 1 times [2024-11-19 01:57:39,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:39,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119231676] [2024-11-19 01:57:39,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:39,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:57:39,927 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:57:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:57:39,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:57:39,955 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:57:39,956 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-11-19 01:57:39,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-11-19 01:57:39,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-19 01:57:39,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 01:57:39,957 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-19 01:57:39,959 WARN L244 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-19 01:57:39,959 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-11-19 01:57:39,992 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 01:57:39,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 54 transitions, 188 flow [2024-11-19 01:57:40,007 INFO L124 PetriNetUnfolderBase]: 12/106 cut-off events. [2024-11-19 01:57:40,007 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2024-11-19 01:57:40,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 106 events. 12/106 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 231 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 130. Up to 12 conditions per place. [2024-11-19 01:57:40,008 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 54 transitions, 188 flow [2024-11-19 01:57:40,009 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 50 transitions, 175 flow [2024-11-19 01:57:40,012 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:57:40,013 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;@1c7e6d77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:57:40,013 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-19 01:57:40,015 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 01:57:40,015 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2024-11-19 01:57:40,015 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 01:57:40,015 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:40,016 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 01:57:40,016 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:57:40,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:40,016 INFO L85 PathProgramCache]: Analyzing trace with hash 358873183, now seen corresponding path program 1 times [2024-11-19 01:57:40,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:40,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366532800] [2024-11-19 01:57:40,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:40,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:40,056 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-19 01:57:40,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:57:40,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366532800] [2024-11-19 01:57:40,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366532800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:57:40,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:57:40,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:57:40,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512925586] [2024-11-19 01:57:40,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:57:40,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:57:40,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:57:40,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:57:40,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:57:40,061 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-11-19 01:57:40,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 50 transitions, 175 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-19 01:57:40,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:57:40,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-11-19 01:57:40,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:57:44,988 INFO L124 PetriNetUnfolderBase]: 37891/51875 cut-off events. [2024-11-19 01:57:44,988 INFO L125 PetriNetUnfolderBase]: For 19228/19228 co-relation queries the response was YES. [2024-11-19 01:57:45,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103766 conditions, 51875 events. 37891/51875 cut-off events. For 19228/19228 co-relation queries the response was YES. Maximal size of possible extension queue 1948. Compared 336813 event pairs, 32437 based on Foata normal form. 0/46430 useless extension candidates. Maximal degree in co-relation 47780. Up to 46065 conditions per place. [2024-11-19 01:57:45,460 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 30 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2024-11-19 01:57:45,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 55 transitions, 249 flow [2024-11-19 01:57:45,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:57:45,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 01:57:45,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2024-11-19 01:57:45,462 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-19 01:57:45,462 INFO L175 Difference]: Start difference. First operand has 71 places, 50 transitions, 175 flow. Second operand 3 states and 108 transitions. [2024-11-19 01:57:45,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 55 transitions, 249 flow [2024-11-19 01:57:45,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 55 transitions, 224 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-11-19 01:57:45,544 INFO L231 Difference]: Finished difference. Result has 73 places, 51 transitions, 162 flow [2024-11-19 01:57:45,544 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=73, PETRI_TRANSITIONS=51} [2024-11-19 01:57:45,545 INFO L277 CegarLoopForPetriNet]: 71 programPoint places, 2 predicate places. [2024-11-19 01:57:45,545 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 51 transitions, 162 flow [2024-11-19 01:57:45,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-19 01:57:45,545 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:45,545 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:57:45,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 01:57:45,546 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:57:45,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:45,546 INFO L85 PathProgramCache]: Analyzing trace with hash 886211479, now seen corresponding path program 1 times [2024-11-19 01:57:45,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:45,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861289556] [2024-11-19 01:57:45,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:45,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:45,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:57:45,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:57:45,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861289556] [2024-11-19 01:57:45,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861289556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:57:45,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:57:45,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:57:45,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293594684] [2024-11-19 01:57:45,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:57:45,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:57:45,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:57:45,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:57:45,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:57:45,598 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-11-19 01:57:45,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 51 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:57:45,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:57:45,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-11-19 01:57:45,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:57:50,470 INFO L124 PetriNetUnfolderBase]: 44263/59611 cut-off events. [2024-11-19 01:57:50,471 INFO L125 PetriNetUnfolderBase]: For 11430/11430 co-relation queries the response was YES. [2024-11-19 01:57:50,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119236 conditions, 59611 events. 44263/59611 cut-off events. For 11430/11430 co-relation queries the response was YES. Maximal size of possible extension queue 2328. Compared 382012 event pairs, 36527 based on Foata normal form. 0/56202 useless extension candidates. Maximal degree in co-relation 54832. Up to 46077 conditions per place. [2024-11-19 01:57:51,003 INFO L140 encePairwiseOnDemand]: 50/54 looper letters, 36 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2024-11-19 01:57:51,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 62 transitions, 262 flow [2024-11-19 01:57:51,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:57:51,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 01:57:51,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2024-11-19 01:57:51,004 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6435185185185185 [2024-11-19 01:57:51,004 INFO L175 Difference]: Start difference. First operand has 73 places, 51 transitions, 162 flow. Second operand 4 states and 139 transitions. [2024-11-19 01:57:51,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 62 transitions, 262 flow [2024-11-19 01:57:51,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 62 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 01:57:51,034 INFO L231 Difference]: Finished difference. Result has 76 places, 52 transitions, 174 flow [2024-11-19 01:57:51,035 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=174, PETRI_PLACES=76, PETRI_TRANSITIONS=52} [2024-11-19 01:57:51,035 INFO L277 CegarLoopForPetriNet]: 71 programPoint places, 5 predicate places. [2024-11-19 01:57:51,035 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 52 transitions, 174 flow [2024-11-19 01:57:51,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:57:51,036 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:51,036 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:57:51,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 01:57:51,036 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:57:51,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:51,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1702726073, now seen corresponding path program 1 times [2024-11-19 01:57:51,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:51,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430504330] [2024-11-19 01:57:51,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:51,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:51,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:57:51,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:57:51,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430504330] [2024-11-19 01:57:51,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430504330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:57:51,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852916426] [2024-11-19 01:57:51,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:51,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:57:51,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:57:51,084 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:57:51,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 01:57:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:51,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 01:57:51,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:57:51,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:57:51,218 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:57:51,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:57:51,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852916426] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:57:51,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:57:51,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2024-11-19 01:57:51,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894671464] [2024-11-19 01:57:51,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:57:51,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 01:57:51,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:57:51,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 01:57:51,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:57:51,254 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-11-19 01:57:51,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 52 transitions, 174 flow. Second operand has 8 states, 8 states have (on average 27.875) internal successors, (223), 8 states have internal predecessors, (223), 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-19 01:57:51,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:57:51,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-11-19 01:57:51,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:57:55,692 INFO L124 PetriNetUnfolderBase]: 43495/58423 cut-off events. [2024-11-19 01:57:55,692 INFO L125 PetriNetUnfolderBase]: For 12834/12834 co-relation queries the response was YES. [2024-11-19 01:57:56,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123342 conditions, 58423 events. 43495/58423 cut-off events. For 12834/12834 co-relation queries the response was YES. Maximal size of possible extension queue 2197. Compared 367329 event pairs, 5447 based on Foata normal form. 84/55350 useless extension candidates. Maximal degree in co-relation 65984. Up to 30977 conditions per place. [2024-11-19 01:57:56,241 INFO L140 encePairwiseOnDemand]: 50/54 looper letters, 54 selfloop transitions, 6 changer transitions 0/83 dead transitions. [2024-11-19 01:57:56,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 83 transitions, 360 flow [2024-11-19 01:57:56,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:57:56,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 01:57:56,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 212 transitions. [2024-11-19 01:57:56,242 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.654320987654321 [2024-11-19 01:57:56,242 INFO L175 Difference]: Start difference. First operand has 76 places, 52 transitions, 174 flow. Second operand 6 states and 212 transitions. [2024-11-19 01:57:56,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 83 transitions, 360 flow [2024-11-19 01:57:57,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 83 transitions, 354 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-19 01:57:57,094 INFO L231 Difference]: Finished difference. Result has 83 places, 55 transitions, 208 flow [2024-11-19 01:57:57,094 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=208, PETRI_PLACES=83, PETRI_TRANSITIONS=55} [2024-11-19 01:57:57,095 INFO L277 CegarLoopForPetriNet]: 71 programPoint places, 12 predicate places. [2024-11-19 01:57:57,095 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 55 transitions, 208 flow [2024-11-19 01:57:57,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.875) internal successors, (223), 8 states have internal predecessors, (223), 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-19 01:57:57,096 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:57,096 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:57:57,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 01:57:57,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-19 01:57:57,297 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:57:57,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:57,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1283341195, now seen corresponding path program 1 times [2024-11-19 01:57:57,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:57,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660810186] [2024-11-19 01:57:57,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:57,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:57,440 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:57:57,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:57:57,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660810186] [2024-11-19 01:57:57,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660810186] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:57:57,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654071832] [2024-11-19 01:57:57,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:57,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:57:57,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:57:57,443 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:57:57,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 01:57:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:57,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 01:57:57,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:57:57,682 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:57:57,682 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:57:57,781 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:57:57,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654071832] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:57:57,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:57:57,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2024-11-19 01:57:57,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607651380] [2024-11-19 01:57:57,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:57:57,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 01:57:57,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:57:57,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 01:57:57,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=142, Unknown=0, NotChecked=0, Total=272 [2024-11-19 01:57:57,786 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-11-19 01:57:57,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 55 transitions, 208 flow. Second operand has 17 states, 17 states have (on average 29.0) internal successors, (493), 17 states have internal predecessors, (493), 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-19 01:57:57,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:57:57,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-11-19 01:57:57,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:58:00,498 INFO L124 PetriNetUnfolderBase]: 23783/32311 cut-off events. [2024-11-19 01:58:00,498 INFO L125 PetriNetUnfolderBase]: For 28414/28414 co-relation queries the response was YES. [2024-11-19 01:58:00,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71371 conditions, 32311 events. 23783/32311 cut-off events. For 28414/28414 co-relation queries the response was YES. Maximal size of possible extension queue 1249. Compared 194386 event pairs, 1607 based on Foata normal form. 1280/33248 useless extension candidates. Maximal degree in co-relation 71354. Up to 13568 conditions per place. [2024-11-19 01:58:00,746 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 61 selfloop transitions, 6 changer transitions 0/88 dead transitions. [2024-11-19 01:58:00,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 88 transitions, 410 flow [2024-11-19 01:58:00,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 01:58:00,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 01:58:00,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 269 transitions. [2024-11-19 01:58:00,748 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6226851851851852 [2024-11-19 01:58:00,748 INFO L175 Difference]: Start difference. First operand has 83 places, 55 transitions, 208 flow. Second operand 8 states and 269 transitions. [2024-11-19 01:58:00,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 88 transitions, 410 flow [2024-11-19 01:58:00,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 88 transitions, 389 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-11-19 01:58:00,780 INFO L231 Difference]: Finished difference. Result has 80 places, 50 transitions, 182 flow [2024-11-19 01:58:00,780 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=182, PETRI_PLACES=80, PETRI_TRANSITIONS=50} [2024-11-19 01:58:00,780 INFO L277 CegarLoopForPetriNet]: 71 programPoint places, 9 predicate places. [2024-11-19 01:58:00,781 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 50 transitions, 182 flow [2024-11-19 01:58:00,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 29.0) internal successors, (493), 17 states have internal predecessors, (493), 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-19 01:58:00,781 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:58:00,781 INFO L204 CegarLoopForPetriNet]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:58:00,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 01:58:00,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-19 01:58:00,982 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:58:00,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:58:00,982 INFO L85 PathProgramCache]: Analyzing trace with hash 123626874, now seen corresponding path program 1 times [2024-11-19 01:58:00,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:58:00,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92469496] [2024-11-19 01:58:00,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:58:00,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:58:00,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:58:00,995 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:58:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:58:01,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:58:01,009 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:58:01,009 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-11-19 01:58:01,009 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-11-19 01:58:01,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-19 01:58:01,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 01:58:01,010 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-19 01:58:01,010 WARN L244 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-19 01:58:01,011 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-11-19 01:58:01,043 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 01:58:01,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 62 transitions, 232 flow [2024-11-19 01:58:01,053 INFO L124 PetriNetUnfolderBase]: 14/125 cut-off events. [2024-11-19 01:58:01,053 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2024-11-19 01:58:01,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 125 events. 14/125 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 272 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 163. Up to 14 conditions per place. [2024-11-19 01:58:01,054 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 62 transitions, 232 flow [2024-11-19 01:58:01,055 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 58 transitions, 218 flow [2024-11-19 01:58:01,056 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:58:01,057 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;@1c7e6d77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:58:01,057 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-19 01:58:01,058 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 01:58:01,058 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2024-11-19 01:58:01,060 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 01:58:01,061 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:58:01,061 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 01:58:01,061 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:58:01,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:58:01,061 INFO L85 PathProgramCache]: Analyzing trace with hash 418040093, now seen corresponding path program 1 times [2024-11-19 01:58:01,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:58:01,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29040813] [2024-11-19 01:58:01,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:58:01,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:58:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:58:01,091 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-19 01:58:01,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:58:01,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29040813] [2024-11-19 01:58:01,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29040813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:58:01,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:58:01,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:58:01,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664929279] [2024-11-19 01:58:01,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:58:01,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:58:01,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:58:01,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:58:01,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:58:01,093 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 62 [2024-11-19 01:58:01,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 58 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-19 01:58:01,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:58:01,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 62 [2024-11-19 01:58:01,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand