./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/29_conditionals_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/29_conditionals_vs.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 c3f647420f42d7fdb333957b618cdd528a4c5a4cecdb35105a1a2630df70b3d6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:10:01,931 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:10:01,999 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 10:10:02,007 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:10:02,010 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:10:02,041 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:10:02,042 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:10:02,043 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:10:02,043 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:10:02,044 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:10:02,044 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:10:02,044 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:10:02,045 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:10:02,045 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:10:02,046 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:10:02,046 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:10:02,047 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:10:02,047 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:10:02,047 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:10:02,048 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:10:02,048 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:10:02,051 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:10:02,052 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:10:02,052 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:10:02,052 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:10:02,052 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:10:02,053 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:10:02,053 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:10:02,053 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:10:02,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:10:02,054 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:10:02,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:10:02,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:10:02,055 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:10:02,056 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:10:02,056 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:10:02,056 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:10:02,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:10:02,057 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:10:02,057 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:10:02,057 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:10:02,058 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:10:02,058 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 -> c3f647420f42d7fdb333957b618cdd528a4c5a4cecdb35105a1a2630df70b3d6 [2024-11-10 10:10:02,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:10:02,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:10:02,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:10:02,347 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:10:02,347 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:10:02,349 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/29_conditionals_vs.i [2024-11-10 10:10:03,816 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:10:04,049 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:10:04,050 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/29_conditionals_vs.i [2024-11-10 10:10:04,062 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e7cf418f/830c28cd860847589695a9b5b199cace/FLAG7ca36b500 [2024-11-10 10:10:04,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e7cf418f/830c28cd860847589695a9b5b199cace [2024-11-10 10:10:04,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:10:04,081 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:10:04,083 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:10:04,083 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:10:04,087 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:10:04,088 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:10:04" (1/1) ... [2024-11-10 10:10:04,089 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@602e29dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:10:04, skipping insertion in model container [2024-11-10 10:10:04,089 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:10:04" (1/1) ... [2024-11-10 10:10:04,137 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:10:04,464 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-ext/29_conditionals_vs.i[30422,30435] [2024-11-10 10:10:04,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:10:04,487 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:10:04,540 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-ext/29_conditionals_vs.i[30422,30435] [2024-11-10 10:10:04,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:10:04,582 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:10:04,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:10:04 WrapperNode [2024-11-10 10:10:04,583 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:10:04,584 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:10:04,585 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:10:04,585 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:10:04,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:10:04" (1/1) ... [2024-11-10 10:10:04,605 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:10:04" (1/1) ... [2024-11-10 10:10:04,625 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 57 [2024-11-10 10:10:04,626 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:10:04,627 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:10:04,627 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:10:04,627 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:10:04,636 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:10:04" (1/1) ... [2024-11-10 10:10:04,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:10:04" (1/1) ... [2024-11-10 10:10:04,639 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:10:04" (1/1) ... [2024-11-10 10:10:04,656 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-10 10:10:04,657 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:10:04" (1/1) ... [2024-11-10 10:10:04,657 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:10:04" (1/1) ... [2024-11-10 10:10:04,663 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:10:04" (1/1) ... [2024-11-10 10:10:04,667 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:10:04" (1/1) ... [2024-11-10 10:10:04,668 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:10:04" (1/1) ... [2024-11-10 10:10:04,669 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:10:04" (1/1) ... [2024-11-10 10:10:04,671 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:10:04,674 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:10:04,674 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:10:04,674 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:10:04,675 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:10:04" (1/1) ... [2024-11-10 10:10:04,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:10:04,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:10:04,710 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 10:10:04,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 10:10:04,756 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-10 10:10:04,757 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-10 10:10:04,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:10:04,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 10:10:04,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:10:04,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:10:04,760 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 10:10:04,869 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:10:04,871 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:10:05,001 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 10:10:05,002 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:10:05,088 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:10:05,089 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:10:05,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:10:05 BoogieIcfgContainer [2024-11-10 10:10:05,089 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:10:05,092 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:10:05,092 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:10:05,095 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:10:05,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:10:04" (1/3) ... [2024-11-10 10:10:05,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4078f0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:10:05, skipping insertion in model container [2024-11-10 10:10:05,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:10:04" (2/3) ... [2024-11-10 10:10:05,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4078f0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:10:05, skipping insertion in model container [2024-11-10 10:10:05,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:10:05" (3/3) ... [2024-11-10 10:10:05,098 INFO L112 eAbstractionObserver]: Analyzing ICFG 29_conditionals_vs.i [2024-11-10 10:10:05,113 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:10:05,114 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 10:10:05,114 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 10:10:05,170 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 10:10:05,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 23 transitions, 50 flow [2024-11-10 10:10:05,243 INFO L124 PetriNetUnfolderBase]: 5/28 cut-off events. [2024-11-10 10:10:05,247 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:10:05,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 28 events. 5/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 33 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 20. Up to 4 conditions per place. [2024-11-10 10:10:05,253 INFO L82 GeneralOperation]: Start removeDead. Operand has 22 places, 23 transitions, 50 flow [2024-11-10 10:10:05,257 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 23 transitions, 50 flow [2024-11-10 10:10:05,270 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:10:05,280 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;@27977f49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:10:05,281 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-10 10:10:05,290 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:10:05,294 INFO L124 PetriNetUnfolderBase]: 2/16 cut-off events. [2024-11-10 10:10:05,294 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:10:05,294 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:10:05,295 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1] [2024-11-10 10:10:05,296 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:10:05,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:10:05,303 INFO L85 PathProgramCache]: Analyzing trace with hash 156643471, now seen corresponding path program 1 times [2024-11-10 10:10:05,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:10:05,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155978515] [2024-11-10 10:10:05,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:10:05,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:10:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:10:05,430 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 10:10:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:10:05,464 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 10:10:05,465 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 10:10:05,466 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-11-10 10:10:05,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-11-10 10:10:05,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-11-10 10:10:05,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:10:05,468 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-10 10:10:05,471 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 10:10:05,471 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-10 10:10:05,499 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 10:10:05,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 38 transitions, 86 flow [2024-11-10 10:10:05,533 INFO L124 PetriNetUnfolderBase]: 9/49 cut-off events. [2024-11-10 10:10:05,533 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 10:10:05,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 49 events. 9/49 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 98 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 34. Up to 6 conditions per place. [2024-11-10 10:10:05,534 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 38 transitions, 86 flow [2024-11-10 10:10:05,535 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 38 transitions, 86 flow [2024-11-10 10:10:05,537 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:10:05,541 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;@27977f49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:10:05,541 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-10 10:10:05,553 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:10:05,553 INFO L124 PetriNetUnfolderBase]: 6/32 cut-off events. [2024-11-10 10:10:05,554 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 10:10:05,554 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:10:05,554 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:10:05,559 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-10 10:10:05,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:10:05,560 INFO L85 PathProgramCache]: Analyzing trace with hash 434707014, now seen corresponding path program 1 times [2024-11-10 10:10:05,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:10:05,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350069593] [2024-11-10 10:10:05,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:10:05,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:10:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:10:05,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:10:05,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:10:05,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350069593] [2024-11-10 10:10:05,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350069593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:10:05,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:10:05,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:10:05,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908055572] [2024-11-10 10:10:05,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:10:05,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:10:05,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:10:05,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:10:05,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:10:05,875 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 38 [2024-11-10 10:10:05,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 38 transitions, 86 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-10 10:10:05,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:10:05,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 38 [2024-11-10 10:10:05,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:10:06,093 INFO L124 PetriNetUnfolderBase]: 358/737 cut-off events. [2024-11-10 10:10:06,094 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-11-10 10:10:06,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1373 conditions, 737 events. 358/737 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4128 event pairs, 70 based on Foata normal form. 133/822 useless extension candidates. Maximal degree in co-relation 943. Up to 255 conditions per place. [2024-11-10 10:10:06,107 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 34 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2024-11-10 10:10:06,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 50 transitions, 194 flow [2024-11-10 10:10:06,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:10:06,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:10:06,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2024-11-10 10:10:06,121 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6578947368421053 [2024-11-10 10:10:06,122 INFO L175 Difference]: Start difference. First operand has 36 places, 38 transitions, 86 flow. Second operand 4 states and 100 transitions. [2024-11-10 10:10:06,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 50 transitions, 194 flow [2024-11-10 10:10:06,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 50 transitions, 194 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:10:06,128 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 80 flow [2024-11-10 10:10:06,130 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2024-11-10 10:10:06,133 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2024-11-10 10:10:06,133 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 80 flow [2024-11-10 10:10:06,133 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-10 10:10:06,133 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:10:06,133 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:10:06,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:10:06,134 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-10 10:10:06,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:10:06,134 INFO L85 PathProgramCache]: Analyzing trace with hash 434738727, now seen corresponding path program 1 times [2024-11-10 10:10:06,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:10:06,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593789750] [2024-11-10 10:10:06,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:10:06,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:10:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:10:06,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:10:06,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:10:06,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593789750] [2024-11-10 10:10:06,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593789750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:10:06,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:10:06,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:10:06,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878430139] [2024-11-10 10:10:06,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:10:06,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:10:06,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:10:06,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:10:06,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:10:06,249 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2024-11-10 10:10:06,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:10:06,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:10:06,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2024-11-10 10:10:06,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:10:06,390 INFO L124 PetriNetUnfolderBase]: 358/674 cut-off events. [2024-11-10 10:10:06,391 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2024-11-10 10:10:06,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1353 conditions, 674 events. 358/674 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3459 event pairs, 70 based on Foata normal form. 21/665 useless extension candidates. Maximal degree in co-relation 925. Up to 255 conditions per place. [2024-11-10 10:10:06,399 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 35 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2024-11-10 10:10:06,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 47 transitions, 192 flow [2024-11-10 10:10:06,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:10:06,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:10:06,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2024-11-10 10:10:06,405 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5657894736842105 [2024-11-10 10:10:06,405 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 80 flow. Second operand 4 states and 86 transitions. [2024-11-10 10:10:06,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 47 transitions, 192 flow [2024-11-10 10:10:06,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 47 transitions, 189 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:10:06,408 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 73 flow [2024-11-10 10:10:06,408 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=73, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2024-11-10 10:10:06,409 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2024-11-10 10:10:06,409 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 73 flow [2024-11-10 10:10:06,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:10:06,409 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:10:06,409 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2024-11-10 10:10:06,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 10:10:06,410 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-10 10:10:06,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:10:06,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1131702290, now seen corresponding path program 1 times [2024-11-10 10:10:06,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:10:06,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945212372] [2024-11-10 10:10:06,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:10:06,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:10:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:10:06,448 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 10:10:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:10:06,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 10:10:06,463 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 10:10:06,464 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-11-10 10:10:06,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-11-10 10:10:06,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-11-10 10:10:06,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-11-10 10:10:06,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 10:10:06,465 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 10:10:06,466 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 10:10:06,466 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-10 10:10:06,498 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 10:10:06,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 53 transitions, 124 flow [2024-11-10 10:10:06,507 INFO L124 PetriNetUnfolderBase]: 13/70 cut-off events. [2024-11-10 10:10:06,507 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-10 10:10:06,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 70 events. 13/70 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 154 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 56. Up to 8 conditions per place. [2024-11-10 10:10:06,507 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 53 transitions, 124 flow [2024-11-10 10:10:06,508 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 53 transitions, 124 flow [2024-11-10 10:10:06,509 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:10:06,510 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;@27977f49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:10:06,510 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-10 10:10:06,515 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:10:06,515 INFO L124 PetriNetUnfolderBase]: 6/35 cut-off events. [2024-11-10 10:10:06,515 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 10:10:06,515 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:10:06,515 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:10:06,516 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-10 10:10:06,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:10:06,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1280368243, now seen corresponding path program 1 times [2024-11-10 10:10:06,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:10:06,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532787768] [2024-11-10 10:10:06,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:10:06,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:10:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:10:06,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:10:06,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:10:06,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532787768] [2024-11-10 10:10:06,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532787768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:10:06,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:10:06,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:10:06,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629494272] [2024-11-10 10:10:06,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:10:06,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:10:06,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:10:06,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:10:06,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:10:06,623 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 53 [2024-11-10 10:10:06,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 53 transitions, 124 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-10 10:10:06,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:10:06,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 53 [2024-11-10 10:10:06,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:10:07,284 INFO L124 PetriNetUnfolderBase]: 3436/5733 cut-off events. [2024-11-10 10:10:07,286 INFO L125 PetriNetUnfolderBase]: For 500/500 co-relation queries the response was YES. [2024-11-10 10:10:07,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10942 conditions, 5733 events. 3436/5733 cut-off events. For 500/500 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 38830 event pairs, 736 based on Foata normal form. 1026/6446 useless extension candidates. Maximal degree in co-relation 2221. Up to 2085 conditions per place. [2024-11-10 10:10:07,334 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 52 selfloop transitions, 3 changer transitions 0/76 dead transitions. [2024-11-10 10:10:07,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 76 transitions, 304 flow [2024-11-10 10:10:07,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:10:07,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:10:07,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2024-11-10 10:10:07,337 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7216981132075472 [2024-11-10 10:10:07,337 INFO L175 Difference]: Start difference. First operand has 50 places, 53 transitions, 124 flow. Second operand 4 states and 153 transitions. [2024-11-10 10:10:07,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 76 transitions, 304 flow [2024-11-10 10:10:07,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 76 transitions, 298 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-11-10 10:10:07,340 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 114 flow [2024-11-10 10:10:07,340 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2024-11-10 10:10:07,341 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2024-11-10 10:10:07,341 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 114 flow [2024-11-10 10:10:07,341 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-10 10:10:07,341 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:10:07,341 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:10:07,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 10:10:07,342 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-10 10:10:07,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:10:07,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1280336530, now seen corresponding path program 1 times [2024-11-10 10:10:07,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:10:07,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461878024] [2024-11-10 10:10:07,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:10:07,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:10:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:10:07,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:10:07,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:10:07,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461878024] [2024-11-10 10:10:07,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461878024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:10:07,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:10:07,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:10:07,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753832428] [2024-11-10 10:10:07,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:10:07,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:10:07,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:10:07,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:10:07,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:10:07,407 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 53 [2024-11-10 10:10:07,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:10:07,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:10:07,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 53 [2024-11-10 10:10:07,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:10:07,971 INFO L124 PetriNetUnfolderBase]: 3436/5346 cut-off events. [2024-11-10 10:10:07,971 INFO L125 PetriNetUnfolderBase]: For 413/413 co-relation queries the response was YES. [2024-11-10 10:10:07,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10742 conditions, 5346 events. 3436/5346 cut-off events. For 413/413 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 33014 event pairs, 736 based on Foata normal form. 129/5273 useless extension candidates. Maximal degree in co-relation 8550. Up to 2085 conditions per place. [2024-11-10 10:10:08,021 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 53 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2024-11-10 10:10:08,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 73 transitions, 296 flow [2024-11-10 10:10:08,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:10:08,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:10:08,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2024-11-10 10:10:08,025 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6415094339622641 [2024-11-10 10:10:08,025 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 114 flow. Second operand 4 states and 136 transitions. [2024-11-10 10:10:08,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 73 transitions, 296 flow [2024-11-10 10:10:08,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 73 transitions, 293 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:10:08,031 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 107 flow [2024-11-10 10:10:08,032 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=107, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2024-11-10 10:10:08,033 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2024-11-10 10:10:08,036 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 107 flow [2024-11-10 10:10:08,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:10:08,036 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:10:08,037 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:10:08,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 10:10:08,037 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-10 10:10:08,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:10:08,037 INFO L85 PathProgramCache]: Analyzing trace with hash 525822342, now seen corresponding path program 1 times [2024-11-10 10:10:08,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:10:08,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221679432] [2024-11-10 10:10:08,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:10:08,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:10:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:10:08,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 10:10:08,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:10:08,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221679432] [2024-11-10 10:10:08,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221679432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:10:08,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:10:08,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:10:08,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376750424] [2024-11-10 10:10:08,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:10:08,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:10:08,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:10:08,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:10:08,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:10:08,120 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 53 [2024-11-10 10:10:08,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:10:08,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:10:08,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 53 [2024-11-10 10:10:08,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:10:08,894 INFO L124 PetriNetUnfolderBase]: 4642/7689 cut-off events. [2024-11-10 10:10:08,894 INFO L125 PetriNetUnfolderBase]: For 620/620 co-relation queries the response was YES. [2024-11-10 10:10:08,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14810 conditions, 7689 events. 4642/7689 cut-off events. For 620/620 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 54135 event pairs, 1015 based on Foata normal form. 0/7050 useless extension candidates. Maximal degree in co-relation 5138. Up to 2775 conditions per place. [2024-11-10 10:10:09,000 INFO L140 encePairwiseOnDemand]: 49/53 looper letters, 50 selfloop transitions, 3 changer transitions 0/70 dead transitions. [2024-11-10 10:10:09,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 70 transitions, 281 flow [2024-11-10 10:10:09,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:10:09,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:10:09,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2024-11-10 10:10:09,002 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6509433962264151 [2024-11-10 10:10:09,002 INFO L175 Difference]: Start difference. First operand has 49 places, 43 transitions, 107 flow. Second operand 4 states and 138 transitions. [2024-11-10 10:10:09,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 70 transitions, 281 flow [2024-11-10 10:10:09,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 70 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:10:09,008 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 108 flow [2024-11-10 10:10:09,008 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2024-11-10 10:10:09,009 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 0 predicate places. [2024-11-10 10:10:09,009 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 108 flow [2024-11-10 10:10:09,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:10:09,010 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:10:09,010 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:10:09,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 10:10:09,010 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-10 10:10:09,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:10:09,011 INFO L85 PathProgramCache]: Analyzing trace with hash 525854055, now seen corresponding path program 1 times [2024-11-10 10:10:09,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:10:09,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233995714] [2024-11-10 10:10:09,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:10:09,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:10:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:10:09,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 10:10:09,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:10:09,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233995714] [2024-11-10 10:10:09,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233995714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:10:09,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:10:09,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:10:09,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231643633] [2024-11-10 10:10:09,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:10:09,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:10:09,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:10:09,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:10:09,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:10:09,081 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 53 [2024-11-10 10:10:09,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:10:09,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:10:09,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 53 [2024-11-10 10:10:09,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:10:09,663 INFO L124 PetriNetUnfolderBase]: 4642/7185 cut-off events. [2024-11-10 10:10:09,663 INFO L125 PetriNetUnfolderBase]: For 518/518 co-relation queries the response was YES. [2024-11-10 10:10:09,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14387 conditions, 7185 events. 4642/7185 cut-off events. For 518/518 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 46164 event pairs, 1015 based on Foata normal form. 168/6855 useless extension candidates. Maximal degree in co-relation 5044. Up to 2775 conditions per place. [2024-11-10 10:10:09,706 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 51 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2024-11-10 10:10:09,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 67 transitions, 272 flow [2024-11-10 10:10:09,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:10:09,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:10:09,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2024-11-10 10:10:09,707 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6320754716981132 [2024-11-10 10:10:09,707 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 108 flow. Second operand 4 states and 134 transitions. [2024-11-10 10:10:09,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 67 transitions, 272 flow [2024-11-10 10:10:09,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 67 transitions, 269 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:10:09,712 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 101 flow [2024-11-10 10:10:09,712 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2024-11-10 10:10:09,713 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2024-11-10 10:10:09,713 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 101 flow [2024-11-10 10:10:09,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:10:09,713 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:10:09,713 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1] [2024-11-10 10:10:09,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 10:10:09,714 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-10 10:10:09,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:10:09,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1091304114, now seen corresponding path program 1 times [2024-11-10 10:10:09,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:10:09,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869371780] [2024-11-10 10:10:09,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:10:09,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:10:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:10:09,725 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 10:10:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:10:09,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 10:10:09,739 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 10:10:09,739 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-11-10 10:10:09,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-11-10 10:10:09,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-11-10 10:10:09,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-11-10 10:10:09,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-11-10 10:10:09,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 10:10:09,742 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-10 10:10:09,743 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 10:10:09,743 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-10 10:10:09,776 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 10:10:09,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 68 transitions, 164 flow [2024-11-10 10:10:09,788 INFO L124 PetriNetUnfolderBase]: 17/91 cut-off events. [2024-11-10 10:10:09,788 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-10 10:10:09,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 91 events. 17/91 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 210 event pairs, 0 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 82. Up to 10 conditions per place. [2024-11-10 10:10:09,789 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 68 transitions, 164 flow [2024-11-10 10:10:09,790 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 68 transitions, 164 flow [2024-11-10 10:10:09,791 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:10:09,792 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;@27977f49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:10:09,792 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-10 10:10:09,795 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:10:09,797 INFO L124 PetriNetUnfolderBase]: 6/32 cut-off events. [2024-11-10 10:10:09,797 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 10:10:09,797 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:10:09,797 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:10:09,797 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-10 10:10:09,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:10:09,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1318383185, now seen corresponding path program 1 times [2024-11-10 10:10:09,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:10:09,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899501076] [2024-11-10 10:10:09,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:10:09,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:10:09,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:10:09,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:10:09,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:10:09,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899501076] [2024-11-10 10:10:09,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899501076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:10:09,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:10:09,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:10:09,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907864044] [2024-11-10 10:10:09,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:10:09,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:10:09,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:10:09,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:10:09,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:10:09,863 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 68 [2024-11-10 10:10:09,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 68 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:10:09,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:10:09,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 68 [2024-11-10 10:10:09,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:10:13,551 INFO L124 PetriNetUnfolderBase]: 28384/42186 cut-off events. [2024-11-10 10:10:13,552 INFO L125 PetriNetUnfolderBase]: For 5255/5255 co-relation queries the response was YES. [2024-11-10 10:10:13,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81740 conditions, 42186 events. 28384/42186 cut-off events. For 5255/5255 co-relation queries the response was YES. Maximal size of possible extension queue 1692. Compared 315689 event pairs, 6352 based on Foata normal form. 7689/47979 useless extension candidates. Maximal degree in co-relation 10922. Up to 15765 conditions per place. [2024-11-10 10:10:13,916 INFO L140 encePairwiseOnDemand]: 58/68 looper letters, 70 selfloop transitions, 3 changer transitions 0/102 dead transitions. [2024-11-10 10:10:13,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 102 transitions, 420 flow [2024-11-10 10:10:13,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:10:13,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:10:13,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 206 transitions. [2024-11-10 10:10:13,918 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7573529411764706 [2024-11-10 10:10:13,918 INFO L175 Difference]: Start difference. First operand has 64 places, 68 transitions, 164 flow. Second operand 4 states and 206 transitions. [2024-11-10 10:10:13,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 102 transitions, 420 flow [2024-11-10 10:10:13,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 102 transitions, 402 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-10 10:10:13,927 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 148 flow [2024-11-10 10:10:13,927 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2024-11-10 10:10:13,928 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 1 predicate places. [2024-11-10 10:10:13,928 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 148 flow [2024-11-10 10:10:13,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:10:13,929 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:10:13,929 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:10:13,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 10:10:13,929 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-10 10:10:13,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:10:13,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1318414898, now seen corresponding path program 1 times [2024-11-10 10:10:13,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:10:13,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432592102] [2024-11-10 10:10:13,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:10:13,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:10:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:10:14,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:10:14,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:10:14,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432592102] [2024-11-10 10:10:14,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432592102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:10:14,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:10:14,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:10:14,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533562304] [2024-11-10 10:10:14,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:10:14,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:10:14,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:10:14,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:10:14,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:10:14,106 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 68 [2024-11-10 10:10:14,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:10:14,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:10:14,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 68 [2024-11-10 10:10:14,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:10:16,857 INFO L124 PetriNetUnfolderBase]: 28384/39855 cut-off events. [2024-11-10 10:10:16,858 INFO L125 PetriNetUnfolderBase]: For 2822/2822 co-relation queries the response was YES. [2024-11-10 10:10:16,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80028 conditions, 39855 events. 28384/39855 cut-off events. For 2822/2822 co-relation queries the response was YES. Maximal size of possible extension queue 1519. Compared 270605 event pairs, 6352 based on Foata normal form. 777/39405 useless extension candidates. Maximal degree in co-relation 65100. Up to 15765 conditions per place. [2024-11-10 10:10:17,148 INFO L140 encePairwiseOnDemand]: 65/68 looper letters, 71 selfloop transitions, 2 changer transitions 0/99 dead transitions. [2024-11-10 10:10:17,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 99 transitions, 400 flow [2024-11-10 10:10:17,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:10:17,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:10:17,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2024-11-10 10:10:17,150 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6838235294117647 [2024-11-10 10:10:17,150 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 148 flow. Second operand 4 states and 186 transitions. [2024-11-10 10:10:17,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 99 transitions, 400 flow [2024-11-10 10:10:17,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 99 transitions, 397 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:10:17,160 INFO L231 Difference]: Finished difference. Result has 63 places, 57 transitions, 141 flow [2024-11-10 10:10:17,160 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=141, PETRI_PLACES=63, PETRI_TRANSITIONS=57} [2024-11-10 10:10:17,163 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, -1 predicate places. [2024-11-10 10:10:17,163 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 57 transitions, 141 flow [2024-11-10 10:10:17,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:10:17,164 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:10:17,164 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:10:17,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 10:10:17,164 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-10 10:10:17,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:10:17,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1763978333, now seen corresponding path program 1 times [2024-11-10 10:10:17,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:10:17,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803860459] [2024-11-10 10:10:17,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:10:17,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:10:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:10:17,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 10:10:17,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:10:17,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803860459] [2024-11-10 10:10:17,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803860459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:10:17,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:10:17,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:10:17,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236163133] [2024-11-10 10:10:17,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:10:17,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:10:17,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:10:17,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:10:17,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:10:17,223 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 68 [2024-11-10 10:10:17,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 141 flow. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:10:17,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:10:17,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 68 [2024-11-10 10:10:17,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:10:20,553 INFO L124 PetriNetUnfolderBase]: 41545/59928 cut-off events. [2024-11-10 10:10:20,553 INFO L125 PetriNetUnfolderBase]: For 4541/4541 co-relation queries the response was YES. [2024-11-10 10:10:20,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117954 conditions, 59928 events. 41545/59928 cut-off events. For 4541/4541 co-relation queries the response was YES. Maximal size of possible extension queue 2410. Compared 448793 event pairs, 8611 based on Foata normal form. 0/54568 useless extension candidates. Maximal degree in co-relation 41501. Up to 21195 conditions per place. [2024-11-10 10:10:21,208 INFO L140 encePairwiseOnDemand]: 64/68 looper letters, 69 selfloop transitions, 3 changer transitions 0/96 dead transitions. [2024-11-10 10:10:21,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 96 transitions, 387 flow [2024-11-10 10:10:21,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:10:21,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:10:21,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 185 transitions. [2024-11-10 10:10:21,210 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6801470588235294 [2024-11-10 10:10:21,210 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 141 flow. Second operand 4 states and 185 transitions. [2024-11-10 10:10:21,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 96 transitions, 387 flow [2024-11-10 10:10:21,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 96 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:10:21,218 INFO L231 Difference]: Finished difference. Result has 64 places, 56 transitions, 142 flow [2024-11-10 10:10:21,221 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=64, PETRI_TRANSITIONS=56} [2024-11-10 10:10:21,222 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 0 predicate places. [2024-11-10 10:10:21,222 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 56 transitions, 142 flow [2024-11-10 10:10:21,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:10:21,223 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:10:21,223 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:10:21,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 10:10:21,223 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-10 10:10:21,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:10:21,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1763946620, now seen corresponding path program 1 times [2024-11-10 10:10:21,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:10:21,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678903362] [2024-11-10 10:10:21,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:10:21,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:10:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:10:21,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 10:10:21,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:10:21,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678903362] [2024-11-10 10:10:21,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678903362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:10:21,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:10:21,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:10:21,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847122131] [2024-11-10 10:10:21,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:10:21,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:10:21,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:10:21,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:10:21,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:10:21,291 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 68 [2024-11-10 10:10:21,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 56 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:10:21,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:10:21,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 68 [2024-11-10 10:10:21,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:10:24,377 INFO L124 PetriNetUnfolderBase]: 35131/50418 cut-off events. [2024-11-10 10:10:24,378 INFO L125 PetriNetUnfolderBase]: For 3542/3542 co-relation queries the response was YES. [2024-11-10 10:10:24,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100014 conditions, 50418 events. 35131/50418 cut-off events. For 3542/3542 co-relation queries the response was YES. Maximal size of possible extension queue 2034. Compared 365859 event pairs, 8611 based on Foata normal form. 1032/48553 useless extension candidates. Maximal degree in co-relation 35695. Up to 16956 conditions per place. [2024-11-10 10:10:24,647 INFO L140 encePairwiseOnDemand]: 65/68 looper letters, 68 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2024-11-10 10:10:24,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 93 transitions, 374 flow [2024-11-10 10:10:24,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:10:24,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:10:24,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2024-11-10 10:10:24,649 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6875 [2024-11-10 10:10:24,649 INFO L175 Difference]: Start difference. First operand has 64 places, 56 transitions, 142 flow. Second operand 4 states and 187 transitions. [2024-11-10 10:10:24,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 93 transitions, 374 flow [2024-11-10 10:10:24,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 93 transitions, 371 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:10:24,664 INFO L231 Difference]: Finished difference. Result has 62 places, 53 transitions, 135 flow [2024-11-10 10:10:24,664 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=62, PETRI_TRANSITIONS=53} [2024-11-10 10:10:24,664 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, -2 predicate places. [2024-11-10 10:10:24,665 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 135 flow [2024-11-10 10:10:24,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:10:24,665 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:10:24,665 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:10:24,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 10:10:24,666 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-10 10:10:24,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:10:24,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1695997390, now seen corresponding path program 1 times [2024-11-10 10:10:24,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:10:24,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415822017] [2024-11-10 10:10:24,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:10:24,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:10:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:10:24,714 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-10 10:10:24,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:10:24,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415822017] [2024-11-10 10:10:24,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415822017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:10:24,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:10:24,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:10:24,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238507158] [2024-11-10 10:10:24,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:10:24,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:10:24,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:10:24,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:10:24,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:10:24,725 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 68 [2024-11-10 10:10:24,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 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-10 10:10:24,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:10:24,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 68 [2024-11-10 10:10:24,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:10:29,439 INFO L124 PetriNetUnfolderBase]: 51430/75789 cut-off events. [2024-11-10 10:10:29,439 INFO L125 PetriNetUnfolderBase]: For 5582/5582 co-relation queries the response was YES. [2024-11-10 10:10:29,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147024 conditions, 75789 events. 51430/75789 cut-off events. For 5582/5582 co-relation queries the response was YES. Maximal size of possible extension queue 3188. Compared 600925 event pairs, 11830 based on Foata normal form. 0/68623 useless extension candidates. Maximal degree in co-relation 52543. Up to 28080 conditions per place. [2024-11-10 10:10:29,890 INFO L140 encePairwiseOnDemand]: 64/68 looper letters, 66 selfloop transitions, 3 changer transitions 0/90 dead transitions. [2024-11-10 10:10:29,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 90 transitions, 361 flow [2024-11-10 10:10:29,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:10:29,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:10:29,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2024-11-10 10:10:29,891 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6838235294117647 [2024-11-10 10:10:29,891 INFO L175 Difference]: Start difference. First operand has 62 places, 53 transitions, 135 flow. Second operand 4 states and 186 transitions. [2024-11-10 10:10:29,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 90 transitions, 361 flow [2024-11-10 10:10:29,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 90 transitions, 354 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:10:29,908 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 136 flow [2024-11-10 10:10:29,908 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2024-11-10 10:10:29,909 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, -1 predicate places. [2024-11-10 10:10:29,909 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 136 flow [2024-11-10 10:10:29,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 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-10 10:10:29,909 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:10:29,910 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:10:29,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 10:10:29,910 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-10 10:10:29,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:10:29,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1696029103, now seen corresponding path program 1 times [2024-11-10 10:10:29,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:10:29,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173999431] [2024-11-10 10:10:29,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:10:29,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:10:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:10:29,954 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-10 10:10:29,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:10:29,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173999431] [2024-11-10 10:10:29,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173999431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:10:29,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:10:29,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:10:29,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628532344] [2024-11-10 10:10:29,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:10:29,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:10:29,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:10:29,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:10:29,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:10:29,963 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 68 [2024-11-10 10:10:29,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:10:29,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:10:29,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 68 [2024-11-10 10:10:29,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:10:34,408 INFO L124 PetriNetUnfolderBase]: 51430/71757 cut-off events. [2024-11-10 10:10:34,409 INFO L125 PetriNetUnfolderBase]: For 4760/4760 co-relation queries the response was YES. [2024-11-10 10:10:34,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143640 conditions, 71757 events. 51430/71757 cut-off events. For 4760/4760 co-relation queries the response was YES. Maximal size of possible extension queue 2896. Compared 514733 event pairs, 11830 based on Foata normal form. 1344/67069 useless extension candidates. Maximal degree in co-relation 51274. Up to 28080 conditions per place. [2024-11-10 10:10:34,775 INFO L140 encePairwiseOnDemand]: 65/68 looper letters, 67 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2024-11-10 10:10:34,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 87 transitions, 352 flow [2024-11-10 10:10:34,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:10:34,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:10:34,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 182 transitions. [2024-11-10 10:10:34,777 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6691176470588235 [2024-11-10 10:10:34,777 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 136 flow. Second operand 4 states and 182 transitions. [2024-11-10 10:10:34,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 87 transitions, 352 flow [2024-11-10 10:10:34,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 87 transitions, 349 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:10:34,828 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 129 flow [2024-11-10 10:10:34,828 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2024-11-10 10:10:34,829 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, -3 predicate places. [2024-11-10 10:10:34,829 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 129 flow [2024-11-10 10:10:34,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:10:34,829 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:10:34,829 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1] [2024-11-10 10:10:34,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 10:10:34,830 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-10 10:10:34,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:10:34,830 INFO L85 PathProgramCache]: Analyzing trace with hash 188562991, now seen corresponding path program 1 times [2024-11-10 10:10:34,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:10:34,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424302033] [2024-11-10 10:10:34,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:10:34,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:10:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:10:34,840 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 10:10:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:10:34,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 10:10:34,849 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 10:10:34,849 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-11-10 10:10:34,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-11-10 10:10:34,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2024-11-10 10:10:34,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-11-10 10:10:34,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-11-10 10:10:34,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-10 10:10:34,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 10:10:34,850 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:10:34,851 WARN L244 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 10:10:34,851 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-11-10 10:10:34,875 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 10:10:34,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 83 transitions, 206 flow [2024-11-10 10:10:34,885 INFO L124 PetriNetUnfolderBase]: 21/112 cut-off events. [2024-11-10 10:10:34,885 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-11-10 10:10:34,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 112 events. 21/112 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 281 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 109. Up to 12 conditions per place. [2024-11-10 10:10:34,886 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 83 transitions, 206 flow [2024-11-10 10:10:34,887 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 83 transitions, 206 flow [2024-11-10 10:10:34,888 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:10:34,888 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;@27977f49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:10:34,888 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-10 10:10:34,890 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:10:34,890 INFO L124 PetriNetUnfolderBase]: 6/35 cut-off events. [2024-11-10 10:10:34,891 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 10:10:34,891 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:10:34,891 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:10:34,891 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-10 10:10:34,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:10:34,891 INFO L85 PathProgramCache]: Analyzing trace with hash -221927384, now seen corresponding path program 1 times [2024-11-10 10:10:34,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:10:34,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362840018] [2024-11-10 10:10:34,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:10:34,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:10:34,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:10:34,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:10:34,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:10:34,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362840018] [2024-11-10 10:10:34,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362840018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:10:34,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:10:34,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:10:34,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105560117] [2024-11-10 10:10:34,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:10:34,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:10:34,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:10:34,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:10:34,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:10:34,936 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 83 [2024-11-10 10:10:34,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 83 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:10:34,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:10:34,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 83 [2024-11-10 10:10:34,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand