./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-misc-2.wvr.c --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/weaver/parallel-misc-2.wvr.c -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 c558e00c0dd9b5f4cf40cba6e03e276a996696c71c282947f4c8d13390dc25bf --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:30:12,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:30:13,061 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 10:30:13,068 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:30:13,070 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:30:13,100 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:30:13,101 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:30:13,101 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:30:13,102 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:30:13,103 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:30:13,104 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:30:13,104 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:30:13,105 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:30:13,107 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:30:13,107 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:30:13,107 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:30:13,108 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:30:13,110 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:30:13,110 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:30:13,110 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:30:13,110 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:30:13,111 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:30:13,111 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:30:13,112 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:30:13,112 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:30:13,112 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:30:13,112 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:30:13,113 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:30:13,113 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:30:13,113 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:30:13,113 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:30:13,114 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:30:13,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:30:13,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:30:13,115 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:30:13,116 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:30:13,116 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:30:13,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:30:13,116 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:30:13,116 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:30:13,117 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:30:13,118 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:30:13,118 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 -> c558e00c0dd9b5f4cf40cba6e03e276a996696c71c282947f4c8d13390dc25bf [2024-11-10 10:30:13,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:30:13,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:30:13,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:30:13,403 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:30:13,403 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:30:13,404 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-2.wvr.c [2024-11-10 10:30:14,847 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:30:15,086 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:30:15,087 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-2.wvr.c [2024-11-10 10:30:15,097 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a50b9428d/6067aa52d96d4d9eb7468a66261b612d/FLAG548cb6eff [2024-11-10 10:30:15,445 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a50b9428d/6067aa52d96d4d9eb7468a66261b612d [2024-11-10 10:30:15,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:30:15,451 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:30:15,453 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:30:15,453 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:30:15,459 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:30:15,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:30:15" (1/1) ... [2024-11-10 10:30:15,461 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c9ed4df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:15, skipping insertion in model container [2024-11-10 10:30:15,461 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:30:15" (1/1) ... [2024-11-10 10:30:15,483 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:30:15,724 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/weaver/parallel-misc-2.wvr.c[2249,2262] [2024-11-10 10:30:15,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:30:15,737 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:30:15,753 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/weaver/parallel-misc-2.wvr.c[2249,2262] [2024-11-10 10:30:15,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:30:15,775 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:30:15,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:15 WrapperNode [2024-11-10 10:30:15,776 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:30:15,777 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:30:15,777 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:30:15,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:30:15,783 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:30:15" (1/1) ... [2024-11-10 10:30:15,790 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:30:15" (1/1) ... [2024-11-10 10:30:15,810 INFO L138 Inliner]: procedures = 18, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2024-11-10 10:30:15,810 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:30:15,811 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:30:15,811 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:30:15,811 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:30:15,821 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:15" (1/1) ... [2024-11-10 10:30:15,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:15" (1/1) ... [2024-11-10 10:30:15,823 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:15" (1/1) ... [2024-11-10 10:30:15,838 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:30:15,838 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:15" (1/1) ... [2024-11-10 10:30:15,838 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:15" (1/1) ... [2024-11-10 10:30:15,842 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:15" (1/1) ... [2024-11-10 10:30:15,843 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:15" (1/1) ... [2024-11-10 10:30:15,844 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:15" (1/1) ... [2024-11-10 10:30:15,844 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:15" (1/1) ... [2024-11-10 10:30:15,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:30:15,854 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:30:15,854 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:30:15,854 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:30:15,855 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:15" (1/1) ... [2024-11-10 10:30:15,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:30:15,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:30:15,893 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:30:15,897 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:30:15,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:30:15,936 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-10 10:30:15,936 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-10 10:30:15,937 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-10 10:30:15,937 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-10 10:30:15,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 10:30:15,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:30:15,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:30:15,939 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:30:16,013 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:30:16,015 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:30:16,213 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 10:30:16,213 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:30:16,381 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:30:16,382 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:30:16,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:30:16 BoogieIcfgContainer [2024-11-10 10:30:16,385 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:30:16,387 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:30:16,387 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:30:16,390 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:30:16,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:30:15" (1/3) ... [2024-11-10 10:30:16,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6974e406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:30:16, skipping insertion in model container [2024-11-10 10:30:16,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:15" (2/3) ... [2024-11-10 10:30:16,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6974e406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:30:16, skipping insertion in model container [2024-11-10 10:30:16,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:30:16" (3/3) ... [2024-11-10 10:30:16,393 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-2.wvr.c [2024-11-10 10:30:16,406 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:30:16,406 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 10:30:16,406 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 10:30:16,451 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 10:30:16,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 38 transitions, 90 flow [2024-11-10 10:30:16,527 INFO L124 PetriNetUnfolderBase]: 6/36 cut-off events. [2024-11-10 10:30:16,527 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 10:30:16,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 36 events. 6/36 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 67 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2024-11-10 10:30:16,538 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 38 transitions, 90 flow [2024-11-10 10:30:16,541 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 35 transitions, 82 flow [2024-11-10 10:30:16,554 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:30:16,562 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;@6daac0a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:30:16,562 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-10 10:30:16,579 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:30:16,579 INFO L124 PetriNetUnfolderBase]: 6/34 cut-off events. [2024-11-10 10:30:16,583 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 10:30:16,583 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:30:16,584 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:30:16,585 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:30:16,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:30:16,592 INFO L85 PathProgramCache]: Analyzing trace with hash -612727728, now seen corresponding path program 1 times [2024-11-10 10:30:16,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:30:16,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074855748] [2024-11-10 10:30:16,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:30:16,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:30:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:30:16,811 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:30:16,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:30:16,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074855748] [2024-11-10 10:30:16,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074855748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:30:16,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:30:16,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:30:16,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453311054] [2024-11-10 10:30:16,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:30:16,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:30:16,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:30:16,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:30:16,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:30:16,847 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 38 [2024-11-10 10:30:16,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 35 transitions, 82 flow. Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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:30:16,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:30:16,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 38 [2024-11-10 10:30:16,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:30:16,982 INFO L124 PetriNetUnfolderBase]: 110/266 cut-off events. [2024-11-10 10:30:16,982 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-10 10:30:16,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 266 events. 110/266 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1226 event pairs, 45 based on Foata normal form. 36/229 useless extension candidates. Maximal degree in co-relation 399. Up to 164 conditions per place. [2024-11-10 10:30:16,990 INFO L140 encePairwiseOnDemand]: 36/38 looper letters, 18 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2024-11-10 10:30:16,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 114 flow [2024-11-10 10:30:16,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 10:30:16,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 10:30:17,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2024-11-10 10:30:17,004 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7105263157894737 [2024-11-10 10:30:17,006 INFO L175 Difference]: Start difference. First operand has 36 places, 35 transitions, 82 flow. Second operand 2 states and 54 transitions. [2024-11-10 10:30:17,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 114 flow [2024-11-10 10:30:17,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 106 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-10 10:30:17,015 INFO L231 Difference]: Finished difference. Result has 33 places, 33 transitions, 70 flow [2024-11-10 10:30:17,017 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=33, PETRI_TRANSITIONS=33} [2024-11-10 10:30:17,023 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2024-11-10 10:30:17,023 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 33 transitions, 70 flow [2024-11-10 10:30:17,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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:30:17,024 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:30:17,024 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:30:17,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:30:17,026 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:30:17,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:30:17,027 INFO L85 PathProgramCache]: Analyzing trace with hash -2130749885, now seen corresponding path program 1 times [2024-11-10 10:30:17,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:30:17,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088450199] [2024-11-10 10:30:17,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:30:17,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:30:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:30:17,239 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:30:17,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:30:17,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088450199] [2024-11-10 10:30:17,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088450199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:30:17,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:30:17,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:30:17,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433230752] [2024-11-10 10:30:17,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:30:17,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:30:17,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:30:17,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:30:17,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:30:17,247 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 38 [2024-11-10 10:30:17,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 33 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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:30:17,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:30:17,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 38 [2024-11-10 10:30:17,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:30:17,375 INFO L124 PetriNetUnfolderBase]: 146/326 cut-off events. [2024-11-10 10:30:17,375 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 10:30:17,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 326 events. 146/326 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1473 event pairs, 12 based on Foata normal form. 1/270 useless extension candidates. Maximal degree in co-relation 543. Up to 186 conditions per place. [2024-11-10 10:30:17,379 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 21 selfloop transitions, 7 changer transitions 1/44 dead transitions. [2024-11-10 10:30:17,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 44 transitions, 153 flow [2024-11-10 10:30:17,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:30:17,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:30:17,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2024-11-10 10:30:17,381 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7105263157894737 [2024-11-10 10:30:17,382 INFO L175 Difference]: Start difference. First operand has 33 places, 33 transitions, 70 flow. Second operand 3 states and 81 transitions. [2024-11-10 10:30:17,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 44 transitions, 153 flow [2024-11-10 10:30:17,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 153 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:30:17,387 INFO L231 Difference]: Finished difference. Result has 36 places, 37 transitions, 109 flow [2024-11-10 10:30:17,389 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=36, PETRI_TRANSITIONS=37} [2024-11-10 10:30:17,390 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2024-11-10 10:30:17,390 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 37 transitions, 109 flow [2024-11-10 10:30:17,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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:30:17,390 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:30:17,390 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:30:17,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:30:17,391 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:30:17,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:30:17,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1828935182, now seen corresponding path program 1 times [2024-11-10 10:30:17,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:30:17,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960154278] [2024-11-10 10:30:17,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:30:17,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:30:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:30:17,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:30:17,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:30:17,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960154278] [2024-11-10 10:30:17,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960154278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:30:17,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:30:17,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:30:17,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193307036] [2024-11-10 10:30:17,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:30:17,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:30:17,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:30:17,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:30:17,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:30:17,570 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 38 [2024-11-10 10:30:17,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 37 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:30:17,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:30:17,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 38 [2024-11-10 10:30:17,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:30:17,776 INFO L124 PetriNetUnfolderBase]: 308/586 cut-off events. [2024-11-10 10:30:17,776 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2024-11-10 10:30:17,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1253 conditions, 586 events. 308/586 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2995 event pairs, 31 based on Foata normal form. 0/474 useless extension candidates. Maximal degree in co-relation 1248. Up to 210 conditions per place. [2024-11-10 10:30:17,785 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 50 selfloop transitions, 10 changer transitions 5/76 dead transitions. [2024-11-10 10:30:17,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 76 transitions, 350 flow [2024-11-10 10:30:17,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:30:17,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:30:17,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2024-11-10 10:30:17,790 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6578947368421053 [2024-11-10 10:30:17,790 INFO L175 Difference]: Start difference. First operand has 36 places, 37 transitions, 109 flow. Second operand 5 states and 125 transitions. [2024-11-10 10:30:17,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 76 transitions, 350 flow [2024-11-10 10:30:17,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 76 transitions, 339 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 10:30:17,797 INFO L231 Difference]: Finished difference. Result has 42 places, 44 transitions, 163 flow [2024-11-10 10:30:17,797 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=163, PETRI_PLACES=42, PETRI_TRANSITIONS=44} [2024-11-10 10:30:17,799 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2024-11-10 10:30:17,799 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 44 transitions, 163 flow [2024-11-10 10:30:17,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:30:17,799 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:30:17,799 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:30:17,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 10:30:17,800 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:30:17,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:30:17,801 INFO L85 PathProgramCache]: Analyzing trace with hash -986808580, now seen corresponding path program 2 times [2024-11-10 10:30:17,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:30:17,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186336955] [2024-11-10 10:30:17,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:30:17,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:30:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:30:18,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:30:18,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:30:18,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186336955] [2024-11-10 10:30:18,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186336955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:30:18,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:30:18,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:30:18,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953367802] [2024-11-10 10:30:18,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:30:18,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:30:18,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:30:18,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:30:18,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:30:18,013 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 38 [2024-11-10 10:30:18,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 44 transitions, 163 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:30:18,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:30:18,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 38 [2024-11-10 10:30:18,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:30:18,172 INFO L124 PetriNetUnfolderBase]: 297/608 cut-off events. [2024-11-10 10:30:18,172 INFO L125 PetriNetUnfolderBase]: For 408/408 co-relation queries the response was YES. [2024-11-10 10:30:18,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1461 conditions, 608 events. 297/608 cut-off events. For 408/408 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3161 event pairs, 28 based on Foata normal form. 14/582 useless extension candidates. Maximal degree in co-relation 1453. Up to 149 conditions per place. [2024-11-10 10:30:18,177 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 49 selfloop transitions, 12 changer transitions 5/77 dead transitions. [2024-11-10 10:30:18,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 77 transitions, 410 flow [2024-11-10 10:30:18,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:30:18,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:30:18,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2024-11-10 10:30:18,180 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6473684210526316 [2024-11-10 10:30:18,180 INFO L175 Difference]: Start difference. First operand has 42 places, 44 transitions, 163 flow. Second operand 5 states and 123 transitions. [2024-11-10 10:30:18,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 77 transitions, 410 flow [2024-11-10 10:30:18,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 77 transitions, 410 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:30:18,186 INFO L231 Difference]: Finished difference. Result has 50 places, 49 transitions, 249 flow [2024-11-10 10:30:18,186 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=249, PETRI_PLACES=50, PETRI_TRANSITIONS=49} [2024-11-10 10:30:18,187 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 14 predicate places. [2024-11-10 10:30:18,187 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 249 flow [2024-11-10 10:30:18,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:30:18,187 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:30:18,187 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:30:18,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 10:30:18,188 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:30:18,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:30:18,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1302020225, now seen corresponding path program 1 times [2024-11-10 10:30:18,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:30:18,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650968786] [2024-11-10 10:30:18,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:30:18,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:30:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:30:18,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:30:18,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:30:18,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650968786] [2024-11-10 10:30:18,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650968786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:30:18,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:30:18,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:30:18,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70746086] [2024-11-10 10:30:18,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:30:18,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:30:18,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:30:18,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:30:18,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:30:18,316 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 38 [2024-11-10 10:30:18,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 249 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:30:18,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:30:18,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 38 [2024-11-10 10:30:18,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:30:18,478 INFO L124 PetriNetUnfolderBase]: 303/601 cut-off events. [2024-11-10 10:30:18,479 INFO L125 PetriNetUnfolderBase]: For 1082/1082 co-relation queries the response was YES. [2024-11-10 10:30:18,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1747 conditions, 601 events. 303/601 cut-off events. For 1082/1082 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3183 event pairs, 35 based on Foata normal form. 4/558 useless extension candidates. Maximal degree in co-relation 1735. Up to 248 conditions per place. [2024-11-10 10:30:18,484 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 57 selfloop transitions, 9 changer transitions 2/79 dead transitions. [2024-11-10 10:30:18,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 79 transitions, 506 flow [2024-11-10 10:30:18,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:30:18,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:30:18,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2024-11-10 10:30:18,487 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6368421052631579 [2024-11-10 10:30:18,487 INFO L175 Difference]: Start difference. First operand has 50 places, 49 transitions, 249 flow. Second operand 5 states and 121 transitions. [2024-11-10 10:30:18,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 79 transitions, 506 flow [2024-11-10 10:30:18,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 79 transitions, 502 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-11-10 10:30:18,497 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 300 flow [2024-11-10 10:30:18,497 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=300, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2024-11-10 10:30:18,501 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 20 predicate places. [2024-11-10 10:30:18,501 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 300 flow [2024-11-10 10:30:18,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:30:18,501 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:30:18,501 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:30:18,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 10:30:18,502 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:30:18,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:30:18,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1037622871, now seen corresponding path program 2 times [2024-11-10 10:30:18,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:30:18,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006430177] [2024-11-10 10:30:18,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:30:18,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:30:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:30:18,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:30:18,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:30:18,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006430177] [2024-11-10 10:30:18,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006430177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:30:18,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:30:18,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:30:18,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721605820] [2024-11-10 10:30:18,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:30:18,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:30:18,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:30:18,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:30:18,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:30:18,620 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 38 [2024-11-10 10:30:18,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 300 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:30:18,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:30:18,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 38 [2024-11-10 10:30:18,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:30:18,759 INFO L124 PetriNetUnfolderBase]: 281/592 cut-off events. [2024-11-10 10:30:18,759 INFO L125 PetriNetUnfolderBase]: For 1382/1382 co-relation queries the response was YES. [2024-11-10 10:30:18,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1746 conditions, 592 events. 281/592 cut-off events. For 1382/1382 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2840 event pairs, 29 based on Foata normal form. 19/567 useless extension candidates. Maximal degree in co-relation 1731. Up to 180 conditions per place. [2024-11-10 10:30:18,766 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 54 selfloop transitions, 12 changer transitions 2/79 dead transitions. [2024-11-10 10:30:18,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 79 transitions, 558 flow [2024-11-10 10:30:18,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:30:18,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:30:18,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2024-11-10 10:30:18,768 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6210526315789474 [2024-11-10 10:30:18,768 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 300 flow. Second operand 5 states and 118 transitions. [2024-11-10 10:30:18,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 79 transitions, 558 flow [2024-11-10 10:30:18,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 79 transitions, 542 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-11-10 10:30:18,774 INFO L231 Difference]: Finished difference. Result has 62 places, 55 transitions, 363 flow [2024-11-10 10:30:18,774 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=363, PETRI_PLACES=62, PETRI_TRANSITIONS=55} [2024-11-10 10:30:18,775 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 26 predicate places. [2024-11-10 10:30:18,776 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 55 transitions, 363 flow [2024-11-10 10:30:18,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:30:18,776 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:30:18,776 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:30:18,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 10:30:18,777 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:30:18,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:30:18,777 INFO L85 PathProgramCache]: Analyzing trace with hash -298378052, now seen corresponding path program 1 times [2024-11-10 10:30:18,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:30:18,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133569925] [2024-11-10 10:30:18,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:30:18,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:30:18,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:30:19,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:30:19,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:30:19,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133569925] [2024-11-10 10:30:19,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133569925] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:30:19,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322052984] [2024-11-10 10:30:19,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:30:19,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:30:19,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:30:19,037 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:30:19,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 10:30:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:30:19,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 10:30:19,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:30:19,333 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:30:19,334 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:30:19,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:30:19,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322052984] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:30:19,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:30:19,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2024-11-10 10:30:19,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215904100] [2024-11-10 10:30:19,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:30:19,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 10:30:19,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:30:19,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 10:30:19,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-10 10:30:19,625 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 38 [2024-11-10 10:30:19,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 55 transitions, 363 flow. Second operand has 11 states, 11 states have (on average 17.636363636363637) internal successors, (194), 11 states have internal predecessors, (194), 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:30:19,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:30:19,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 38 [2024-11-10 10:30:19,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:30:20,020 INFO L124 PetriNetUnfolderBase]: 631/1318 cut-off events. [2024-11-10 10:30:20,020 INFO L125 PetriNetUnfolderBase]: For 4649/4649 co-relation queries the response was YES. [2024-11-10 10:30:20,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4128 conditions, 1318 events. 631/1318 cut-off events. For 4649/4649 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 6898 event pairs, 54 based on Foata normal form. 28/1258 useless extension candidates. Maximal degree in co-relation 4110. Up to 282 conditions per place. [2024-11-10 10:30:20,033 INFO L140 encePairwiseOnDemand]: 27/38 looper letters, 100 selfloop transitions, 26 changer transitions 0/139 dead transitions. [2024-11-10 10:30:20,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 139 transitions, 1134 flow [2024-11-10 10:30:20,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 10:30:20,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-10 10:30:20,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 235 transitions. [2024-11-10 10:30:20,036 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.618421052631579 [2024-11-10 10:30:20,036 INFO L175 Difference]: Start difference. First operand has 62 places, 55 transitions, 363 flow. Second operand 10 states and 235 transitions. [2024-11-10 10:30:20,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 139 transitions, 1134 flow [2024-11-10 10:30:20,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 139 transitions, 1107 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-11-10 10:30:20,044 INFO L231 Difference]: Finished difference. Result has 74 places, 67 transitions, 556 flow [2024-11-10 10:30:20,044 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=556, PETRI_PLACES=74, PETRI_TRANSITIONS=67} [2024-11-10 10:30:20,045 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 38 predicate places. [2024-11-10 10:30:20,045 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 67 transitions, 556 flow [2024-11-10 10:30:20,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.636363636363637) internal successors, (194), 11 states have internal predecessors, (194), 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:30:20,046 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:30:20,046 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:30:20,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 10:30:20,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:30:20,251 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:30:20,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:30:20,251 INFO L85 PathProgramCache]: Analyzing trace with hash 887096580, now seen corresponding path program 2 times [2024-11-10 10:30:20,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:30:20,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307156097] [2024-11-10 10:30:20,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:30:20,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:30:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:30:20,395 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:30:20,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:30:20,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307156097] [2024-11-10 10:30:20,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307156097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:30:20,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:30:20,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:30:20,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549467748] [2024-11-10 10:30:20,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:30:20,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:30:20,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:30:20,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:30:20,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:30:20,401 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 38 [2024-11-10 10:30:20,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 67 transitions, 556 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:30:20,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:30:20,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 38 [2024-11-10 10:30:20,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:30:20,731 INFO L124 PetriNetUnfolderBase]: 1205/2645 cut-off events. [2024-11-10 10:30:20,732 INFO L125 PetriNetUnfolderBase]: For 10529/10733 co-relation queries the response was YES. [2024-11-10 10:30:20,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8835 conditions, 2645 events. 1205/2645 cut-off events. For 10529/10733 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 17587 event pairs, 338 based on Foata normal form. 18/2340 useless extension candidates. Maximal degree in co-relation 8813. Up to 660 conditions per place. [2024-11-10 10:30:20,755 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 71 selfloop transitions, 25 changer transitions 0/123 dead transitions. [2024-11-10 10:30:20,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 123 transitions, 1204 flow [2024-11-10 10:30:20,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:30:20,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:30:20,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-11-10 10:30:20,757 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7171052631578947 [2024-11-10 10:30:20,757 INFO L175 Difference]: Start difference. First operand has 74 places, 67 transitions, 556 flow. Second operand 4 states and 109 transitions. [2024-11-10 10:30:20,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 123 transitions, 1204 flow [2024-11-10 10:30:20,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 123 transitions, 1172 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-11-10 10:30:20,776 INFO L231 Difference]: Finished difference. Result has 77 places, 90 transitions, 948 flow [2024-11-10 10:30:20,777 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=948, PETRI_PLACES=77, PETRI_TRANSITIONS=90} [2024-11-10 10:30:20,779 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 41 predicate places. [2024-11-10 10:30:20,781 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 90 transitions, 948 flow [2024-11-10 10:30:20,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:30:20,781 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:30:20,781 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:30:20,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 10:30:20,781 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:30:20,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:30:20,782 INFO L85 PathProgramCache]: Analyzing trace with hash 278117787, now seen corresponding path program 1 times [2024-11-10 10:30:20,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:30:20,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115896536] [2024-11-10 10:30:20,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:30:20,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:30:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:30:29,357 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:30:29,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:30:29,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115896536] [2024-11-10 10:30:29,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115896536] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:30:29,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17733618] [2024-11-10 10:30:29,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:30:29,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:30:29,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:30:29,360 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:30:29,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 10:30:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:30:29,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 10:30:29,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:30:29,817 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 10:30:29,817 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:30:30,086 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 10:30:30,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17733618] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:30:30,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:30:30,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 16 [2024-11-10 10:30:30,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128653846] [2024-11-10 10:30:30,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:30:30,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 10:30:30,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:30:30,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 10:30:30,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=192, Unknown=2, NotChecked=0, Total=240 [2024-11-10 10:30:30,141 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 38 [2024-11-10 10:30:30,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 90 transitions, 948 flow. Second operand has 16 states, 16 states have (on average 16.375) internal successors, (262), 16 states have internal predecessors, (262), 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:30:30,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:30:30,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 38 [2024-11-10 10:30:30,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:30:31,850 INFO L124 PetriNetUnfolderBase]: 2625/5388 cut-off events. [2024-11-10 10:30:31,850 INFO L125 PetriNetUnfolderBase]: For 26856/26856 co-relation queries the response was YES. [2024-11-10 10:30:31,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19099 conditions, 5388 events. 2625/5388 cut-off events. For 26856/26856 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 38976 event pairs, 148 based on Foata normal form. 124/5258 useless extension candidates. Maximal degree in co-relation 19074. Up to 1174 conditions per place. [2024-11-10 10:30:31,907 INFO L140 encePairwiseOnDemand]: 25/38 looper letters, 167 selfloop transitions, 56 changer transitions 0/235 dead transitions. [2024-11-10 10:30:31,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 235 transitions, 2505 flow [2024-11-10 10:30:31,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 10:30:31,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-11-10 10:30:31,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 367 transitions. [2024-11-10 10:30:31,910 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5681114551083591 [2024-11-10 10:30:31,910 INFO L175 Difference]: Start difference. First operand has 77 places, 90 transitions, 948 flow. Second operand 17 states and 367 transitions. [2024-11-10 10:30:31,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 235 transitions, 2505 flow [2024-11-10 10:30:31,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 235 transitions, 2505 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:30:31,942 INFO L231 Difference]: Finished difference. Result has 102 places, 124 transitions, 1596 flow [2024-11-10 10:30:31,943 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1596, PETRI_PLACES=102, PETRI_TRANSITIONS=124} [2024-11-10 10:30:31,944 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 66 predicate places. [2024-11-10 10:30:31,944 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 124 transitions, 1596 flow [2024-11-10 10:30:31,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 16.375) internal successors, (262), 16 states have internal predecessors, (262), 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:30:31,945 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:30:31,945 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:30:31,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 10:30:32,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-10 10:30:32,150 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:30:32,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:30:32,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1303729855, now seen corresponding path program 1 times [2024-11-10 10:30:32,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:30:32,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506238138] [2024-11-10 10:30:32,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:30:32,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:30:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:30:32,335 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 10:30:32,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:30:32,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506238138] [2024-11-10 10:30:32,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506238138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:30:32,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:30:32,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:30:32,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112541675] [2024-11-10 10:30:32,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:30:32,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:30:32,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:30:32,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:30:32,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:30:32,341 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 38 [2024-11-10 10:30:32,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 124 transitions, 1596 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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:30:32,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:30:32,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 38 [2024-11-10 10:30:32,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:30:32,918 INFO L124 PetriNetUnfolderBase]: 1466/3351 cut-off events. [2024-11-10 10:30:32,918 INFO L125 PetriNetUnfolderBase]: For 22839/23011 co-relation queries the response was YES. [2024-11-10 10:30:32,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13075 conditions, 3351 events. 1466/3351 cut-off events. For 22839/23011 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 23472 event pairs, 314 based on Foata normal form. 44/3046 useless extension candidates. Maximal degree in co-relation 13041. Up to 1038 conditions per place. [2024-11-10 10:30:32,950 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 82 selfloop transitions, 33 changer transitions 0/152 dead transitions. [2024-11-10 10:30:32,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 152 transitions, 1955 flow [2024-11-10 10:30:32,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:30:32,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:30:32,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2024-11-10 10:30:32,951 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6842105263157895 [2024-11-10 10:30:32,951 INFO L175 Difference]: Start difference. First operand has 102 places, 124 transitions, 1596 flow. Second operand 4 states and 104 transitions. [2024-11-10 10:30:32,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 152 transitions, 1955 flow [2024-11-10 10:30:32,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 152 transitions, 1857 flow, removed 30 selfloop flow, removed 5 redundant places. [2024-11-10 10:30:32,995 INFO L231 Difference]: Finished difference. Result has 102 places, 113 transitions, 1442 flow [2024-11-10 10:30:32,996 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1333, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1442, PETRI_PLACES=102, PETRI_TRANSITIONS=113} [2024-11-10 10:30:32,996 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 66 predicate places. [2024-11-10 10:30:32,996 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 113 transitions, 1442 flow [2024-11-10 10:30:32,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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:30:32,997 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:30:32,997 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:30:32,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 10:30:32,998 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:30:32,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:30:32,999 INFO L85 PathProgramCache]: Analyzing trace with hash -67037824, now seen corresponding path program 2 times [2024-11-10 10:30:32,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:30:32,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829399730] [2024-11-10 10:30:32,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:30:32,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:30:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:30:33,115 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 10:30:33,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:30:33,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829399730] [2024-11-10 10:30:33,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829399730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:30:33,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:30:33,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:30:33,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321870184] [2024-11-10 10:30:33,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:30:33,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:30:33,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:30:33,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:30:33,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:30:33,124 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 38 [2024-11-10 10:30:33,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 113 transitions, 1442 flow. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:30:33,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:30:33,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 38 [2024-11-10 10:30:33,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:30:34,458 INFO L124 PetriNetUnfolderBase]: 3423/7329 cut-off events. [2024-11-10 10:30:34,458 INFO L125 PetriNetUnfolderBase]: For 57804/57994 co-relation queries the response was YES. [2024-11-10 10:30:34,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30070 conditions, 7329 events. 3423/7329 cut-off events. For 57804/57994 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 60448 event pairs, 1264 based on Foata normal form. 28/6831 useless extension candidates. Maximal degree in co-relation 30034. Up to 2152 conditions per place. [2024-11-10 10:30:34,600 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 156 selfloop transitions, 29 changer transitions 0/224 dead transitions. [2024-11-10 10:30:34,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 224 transitions, 3449 flow [2024-11-10 10:30:34,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:30:34,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:30:34,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2024-11-10 10:30:34,602 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6907894736842105 [2024-11-10 10:30:34,603 INFO L175 Difference]: Start difference. First operand has 102 places, 113 transitions, 1442 flow. Second operand 4 states and 105 transitions. [2024-11-10 10:30:34,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 224 transitions, 3449 flow [2024-11-10 10:30:34,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 224 transitions, 3440 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-10 10:30:34,717 INFO L231 Difference]: Finished difference. Result has 107 places, 140 transitions, 1903 flow [2024-11-10 10:30:34,718 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1436, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1903, PETRI_PLACES=107, PETRI_TRANSITIONS=140} [2024-11-10 10:30:34,718 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 71 predicate places. [2024-11-10 10:30:34,719 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 140 transitions, 1903 flow [2024-11-10 10:30:34,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:30:34,719 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:30:34,719 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:30:34,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 10:30:34,720 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:30:34,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:30:34,721 INFO L85 PathProgramCache]: Analyzing trace with hash 760992710, now seen corresponding path program 1 times [2024-11-10 10:30:34,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:30:34,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601345370] [2024-11-10 10:30:34,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:30:34,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:30:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:30:34,978 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 10:30:34,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:30:34,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601345370] [2024-11-10 10:30:34,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601345370] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:30:34,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676189899] [2024-11-10 10:30:34,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:30:34,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:30:34,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:30:34,982 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:30:34,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 10:30:35,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:30:35,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 10:30:35,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:30:35,173 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 10:30:35,173 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:30:35,301 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 10:30:35,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676189899] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:30:35,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:30:35,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-11-10 10:30:35,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401912575] [2024-11-10 10:30:35,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:30:35,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:30:35,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:30:35,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:30:35,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:30:35,305 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 38 [2024-11-10 10:30:35,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 140 transitions, 1903 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 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:30:35,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:30:35,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 38 [2024-11-10 10:30:35,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:30:37,107 INFO L124 PetriNetUnfolderBase]: 4467/10900 cut-off events. [2024-11-10 10:30:37,107 INFO L125 PetriNetUnfolderBase]: For 105678/105968 co-relation queries the response was YES. [2024-11-10 10:30:37,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48765 conditions, 10900 events. 4467/10900 cut-off events. For 105678/105968 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 102059 event pairs, 1117 based on Foata normal form. 54/10508 useless extension candidates. Maximal degree in co-relation 48727. Up to 3750 conditions per place. [2024-11-10 10:30:37,218 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 262 selfloop transitions, 23 changer transitions 1/328 dead transitions. [2024-11-10 10:30:37,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 328 transitions, 5231 flow [2024-11-10 10:30:37,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:30:37,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:30:37,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 172 transitions. [2024-11-10 10:30:37,221 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7543859649122807 [2024-11-10 10:30:37,221 INFO L175 Difference]: Start difference. First operand has 107 places, 140 transitions, 1903 flow. Second operand 6 states and 172 transitions. [2024-11-10 10:30:37,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 328 transitions, 5231 flow [2024-11-10 10:30:37,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 328 transitions, 5231 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:30:37,425 INFO L231 Difference]: Finished difference. Result has 113 places, 156 transitions, 2037 flow [2024-11-10 10:30:37,426 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1903, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2037, PETRI_PLACES=113, PETRI_TRANSITIONS=156} [2024-11-10 10:30:37,427 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 77 predicate places. [2024-11-10 10:30:37,427 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 156 transitions, 2037 flow [2024-11-10 10:30:37,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 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:30:37,427 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:30:37,427 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:30:37,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 10:30:37,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:30:37,628 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:30:37,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:30:37,629 INFO L85 PathProgramCache]: Analyzing trace with hash 129161692, now seen corresponding path program 1 times [2024-11-10 10:30:37,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:30:37,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426251519] [2024-11-10 10:30:37,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:30:37,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:30:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:30:37,825 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 10:30:37,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:30:37,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426251519] [2024-11-10 10:30:37,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426251519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:30:37,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:30:37,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:30:37,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918190263] [2024-11-10 10:30:37,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:30:37,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:30:37,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:30:37,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:30:37,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:30:37,832 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 38 [2024-11-10 10:30:37,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 156 transitions, 2037 flow. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:30:37,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:30:37,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 38 [2024-11-10 10:30:37,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:30:39,235 INFO L124 PetriNetUnfolderBase]: 4882/10936 cut-off events. [2024-11-10 10:30:39,236 INFO L125 PetriNetUnfolderBase]: For 105828/106030 co-relation queries the response was YES. [2024-11-10 10:30:39,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50783 conditions, 10936 events. 4882/10936 cut-off events. For 105828/106030 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 96802 event pairs, 1114 based on Foata normal form. 184/10746 useless extension candidates. Maximal degree in co-relation 50743. Up to 3556 conditions per place. [2024-11-10 10:30:39,333 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 153 selfloop transitions, 29 changer transitions 0/221 dead transitions. [2024-11-10 10:30:39,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 221 transitions, 3309 flow [2024-11-10 10:30:39,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:30:39,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:30:39,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2024-11-10 10:30:39,335 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6644736842105263 [2024-11-10 10:30:39,335 INFO L175 Difference]: Start difference. First operand has 113 places, 156 transitions, 2037 flow. Second operand 4 states and 101 transitions. [2024-11-10 10:30:39,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 221 transitions, 3309 flow [2024-11-10 10:30:39,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 221 transitions, 3251 flow, removed 29 selfloop flow, removed 0 redundant places. [2024-11-10 10:30:39,679 INFO L231 Difference]: Finished difference. Result has 118 places, 146 transitions, 1957 flow [2024-11-10 10:30:39,680 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1862, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1957, PETRI_PLACES=118, PETRI_TRANSITIONS=146} [2024-11-10 10:30:39,680 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 82 predicate places. [2024-11-10 10:30:39,681 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 146 transitions, 1957 flow [2024-11-10 10:30:39,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:30:39,685 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:30:39,685 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:30:39,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 10:30:39,686 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:30:39,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:30:39,686 INFO L85 PathProgramCache]: Analyzing trace with hash 377934246, now seen corresponding path program 2 times [2024-11-10 10:30:39,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:30:39,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305240860] [2024-11-10 10:30:39,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:30:39,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:30:39,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:30:39,925 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:30:39,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:30:39,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305240860] [2024-11-10 10:30:39,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305240860] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:30:39,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938034003] [2024-11-10 10:30:39,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 10:30:39,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:30:39,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:30:39,928 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:30:39,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 10:30:39,995 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 10:30:39,996 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 10:30:39,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 10:30:40,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:30:40,113 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:30:40,113 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:30:40,238 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:30:40,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938034003] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:30:40,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:30:40,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-11-10 10:30:40,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060657441] [2024-11-10 10:30:40,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:30:40,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:30:40,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:30:40,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:30:40,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:30:40,242 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 38 [2024-11-10 10:30:40,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 146 transitions, 1957 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 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:30:40,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:30:40,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 38 [2024-11-10 10:30:40,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:30:42,110 INFO L124 PetriNetUnfolderBase]: 4582/11546 cut-off events. [2024-11-10 10:30:42,110 INFO L125 PetriNetUnfolderBase]: For 132084/132514 co-relation queries the response was YES. [2024-11-10 10:30:42,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55508 conditions, 11546 events. 4582/11546 cut-off events. For 132084/132514 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 111184 event pairs, 1088 based on Foata normal form. 82/11283 useless extension candidates. Maximal degree in co-relation 55466. Up to 5068 conditions per place. [2024-11-10 10:30:42,203 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 239 selfloop transitions, 25 changer transitions 1/308 dead transitions. [2024-11-10 10:30:42,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 308 transitions, 4897 flow [2024-11-10 10:30:42,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:30:42,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:30:42,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions. [2024-11-10 10:30:42,206 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7412280701754386 [2024-11-10 10:30:42,206 INFO L175 Difference]: Start difference. First operand has 118 places, 146 transitions, 1957 flow. Second operand 6 states and 169 transitions. [2024-11-10 10:30:42,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 308 transitions, 4897 flow [2024-11-10 10:30:42,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 308 transitions, 4897 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:30:42,389 INFO L231 Difference]: Finished difference. Result has 125 places, 163 transitions, 2133 flow [2024-11-10 10:30:42,389 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1957, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2133, PETRI_PLACES=125, PETRI_TRANSITIONS=163} [2024-11-10 10:30:42,390 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 89 predicate places. [2024-11-10 10:30:42,390 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 163 transitions, 2133 flow [2024-11-10 10:30:42,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 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:30:42,390 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:30:42,390 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:30:42,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 10:30:42,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:30:42,591 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:30:42,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:30:42,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1827276840, now seen corresponding path program 3 times [2024-11-10 10:30:42,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:30:42,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387052247] [2024-11-10 10:30:42,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:30:42,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:30:42,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:30:42,804 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 10:30:42,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:30:42,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387052247] [2024-11-10 10:30:42,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387052247] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:30:42,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413214312] [2024-11-10 10:30:42,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 10:30:42,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:30:42,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:30:42,807 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:30:42,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 10:30:42,872 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-10 10:30:42,872 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 10:30:42,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 10:30:42,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:30:42,973 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 10:30:42,974 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:30:43,076 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 10:30:43,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413214312] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:30:43,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:30:43,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-11-10 10:30:43,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570004221] [2024-11-10 10:30:43,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:30:43,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:30:43,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:30:43,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:30:43,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:30:43,078 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 38 [2024-11-10 10:30:43,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 163 transitions, 2133 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 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:30:43,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:30:43,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 38 [2024-11-10 10:30:43,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:30:45,492 INFO L124 PetriNetUnfolderBase]: 6130/15345 cut-off events. [2024-11-10 10:30:45,492 INFO L125 PetriNetUnfolderBase]: For 181602/182260 co-relation queries the response was YES. [2024-11-10 10:30:45,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76100 conditions, 15345 events. 6130/15345 cut-off events. For 181602/182260 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 154889 event pairs, 1436 based on Foata normal form. 151/14948 useless extension candidates. Maximal degree in co-relation 76055. Up to 4929 conditions per place. [2024-11-10 10:30:45,764 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 272 selfloop transitions, 42 changer transitions 1/358 dead transitions. [2024-11-10 10:30:45,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 358 transitions, 5774 flow [2024-11-10 10:30:45,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:30:45,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:30:45,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 171 transitions. [2024-11-10 10:30:45,769 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-11-10 10:30:45,769 INFO L175 Difference]: Start difference. First operand has 125 places, 163 transitions, 2133 flow. Second operand 6 states and 171 transitions. [2024-11-10 10:30:45,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 358 transitions, 5774 flow [2024-11-10 10:30:45,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 358 transitions, 5760 flow, removed 7 selfloop flow, removed 0 redundant places. [2024-11-10 10:30:46,000 INFO L231 Difference]: Finished difference. Result has 134 places, 186 transitions, 2462 flow [2024-11-10 10:30:46,000 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=2123, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2462, PETRI_PLACES=134, PETRI_TRANSITIONS=186} [2024-11-10 10:30:46,000 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 98 predicate places. [2024-11-10 10:30:46,001 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 186 transitions, 2462 flow [2024-11-10 10:30:46,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 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:30:46,001 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:30:46,001 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:30:46,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-10 10:30:46,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-10 10:30:46,202 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:30:46,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:30:46,203 INFO L85 PathProgramCache]: Analyzing trace with hash 977859948, now seen corresponding path program 4 times [2024-11-10 10:30:46,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:30:46,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223761843] [2024-11-10 10:30:46,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:30:46,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:30:46,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:30:46,375 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 10:30:46,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:30:46,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223761843] [2024-11-10 10:30:46,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223761843] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:30:46,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639629195] [2024-11-10 10:30:46,376 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 10:30:46,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:30:46,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:30:46,379 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:30:46,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 10:30:46,440 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 10:30:46,441 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 10:30:46,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 10:30:46,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:30:46,530 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 10:30:46,530 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:30:46,629 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 10:30:46,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639629195] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:30:46,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:30:46,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-11-10 10:30:46,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141369271] [2024-11-10 10:30:46,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:30:46,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:30:46,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:30:46,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:30:46,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:30:46,632 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 38 [2024-11-10 10:30:46,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 186 transitions, 2462 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 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:30:46,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:30:46,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 38 [2024-11-10 10:30:46,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:30:49,539 INFO L124 PetriNetUnfolderBase]: 6666/16880 cut-off events. [2024-11-10 10:30:49,540 INFO L125 PetriNetUnfolderBase]: For 209158/210026 co-relation queries the response was YES. [2024-11-10 10:30:49,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86896 conditions, 16880 events. 6666/16880 cut-off events. For 209158/210026 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 173937 event pairs, 1553 based on Foata normal form. 185/16585 useless extension candidates. Maximal degree in co-relation 86846. Up to 7529 conditions per place. [2024-11-10 10:30:49,703 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 271 selfloop transitions, 31 changer transitions 1/346 dead transitions. [2024-11-10 10:30:49,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 346 transitions, 5551 flow [2024-11-10 10:30:49,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:30:49,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:30:49,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions. [2024-11-10 10:30:49,705 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7412280701754386 [2024-11-10 10:30:49,705 INFO L175 Difference]: Start difference. First operand has 134 places, 186 transitions, 2462 flow. Second operand 6 states and 169 transitions. [2024-11-10 10:30:49,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 346 transitions, 5551 flow [2024-11-10 10:30:50,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 346 transitions, 5533 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-10 10:30:50,039 INFO L231 Difference]: Finished difference. Result has 142 places, 201 transitions, 2704 flow [2024-11-10 10:30:50,040 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=2448, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2704, PETRI_PLACES=142, PETRI_TRANSITIONS=201} [2024-11-10 10:30:50,040 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 106 predicate places. [2024-11-10 10:30:50,040 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 201 transitions, 2704 flow [2024-11-10 10:30:50,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 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:30:50,040 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:30:50,040 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:30:50,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 10:30:50,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-10 10:30:50,241 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:30:50,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:30:50,242 INFO L85 PathProgramCache]: Analyzing trace with hash 2106951091, now seen corresponding path program 5 times [2024-11-10 10:30:50,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:30:50,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378153862] [2024-11-10 10:30:50,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:30:50,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:30:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:30:50,796 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:30:50,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:30:50,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378153862] [2024-11-10 10:30:50,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378153862] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:30:50,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983071448] [2024-11-10 10:30:50,797 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-10 10:30:50,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:30:50,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:30:50,799 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:30:50,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 10:30:50,900 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-11-10 10:30:50,900 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 10:30:50,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 10:30:50,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:30:51,490 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:30:51,490 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:30:52,451 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:30:52,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983071448] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:30:52,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:30:52,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 19 [2024-11-10 10:30:52,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579650590] [2024-11-10 10:30:52,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:30:52,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 10:30:52,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:30:52,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 10:30:52,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2024-11-10 10:30:52,479 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 38 [2024-11-10 10:30:52,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 201 transitions, 2704 flow. Second operand has 19 states, 19 states have (on average 16.526315789473685) internal successors, (314), 19 states have internal predecessors, (314), 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:30:52,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:30:52,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 38 [2024-11-10 10:30:52,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:31:01,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 10:31:20,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []