./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-theta/exponential-4.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-4.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 6e0717c26865b2b98bbf38ebc229049821d555def6fcecec3e56a64fb6f63f98 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:57:26,226 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:57:26,309 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:26,314 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:57:26,316 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:57:26,340 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:57:26,341 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:57:26,341 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:57:26,342 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:57:26,342 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:57:26,343 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:57:26,343 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:57:26,344 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:57:26,344 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:57:26,344 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:57:26,345 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:57:26,345 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:57:26,346 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:57:26,346 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:57:26,346 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:57:26,347 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:57:26,347 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:57:26,348 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:57:26,348 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:57:26,348 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:57:26,349 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:57:26,349 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:57:26,349 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:57:26,350 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:57:26,350 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:57:26,350 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:57:26,351 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:57:26,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:57:26,351 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:57:26,352 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:57:26,362 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:57:26,362 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:57:26,362 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:57:26,363 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:57:26,363 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:57:26,363 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:57:26,364 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:57:26,364 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 -> 6e0717c26865b2b98bbf38ebc229049821d555def6fcecec3e56a64fb6f63f98 [2024-11-19 01:57:26,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:57:26,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:57:26,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:57:26,629 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:57:26,629 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:57:26,631 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/exponential-4.i [2024-11-19 01:57:28,087 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:57:28,331 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:57:28,333 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/exponential-4.i [2024-11-19 01:57:28,350 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/120ed1a47/1638ecdecd5744819a8a01fa709538c9/FLAGe2101d754 [2024-11-19 01:57:28,363 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/120ed1a47/1638ecdecd5744819a8a01fa709538c9 [2024-11-19 01:57:28,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:57:28,366 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:57:28,368 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:57:28,368 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:57:28,374 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:57:28,375 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:57:28" (1/1) ... [2024-11-19 01:57:28,376 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14ad061c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:57:28, skipping insertion in model container [2024-11-19 01:57:28,376 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:57:28" (1/1) ... [2024-11-19 01:57:28,428 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:57:28,807 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-4.i[33030,33043] [2024-11-19 01:57:28,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:57:28,840 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:57:28,894 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-4.i[33030,33043] [2024-11-19 01:57:28,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:57:28,943 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:57:28,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:57:28 WrapperNode [2024-11-19 01:57:28,944 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:57:28,946 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:57:28,947 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:57:28,947 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:57:28,954 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:28" (1/1) ... [2024-11-19 01:57:28,971 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:28" (1/1) ... [2024-11-19 01:57:28,996 INFO L138 Inliner]: procedures = 169, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2024-11-19 01:57:28,997 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:57:28,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:57:28,998 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:57:28,999 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:57:29,009 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:28" (1/1) ... [2024-11-19 01:57:29,010 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:28" (1/1) ... [2024-11-19 01:57:29,013 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:28" (1/1) ... [2024-11-19 01:57:29,035 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:29,036 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:28" (1/1) ... [2024-11-19 01:57:29,036 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:28" (1/1) ... [2024-11-19 01:57:29,040 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:28" (1/1) ... [2024-11-19 01:57:29,047 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:28" (1/1) ... [2024-11-19 01:57:29,049 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:28" (1/1) ... [2024-11-19 01:57:29,054 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:28" (1/1) ... [2024-11-19 01:57:29,056 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:57:29,061 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:57:29,061 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:57:29,062 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:57:29,062 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:57:28" (1/1) ... [2024-11-19 01:57:29,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:57:29,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:57:29,098 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:29,101 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:29,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:57:29,143 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-19 01:57:29,144 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-19 01:57:29,144 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-19 01:57:29,144 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-19 01:57:29,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 01:57:29,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:57:29,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:57:29,146 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:29,260 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:57:29,262 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:57:29,444 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 01:57:29,444 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:57:29,561 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:57:29,565 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 01:57:29,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:57:29 BoogieIcfgContainer [2024-11-19 01:57:29,565 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:57:29,568 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:57:29,568 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:57:29,572 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:57:29,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:57:28" (1/3) ... [2024-11-19 01:57:29,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d9f934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:57:29, skipping insertion in model container [2024-11-19 01:57:29,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:57:28" (2/3) ... [2024-11-19 01:57:29,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d9f934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:57:29, skipping insertion in model container [2024-11-19 01:57:29,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:57:29" (3/3) ... [2024-11-19 01:57:29,576 INFO L112 eAbstractionObserver]: Analyzing ICFG exponential-4.i [2024-11-19 01:57:29,591 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:57:29,591 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:57:29,591 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 01:57:29,630 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 01:57:29,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 22 transitions, 52 flow [2024-11-19 01:57:29,709 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2024-11-19 01:57:29,709 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 01:57:29,712 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:29,713 INFO L82 GeneralOperation]: Start removeDead. Operand has 26 places, 22 transitions, 52 flow [2024-11-19 01:57:29,716 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 18 transitions, 43 flow [2024-11-19 01:57:29,726 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:57:29,732 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;@340253d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:57:29,732 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-19 01:57:29,740 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 01:57:29,740 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2024-11-19 01:57:29,740 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 01:57:29,741 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:29,741 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 01:57:29,742 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:29,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:29,748 INFO L85 PathProgramCache]: Analyzing trace with hash 198549943, now seen corresponding path program 1 times [2024-11-19 01:57:29,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:29,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602518087] [2024-11-19 01:57:29,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:29,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:30,092 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:30,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:57:30,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602518087] [2024-11-19 01:57:30,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602518087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:57:30,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:57:30,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:57:30,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387037358] [2024-11-19 01:57:30,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:57:30,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:57:30,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:57:30,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:57:30,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:57:30,134 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 22 [2024-11-19 01:57:30,136 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:30,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:57:30,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 22 [2024-11-19 01:57:30,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:57:30,194 INFO L124 PetriNetUnfolderBase]: 23/67 cut-off events. [2024-11-19 01:57:30,194 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 01:57:30,195 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:30,198 INFO L140 encePairwiseOnDemand]: 19/22 looper letters, 12 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2024-11-19 01:57:30,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 21 transitions, 77 flow [2024-11-19 01:57:30,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:57:30,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 01:57:30,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2024-11-19 01:57:30,211 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2024-11-19 01:57:30,212 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:30,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 21 transitions, 77 flow [2024-11-19 01:57:30,215 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:30,217 INFO L231 Difference]: Finished difference. Result has 25 places, 18 transitions, 50 flow [2024-11-19 01:57:30,219 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:30,223 INFO L277 CegarLoopForPetriNet]: 23 programPoint places, 2 predicate places. [2024-11-19 01:57:30,223 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 50 flow [2024-11-19 01:57:30,223 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:30,224 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:30,224 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-19 01:57:30,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 01:57:30,226 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:30,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:30,226 INFO L85 PathProgramCache]: Analyzing trace with hash 648166806, now seen corresponding path program 1 times [2024-11-19 01:57:30,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:30,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984650194] [2024-11-19 01:57:30,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:30,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:57:30,265 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:57:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:57:30,300 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:57:30,301 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:57:30,303 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-11-19 01:57:30,305 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-11-19 01:57:30,305 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-19 01:57:30,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 01:57:30,306 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-19 01:57:30,308 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-19 01:57:30,308 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-19 01:57:30,336 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 01:57:30,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 30 transitions, 80 flow [2024-11-19 01:57:30,350 INFO L124 PetriNetUnfolderBase]: 6/49 cut-off events. [2024-11-19 01:57:30,350 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 01:57:30,351 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:30,351 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 30 transitions, 80 flow [2024-11-19 01:57:30,352 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 26 transitions, 70 flow [2024-11-19 01:57:30,353 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:57:30,354 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;@340253d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:57:30,354 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-19 01:57:30,357 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 01:57:30,358 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2024-11-19 01:57:30,358 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 01:57:30,358 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:30,358 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 01:57:30,358 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:30,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:30,361 INFO L85 PathProgramCache]: Analyzing trace with hash 227179093, now seen corresponding path program 1 times [2024-11-19 01:57:30,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:30,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903365113] [2024-11-19 01:57:30,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:30,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:30,420 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:30,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:57:30,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903365113] [2024-11-19 01:57:30,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903365113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:57:30,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:57:30,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:57:30,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493024448] [2024-11-19 01:57:30,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:57:30,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:57:30,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:57:30,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:57:30,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:57:30,424 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 30 [2024-11-19 01:57:30,425 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:30,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:57:30,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 30 [2024-11-19 01:57:30,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:57:30,566 INFO L124 PetriNetUnfolderBase]: 211/419 cut-off events. [2024-11-19 01:57:30,566 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-11-19 01:57:30,571 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:30,577 INFO L140 encePairwiseOnDemand]: 27/30 looper letters, 18 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2024-11-19 01:57:30,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 31 transitions, 120 flow [2024-11-19 01:57:30,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:57:30,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 01:57:30,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2024-11-19 01:57:30,580 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-19 01:57:30,581 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:30,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 31 transitions, 120 flow [2024-11-19 01:57:30,583 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:30,584 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 81 flow [2024-11-19 01:57:30,585 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:30,586 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2024-11-19 01:57:30,586 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 81 flow [2024-11-19 01:57:30,586 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:30,587 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:30,587 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:57:30,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 01:57:30,587 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:30,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:30,588 INFO L85 PathProgramCache]: Analyzing trace with hash 2102617054, now seen corresponding path program 1 times [2024-11-19 01:57:30,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:30,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324016346] [2024-11-19 01:57:30,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:30,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:30,697 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:30,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:57:30,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324016346] [2024-11-19 01:57:30,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324016346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:57:30,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:57:30,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:57:30,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057348438] [2024-11-19 01:57:30,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:57:30,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:57:30,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:57:30,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:57:30,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:57:30,700 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 30 [2024-11-19 01:57:30,702 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:30,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:57:30,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 30 [2024-11-19 01:57:30,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:57:30,804 INFO L124 PetriNetUnfolderBase]: 247/475 cut-off events. [2024-11-19 01:57:30,804 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-11-19 01:57:30,808 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:30,813 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 18 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2024-11-19 01:57:30,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 32 transitions, 133 flow [2024-11-19 01:57:30,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:57:30,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 01:57:30,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2024-11-19 01:57:30,815 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6083333333333333 [2024-11-19 01:57:30,815 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:30,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 32 transitions, 133 flow [2024-11-19 01:57:30,817 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:30,818 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 93 flow [2024-11-19 01:57:30,818 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:30,818 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2024-11-19 01:57:30,819 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 93 flow [2024-11-19 01:57:30,819 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:30,819 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:30,819 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:57:30,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 01:57:30,820 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:30,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:30,820 INFO L85 PathProgramCache]: Analyzing trace with hash 756593096, now seen corresponding path program 1 times [2024-11-19 01:57:30,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:30,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879674256] [2024-11-19 01:57:30,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:30,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:30,919 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:30,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:57:30,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879674256] [2024-11-19 01:57:30,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879674256] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:57:30,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29189147] [2024-11-19 01:57:30,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:30,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:57:30,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:57:30,924 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:30,926 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:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:30,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 01:57:31,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:57:31,101 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:31,102 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:57:31,148 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:31,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29189147] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:57:31,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:57:31,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2024-11-19 01:57:31,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459949327] [2024-11-19 01:57:31,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:57:31,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 01:57:31,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:57:31,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 01:57:31,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:57:31,153 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 30 [2024-11-19 01:57:31,154 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:31,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:57:31,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 30 [2024-11-19 01:57:31,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:57:31,252 INFO L124 PetriNetUnfolderBase]: 119/247 cut-off events. [2024-11-19 01:57:31,253 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-11-19 01:57:31,254 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:31,256 INFO L140 encePairwiseOnDemand]: 27/30 looper letters, 19 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2024-11-19 01:57:31,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 31 transitions, 131 flow [2024-11-19 01:57:31,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:57:31,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 01:57:31,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2024-11-19 01:57:31,262 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5933333333333334 [2024-11-19 01:57:31,262 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:31,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 31 transitions, 131 flow [2024-11-19 01:57:31,263 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:31,265 INFO L231 Difference]: Finished difference. Result has 38 places, 22 transitions, 74 flow [2024-11-19 01:57:31,266 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:31,267 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2024-11-19 01:57:31,268 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 22 transitions, 74 flow [2024-11-19 01:57:31,269 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:31,269 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:31,269 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-19 01:57:31,291 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:31,470 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:31,472 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:31,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:31,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1307663877, now seen corresponding path program 1 times [2024-11-19 01:57:31,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:31,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136027921] [2024-11-19 01:57:31,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:31,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:57:31,500 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:57:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:57:31,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:57:31,525 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:57:31,525 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-11-19 01:57:31,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-11-19 01:57:31,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-19 01:57:31,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 01:57:31,529 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-19 01:57:31,530 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-19 01:57:31,530 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-19 01:57:31,564 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 01:57:31,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 38 transitions, 112 flow [2024-11-19 01:57:31,578 INFO L124 PetriNetUnfolderBase]: 8/68 cut-off events. [2024-11-19 01:57:31,578 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-19 01:57:31,579 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:31,579 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 38 transitions, 112 flow [2024-11-19 01:57:31,580 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 34 transitions, 101 flow [2024-11-19 01:57:31,582 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:57:31,583 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;@340253d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:57:31,585 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-19 01:57:31,587 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 01:57:31,588 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2024-11-19 01:57:31,588 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 01:57:31,589 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:31,589 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 01:57:31,589 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,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:31,590 INFO L85 PathProgramCache]: Analyzing trace with hash 263442683, now seen corresponding path program 1 times [2024-11-19 01:57:31,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:31,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56017354] [2024-11-19 01:57:31,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:31,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:31,648 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:31,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:57:31,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56017354] [2024-11-19 01:57:31,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56017354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:57:31,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:57:31,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:57:31,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112583103] [2024-11-19 01:57:31,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:57:31,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:57:31,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:57:31,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:57:31,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:57:31,654 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 38 [2024-11-19 01:57:31,654 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:31,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:57:31,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 38 [2024-11-19 01:57:31,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:57:31,927 INFO L124 PetriNetUnfolderBase]: 1347/2211 cut-off events. [2024-11-19 01:57:31,928 INFO L125 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2024-11-19 01:57:31,932 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:31,946 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 22 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2024-11-19 01:57:31,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 39 transitions, 159 flow [2024-11-19 01:57:31,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:57:31,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 01:57:31,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2024-11-19 01:57:31,948 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-19 01:57:31,950 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:31,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 39 transitions, 159 flow [2024-11-19 01:57:31,954 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:31,955 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 108 flow [2024-11-19 01:57:31,956 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:31,957 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2024-11-19 01:57:31,957 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 108 flow [2024-11-19 01:57:31,958 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:31,958 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:31,959 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:57:31,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 01:57:31,959 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:31,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:31,959 INFO L85 PathProgramCache]: Analyzing trace with hash 744679793, now seen corresponding path program 1 times [2024-11-19 01:57:31,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:31,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285967438] [2024-11-19 01:57:31,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:31,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:32,025 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,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:57:32,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285967438] [2024-11-19 01:57:32,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285967438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:57:32,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:57:32,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:57:32,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152469373] [2024-11-19 01:57:32,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:57:32,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:57:32,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:57:32,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:57:32,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:57:32,030 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 38 [2024-11-19 01:57:32,030 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:32,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:57:32,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 38 [2024-11-19 01:57:32,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:57:32,305 INFO L124 PetriNetUnfolderBase]: 1575/2523 cut-off events. [2024-11-19 01:57:32,306 INFO L125 PetriNetUnfolderBase]: For 262/262 co-relation queries the response was YES. [2024-11-19 01:57:32,315 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:32,336 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 24 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2024-11-19 01:57:32,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 42 transitions, 176 flow [2024-11-19 01:57:32,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:57:32,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 01:57:32,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2024-11-19 01:57:32,340 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-11-19 01:57:32,340 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:32,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 42 transitions, 176 flow [2024-11-19 01:57:32,342 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:32,343 INFO L231 Difference]: Finished difference. Result has 52 places, 36 transitions, 120 flow [2024-11-19 01:57:32,344 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:32,344 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 5 predicate places. [2024-11-19 01:57:32,344 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 120 flow [2024-11-19 01:57:32,345 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:32,345 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:32,345 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:57:32,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 01:57:32,345 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:32,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:32,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1610211003, now seen corresponding path program 1 times [2024-11-19 01:57:32,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:32,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414391631] [2024-11-19 01:57:32,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:32,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:32,449 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:32,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:57:32,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414391631] [2024-11-19 01:57:32,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414391631] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:57:32,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46413590] [2024-11-19 01:57:32,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:32,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:57:32,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:57:32,453 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:32,459 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:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:32,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 01:57:32,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:57:32,595 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:32,597 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:57:32,622 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:32,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46413590] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:57:32,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:57:32,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2024-11-19 01:57:32,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649827156] [2024-11-19 01:57:32,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:57:32,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 01:57:32,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:57:32,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 01:57:32,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:57:32,626 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 38 [2024-11-19 01:57:32,627 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:32,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:57:32,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 38 [2024-11-19 01:57:32,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:57:32,780 INFO L124 PetriNetUnfolderBase]: 807/1335 cut-off events. [2024-11-19 01:57:32,780 INFO L125 PetriNetUnfolderBase]: For 516/516 co-relation queries the response was YES. [2024-11-19 01:57:32,784 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:32,793 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 31 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2024-11-19 01:57:32,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 48 transitions, 204 flow [2024-11-19 01:57:32,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:57:32,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 01:57:32,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2024-11-19 01:57:32,795 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6140350877192983 [2024-11-19 01:57:32,795 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:32,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 48 transitions, 204 flow [2024-11-19 01:57:32,796 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:32,797 INFO L231 Difference]: Finished difference. Result has 51 places, 31 transitions, 107 flow [2024-11-19 01:57:32,798 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:32,798 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 4 predicate places. [2024-11-19 01:57:32,799 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 31 transitions, 107 flow [2024-11-19 01:57:32,799 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:32,799 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:32,799 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:57:32,816 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:33,000 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:33,000 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:33,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:33,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1135638216, now seen corresponding path program 1 times [2024-11-19 01:57:33,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:33,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377695810] [2024-11-19 01:57:33,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:33,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:57:33,013 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:57:33,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:57:33,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:57:33,027 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:57:33,027 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-11-19 01:57:33,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-11-19 01:57:33,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-19 01:57:33,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 01:57:33,028 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-19 01:57:33,028 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-19 01:57:33,029 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-19 01:57:33,052 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 01:57:33,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 46 transitions, 148 flow [2024-11-19 01:57:33,060 INFO L124 PetriNetUnfolderBase]: 10/87 cut-off events. [2024-11-19 01:57:33,061 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-19 01:57:33,061 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:33,061 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 46 transitions, 148 flow [2024-11-19 01:57:33,062 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 42 transitions, 136 flow [2024-11-19 01:57:33,063 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:57:33,063 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;@340253d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:57:33,063 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-19 01:57:33,065 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 01:57:33,065 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2024-11-19 01:57:33,065 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 01:57:33,066 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:33,066 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 01:57:33,066 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,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:33,066 INFO L85 PathProgramCache]: Analyzing trace with hash 307340713, now seen corresponding path program 1 times [2024-11-19 01:57:33,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:33,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642162847] [2024-11-19 01:57:33,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:33,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:33,101 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,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:57:33,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642162847] [2024-11-19 01:57:33,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642162847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:57:33,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:57:33,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:57:33,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049009682] [2024-11-19 01:57:33,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:57:33,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:57:33,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:57:33,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:57:33,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:57:33,105 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 46 [2024-11-19 01:57:33,105 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:33,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:57:33,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 46 [2024-11-19 01:57:33,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:57:34,292 INFO L124 PetriNetUnfolderBase]: 7427/10915 cut-off events. [2024-11-19 01:57:34,293 INFO L125 PetriNetUnfolderBase]: For 2844/2844 co-relation queries the response was YES. [2024-11-19 01:57:34,322 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:34,397 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 26 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2024-11-19 01:57:34,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 47 transitions, 202 flow [2024-11-19 01:57:34,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:57:34,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 01:57:34,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2024-11-19 01:57:34,398 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-19 01:57:34,398 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:34,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 47 transitions, 202 flow [2024-11-19 01:57:34,411 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:34,412 INFO L231 Difference]: Finished difference. Result has 61 places, 43 transitions, 135 flow [2024-11-19 01:57:34,413 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:34,414 INFO L277 CegarLoopForPetriNet]: 59 programPoint places, 2 predicate places. [2024-11-19 01:57:34,415 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 43 transitions, 135 flow [2024-11-19 01:57:34,415 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:34,415 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:34,416 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:57:34,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 01:57:34,416 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,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:34,416 INFO L85 PathProgramCache]: Analyzing trace with hash 339211268, now seen corresponding path program 1 times [2024-11-19 01:57:34,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:34,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791554320] [2024-11-19 01:57:34,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:34,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:34,472 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,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:57:34,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791554320] [2024-11-19 01:57:34,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791554320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:57:34,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:57:34,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:57:34,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114377842] [2024-11-19 01:57:34,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:57:34,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:57:34,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:57:34,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:57:34,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:57:34,474 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 46 [2024-11-19 01:57:34,474 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:34,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:57:34,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 46 [2024-11-19 01:57:34,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:57:35,829 INFO L124 PetriNetUnfolderBase]: 8679/12507 cut-off events. [2024-11-19 01:57:35,830 INFO L125 PetriNetUnfolderBase]: For 1830/1830 co-relation queries the response was YES. [2024-11-19 01:57:35,871 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:35,936 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 30 selfloop transitions, 3 changer transitions 0/52 dead transitions. [2024-11-19 01:57:35,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 52 transitions, 219 flow [2024-11-19 01:57:35,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:57:35,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 01:57:35,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2024-11-19 01:57:35,937 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6358695652173914 [2024-11-19 01:57:35,938 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:35,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 52 transitions, 219 flow [2024-11-19 01:57:35,941 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:35,942 INFO L231 Difference]: Finished difference. Result has 64 places, 44 transitions, 147 flow [2024-11-19 01:57:35,943 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:35,943 INFO L277 CegarLoopForPetriNet]: 59 programPoint places, 5 predicate places. [2024-11-19 01:57:35,944 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 44 transitions, 147 flow [2024-11-19 01:57:35,944 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:35,944 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:35,944 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:57:35,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 01:57:35,944 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:35,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:35,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1925588662, now seen corresponding path program 1 times [2024-11-19 01:57:35,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:35,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746118379] [2024-11-19 01:57:35,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:35,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:35,995 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:35,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:57:35,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746118379] [2024-11-19 01:57:35,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746118379] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:57:35,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747805280] [2024-11-19 01:57:35,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:35,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:57:35,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:57:35,999 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:36,000 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:36,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:36,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 01:57:36,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:57:36,125 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:36,125 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:57:36,154 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:36,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747805280] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:57:36,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:57:36,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2024-11-19 01:57:36,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83256305] [2024-11-19 01:57:36,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:57:36,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 01:57:36,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:57:36,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 01:57:36,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:57:36,156 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 46 [2024-11-19 01:57:36,156 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:36,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:57:36,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 46 [2024-11-19 01:57:36,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:57:37,236 INFO L124 PetriNetUnfolderBase]: 7911/11319 cut-off events. [2024-11-19 01:57:37,237 INFO L125 PetriNetUnfolderBase]: For 2850/2850 co-relation queries the response was YES. [2024-11-19 01:57:37,285 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:37,366 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 48 selfloop transitions, 6 changer transitions 0/73 dead transitions. [2024-11-19 01:57:37,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 73 transitions, 317 flow [2024-11-19 01:57:37,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:57:37,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 01:57:37,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 182 transitions. [2024-11-19 01:57:37,368 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6594202898550725 [2024-11-19 01:57:37,368 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:37,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 73 transitions, 317 flow [2024-11-19 01:57:37,398 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:37,399 INFO L231 Difference]: Finished difference. Result has 71 places, 47 transitions, 181 flow [2024-11-19 01:57:37,400 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:37,400 INFO L277 CegarLoopForPetriNet]: 59 programPoint places, 12 predicate places. [2024-11-19 01:57:37,400 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 47 transitions, 181 flow [2024-11-19 01:57:37,401 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:37,401 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:37,401 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:57:37,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 01:57:37,605 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:37,607 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:37,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:37,608 INFO L85 PathProgramCache]: Analyzing trace with hash -95023867, now seen corresponding path program 1 times [2024-11-19 01:57:37,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:37,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257809729] [2024-11-19 01:57:37,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:37,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:37,860 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:57:37,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:57:37,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257809729] [2024-11-19 01:57:37,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257809729] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:57:37,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038483933] [2024-11-19 01:57:37,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:37,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:57:37,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:57:37,863 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:37,865 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:37,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:37,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 01:57:37,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:57:38,116 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:57:38,116 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:57:38,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038483933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:57:38,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:57:38,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2024-11-19 01:57:38,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2562787] [2024-11-19 01:57:38,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:57:38,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:57:38,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:57:38,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:57:38,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-11-19 01:57:38,120 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 46 [2024-11-19 01:57:38,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 47 transitions, 181 flow. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 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,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:57:38,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 46 [2024-11-19 01:57:38,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:57:38,804 INFO L124 PetriNetUnfolderBase]: 6887/9783 cut-off events. [2024-11-19 01:57:38,804 INFO L125 PetriNetUnfolderBase]: For 4344/4344 co-relation queries the response was YES. [2024-11-19 01:57:38,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22217 conditions, 9783 events. 6887/9783 cut-off events. For 4344/4344 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 55999 event pairs, 657 based on Foata normal form. 256/9690 useless extension candidates. Maximal degree in co-relation 11706. Up to 5376 conditions per place. [2024-11-19 01:57:38,866 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 48 selfloop transitions, 5 changer transitions 0/71 dead transitions. [2024-11-19 01:57:38,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 71 transitions, 333 flow [2024-11-19 01:57:38,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:57:38,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 01:57:38,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 200 transitions. [2024-11-19 01:57:38,868 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6211180124223602 [2024-11-19 01:57:38,868 INFO L175 Difference]: Start difference. First operand has 71 places, 47 transitions, 181 flow. Second operand 7 states and 200 transitions. [2024-11-19 01:57:38,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 71 transitions, 333 flow [2024-11-19 01:57:38,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 71 transitions, 322 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-19 01:57:38,886 INFO L231 Difference]: Finished difference. Result has 73 places, 45 transitions, 168 flow [2024-11-19 01:57:38,886 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=168, PETRI_PLACES=73, PETRI_TRANSITIONS=45} [2024-11-19 01:57:38,887 INFO L277 CegarLoopForPetriNet]: 59 programPoint places, 14 predicate places. [2024-11-19 01:57:38,887 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 45 transitions, 168 flow [2024-11-19 01:57:38,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 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,888 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:38,888 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:38,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 01:57:39,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:57:39,093 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:57:39,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:39,093 INFO L85 PathProgramCache]: Analyzing trace with hash -472705931, now seen corresponding path program 1 times [2024-11-19 01:57:39,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:39,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288296771] [2024-11-19 01:57:39,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:39,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:39,213 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 01:57:39,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:57:39,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288296771] [2024-11-19 01:57:39,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288296771] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:57:39,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019444021] [2024-11-19 01:57:39,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:39,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:57:39,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:57:39,217 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:39,219 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:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:39,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 01:57:39,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:57:39,355 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 01:57:39,355 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:57:39,404 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 01:57:39,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019444021] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:57:39,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:57:39,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-19 01:57:39,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585358554] [2024-11-19 01:57:39,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:57:39,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 01:57:39,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:57:39,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 01:57:39,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-11-19 01:57:39,407 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 46 [2024-11-19 01:57:39,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 45 transitions, 168 flow. Second operand has 10 states, 10 states have (on average 24.3) internal successors, (243), 10 states have internal predecessors, (243), 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,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:57:39,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 46 [2024-11-19 01:57:39,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:57:40,482 INFO L124 PetriNetUnfolderBase]: 9959/13623 cut-off events. [2024-11-19 01:57:40,482 INFO L125 PetriNetUnfolderBase]: For 3126/3126 co-relation queries the response was YES. [2024-11-19 01:57:40,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30412 conditions, 13623 events. 9959/13623 cut-off events. For 3126/3126 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 77422 event pairs, 5607 based on Foata normal form. 0/12986 useless extension candidates. Maximal degree in co-relation 13872. Up to 7481 conditions per place. [2024-11-19 01:57:40,620 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 56 selfloop transitions, 6 changer transitions 0/80 dead transitions. [2024-11-19 01:57:40,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 80 transitions, 368 flow [2024-11-19 01:57:40,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:57:40,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 01:57:40,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 209 transitions. [2024-11-19 01:57:40,623 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6490683229813664 [2024-11-19 01:57:40,624 INFO L175 Difference]: Start difference. First operand has 73 places, 45 transitions, 168 flow. Second operand 7 states and 209 transitions. [2024-11-19 01:57:40,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 80 transitions, 368 flow [2024-11-19 01:57:40,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 80 transitions, 359 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 01:57:40,650 INFO L231 Difference]: Finished difference. Result has 77 places, 48 transitions, 197 flow [2024-11-19 01:57:40,650 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=197, PETRI_PLACES=77, PETRI_TRANSITIONS=48} [2024-11-19 01:57:40,651 INFO L277 CegarLoopForPetriNet]: 59 programPoint places, 18 predicate places. [2024-11-19 01:57:40,651 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 48 transitions, 197 flow [2024-11-19 01:57:40,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 24.3) internal successors, (243), 10 states have internal predecessors, (243), 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,652 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:40,653 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:57:40,666 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:57:40,855 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,SelfDestructingSolverStorable14 [2024-11-19 01:57:40,855 INFO L396 AbstractCegarLoop]: === Iteration 6 === 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,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:40,856 INFO L85 PathProgramCache]: Analyzing trace with hash 789501541, now seen corresponding path program 2 times [2024-11-19 01:57:40,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:40,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944829149] [2024-11-19 01:57:40,856 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:57:40,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:40,894 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 01:57:40,894 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-19 01:57:40,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [998496559] [2024-11-19 01:57:40,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:57:40,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:57:40,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:57:40,900 INFO L229 MonitoredProcess]: Starting monitored process 7 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:40,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 01:57:40,977 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 01:57:40,977 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:57:40,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 01:57:40,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:57:41,028 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-19 01:57:41,028 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:57:41,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:57:41,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944829149] [2024-11-19 01:57:41,029 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 01:57:41,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998496559] [2024-11-19 01:57:41,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998496559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:57:41,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:57:41,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:57:41,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213602868] [2024-11-19 01:57:41,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:57:41,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:57:41,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:57:41,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:57:41,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:57:41,051 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2024-11-19 01:57:41,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 48 transitions, 197 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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:41,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:57:41,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2024-11-19 01:57:41,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:57:48,666 INFO L124 PetriNetUnfolderBase]: 67668/84251 cut-off events. [2024-11-19 01:57:48,667 INFO L125 PetriNetUnfolderBase]: For 72958/72958 co-relation queries the response was YES. [2024-11-19 01:57:49,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202180 conditions, 84251 events. 67668/84251 cut-off events. For 72958/72958 co-relation queries the response was YES. Maximal size of possible extension queue 3301. Compared 476706 event pairs, 20934 based on Foata normal form. 1296/85477 useless extension candidates. Maximal degree in co-relation 112307. Up to 76367 conditions per place. [2024-11-19 01:57:49,329 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 57 selfloop transitions, 5 changer transitions 21/96 dead transitions. [2024-11-19 01:57:49,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 96 transitions, 552 flow [2024-11-19 01:57:49,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:57:49,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 01:57:49,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 151 transitions. [2024-11-19 01:57:49,330 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6565217391304348 [2024-11-19 01:57:49,330 INFO L175 Difference]: Start difference. First operand has 77 places, 48 transitions, 197 flow. Second operand 5 states and 151 transitions. [2024-11-19 01:57:49,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 96 transitions, 552 flow [2024-11-19 01:57:49,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 96 transitions, 523 flow, removed 12 selfloop flow, removed 2 redundant places. [2024-11-19 01:57:49,374 INFO L231 Difference]: Finished difference. Result has 82 places, 52 transitions, 227 flow [2024-11-19 01:57:49,374 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=227, PETRI_PLACES=82, PETRI_TRANSITIONS=52} [2024-11-19 01:57:49,375 INFO L277 CegarLoopForPetriNet]: 59 programPoint places, 23 predicate places. [2024-11-19 01:57:49,375 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 52 transitions, 227 flow [2024-11-19 01:57:49,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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:49,375 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:49,375 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:57:49,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 01:57:49,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-19 01:57:49,576 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:57:49,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:49,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1483781436, now seen corresponding path program 1 times [2024-11-19 01:57:49,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:49,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473231811] [2024-11-19 01:57:49,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:49,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 01:57:49,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2066895440] [2024-11-19 01:57:49,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:49,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:57:49,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:57:49,620 INFO L229 MonitoredProcess]: Starting monitored process 8 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:49,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 01:57:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:49,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 01:57:49,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:57:49,794 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 01:57:49,795 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:57:49,887 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 01:57:49,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:57:49,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473231811] [2024-11-19 01:57:49,891 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 01:57:49,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066895440] [2024-11-19 01:57:49,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066895440] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:57:49,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:57:49,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2024-11-19 01:57:49,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918238888] [2024-11-19 01:57:49,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:57:49,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:57:49,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:57:49,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:57:49,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:57:49,898 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 46 [2024-11-19 01:57:49,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 52 transitions, 227 flow. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 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:49,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:57:49,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 46 [2024-11-19 01:57:49,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:57:53,164 INFO L124 PetriNetUnfolderBase]: 27419/35645 cut-off events. [2024-11-19 01:57:53,165 INFO L125 PetriNetUnfolderBase]: For 32308/34656 co-relation queries the response was YES. [2024-11-19 01:57:53,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91015 conditions, 35645 events. 27419/35645 cut-off events. For 32308/34656 co-relation queries the response was YES. Maximal size of possible extension queue 2197. Compared 222860 event pairs, 10017 based on Foata normal form. 1488/32510 useless extension candidates. Maximal degree in co-relation 90995. Up to 17952 conditions per place. [2024-11-19 01:57:53,386 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 0 selfloop transitions, 0 changer transitions 66/66 dead transitions. [2024-11-19 01:57:53,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 66 transitions, 343 flow [2024-11-19 01:57:53,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:57:53,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 01:57:53,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2024-11-19 01:57:53,387 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6521739130434783 [2024-11-19 01:57:53,388 INFO L175 Difference]: Start difference. First operand has 82 places, 52 transitions, 227 flow. Second operand 4 states and 120 transitions. [2024-11-19 01:57:53,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 66 transitions, 343 flow [2024-11-19 01:57:53,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 66 transitions, 330 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-11-19 01:57:53,724 INFO L231 Difference]: Finished difference. Result has 79 places, 0 transitions, 0 flow [2024-11-19 01:57:53,724 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=79, PETRI_TRANSITIONS=0} [2024-11-19 01:57:53,724 INFO L277 CegarLoopForPetriNet]: 59 programPoint places, 20 predicate places. [2024-11-19 01:57:53,725 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 0 transitions, 0 flow [2024-11-19 01:57:53,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 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:53,725 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-11-19 01:57:53,725 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-11-19 01:57:53,725 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-19 01:57:53,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-19 01:57:53,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:57:53,927 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2024-11-19 01:57:53,930 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances [2024-11-19 01:57:53,930 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 01:57:53,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:57:53 BasicIcfg [2024-11-19 01:57:53,951 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 01:57:53,952 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 01:57:53,952 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 01:57:53,952 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 01:57:53,953 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:57:29" (3/4) ... [2024-11-19 01:57:53,955 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 01:57:53,964 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure f1 [2024-11-19 01:57:53,964 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure f2 [2024-11-19 01:57:53,967 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 49 nodes and edges [2024-11-19 01:57:53,968 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-19 01:57:53,968 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-19 01:57:53,968 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-19 01:57:54,052 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 01:57:54,055 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 01:57:54,056 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 01:57:54,056 INFO L158 Benchmark]: Toolchain (without parser) took 25689.70ms. Allocated memory was 167.8MB in the beginning and 9.5GB in the end (delta: 9.4GB). Free memory was 110.2MB in the beginning and 7.9GB in the end (delta: -7.8GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-11-19 01:57:54,056 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 134.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:57:54,057 INFO L158 Benchmark]: CACSL2BoogieTranslator took 577.22ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 87.2MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-19 01:57:54,057 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.08ms. Allocated memory is still 167.8MB. Free memory was 87.2MB in the beginning and 85.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:57:54,057 INFO L158 Benchmark]: Boogie Preprocessor took 58.60ms. Allocated memory is still 167.8MB. Free memory was 85.0MB in the beginning and 83.0MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:57:54,057 INFO L158 Benchmark]: RCFGBuilder took 504.18ms. Allocated memory is still 167.8MB. Free memory was 83.0MB in the beginning and 62.9MB in the end (delta: 20.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 01:57:54,058 INFO L158 Benchmark]: TraceAbstraction took 24383.40ms. Allocated memory was 167.8MB in the beginning and 9.5GB in the end (delta: 9.4GB). Free memory was 62.0MB in the beginning and 7.9GB in the end (delta: -7.8GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-11-19 01:57:54,058 INFO L158 Benchmark]: Witness Printer took 103.85ms. Allocated memory is still 9.5GB. Free memory was 7.9GB in the beginning and 7.9GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:57:54,059 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 134.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 577.22ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 87.2MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.08ms. Allocated memory is still 167.8MB. Free memory was 87.2MB in the beginning and 85.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.60ms. Allocated memory is still 167.8MB. Free memory was 85.0MB in the beginning and 83.0MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 504.18ms. Allocated memory is still 167.8MB. Free memory was 83.0MB in the beginning and 62.9MB in the end (delta: 20.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 24383.40ms. Allocated memory was 167.8MB in the beginning and 9.5GB in the end (delta: 9.4GB). Free memory was 62.0MB in the beginning and 7.9GB in the end (delta: -7.8GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 103.85ms. Allocated memory is still 9.5GB. Free memory was 7.9GB in the beginning and 7.9GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 753]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 30 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19 IncrementalHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 0 mSDtfsCounter, 19 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=1, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 13 NumberOfCodeBlocks, 13 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 10 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 38 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.2s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 45 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 45 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 95 IncrementalHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 0 mSDtfsCounter, 95 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 159 SizeOfPredicates, 2 NumberOfNonLiveVariables, 74 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 4/7 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 9 procedures, 46 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.5s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 68 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 68 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 124 IncrementalHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 0 mSDtfsCounter, 124 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=2, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 159 SizeOfPredicates, 2 NumberOfNonLiveVariables, 74 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 4/7 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 4 thread instances CFG has 11 procedures, 54 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.9s, OverallIterations: 7, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 18.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 255 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 243 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 644 IncrementalHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 3 mSDtfsCounter, 644 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227occurred in iteration=6, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 255 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 902 SizeOfPredicates, 13 NumberOfNonLiveVariables, 624 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 13 InterpolantComputations, 5 PerfectInterpolantSequences, 294/320 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-19 01:57:54,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE