./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-2.wvr.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 387afe7095db5eeb3a9188bc3fe181fa803bb62f73944f6d781c5c9340fce39e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:29:23,029 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:29:23,113 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 14:29:23,117 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:29:23,118 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:29:23,138 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:29:23,138 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:29:23,139 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:29:23,139 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:29:23,141 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:29:23,142 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:29:23,142 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:29:23,143 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:29:23,145 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:29:23,145 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:29:23,145 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:29:23,146 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:29:23,146 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:29:23,146 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:29:23,146 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:29:23,147 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:29:23,148 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:29:23,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:29:23,148 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:29:23,149 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:29:23,149 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:29:23,149 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:29:23,150 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:29:23,150 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:29:23,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:29:23,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:29:23,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:29:23,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:29:23,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:29:23,152 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:29:23,152 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:29:23,152 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:29:23,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:29:23,153 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:29:23,153 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:29:23,154 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:29:23,155 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:29:23,155 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-clean/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-clean/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 -> 387afe7095db5eeb3a9188bc3fe181fa803bb62f73944f6d781c5c9340fce39e [2024-10-11 14:29:23,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:29:23,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:29:23,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:29:23,440 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:29:23,440 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:29:23,442 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-2.wvr.c [2024-10-11 14:29:24,889 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:29:25,076 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:29:25,077 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-2.wvr.c [2024-10-11 14:29:25,084 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e7361b58e/8be89c0d3e414d5084915195546818d8/FLAG0500e35f1 [2024-10-11 14:29:25,097 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e7361b58e/8be89c0d3e414d5084915195546818d8 [2024-10-11 14:29:25,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:29:25,101 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:29:25,103 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:29:25,103 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:29:25,108 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:29:25,109 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:29:25" (1/1) ... [2024-10-11 14:29:25,109 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38a77f57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:25, skipping insertion in model container [2024-10-11 14:29:25,109 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:29:25" (1/1) ... [2024-10-11 14:29:25,133 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:29:25,336 WARN L248 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[2580,2593] [2024-10-11 14:29:25,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:29:25,354 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:29:25,373 WARN L248 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[2580,2593] [2024-10-11 14:29:25,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:29:25,388 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:29:25,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:25 WrapperNode [2024-10-11 14:29:25,389 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:29:25,390 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:29:25,390 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:29:25,390 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:29:25,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:25" (1/1) ... [2024-10-11 14:29:25,403 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:25" (1/1) ... [2024-10-11 14:29:25,420 INFO L138 Inliner]: procedures = 20, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2024-10-11 14:29:25,421 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:29:25,421 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:29:25,422 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:29:25,422 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:29:25,431 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:25" (1/1) ... [2024-10-11 14:29:25,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:25" (1/1) ... [2024-10-11 14:29:25,433 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:25" (1/1) ... [2024-10-11 14:29:25,447 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-10-11 14:29:25,447 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:25" (1/1) ... [2024-10-11 14:29:25,448 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:25" (1/1) ... [2024-10-11 14:29:25,452 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:25" (1/1) ... [2024-10-11 14:29:25,455 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:25" (1/1) ... [2024-10-11 14:29:25,456 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:25" (1/1) ... [2024-10-11 14:29:25,457 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:25" (1/1) ... [2024-10-11 14:29:25,459 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:29:25,460 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:29:25,460 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:29:25,460 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:29:25,461 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:25" (1/1) ... [2024-10-11 14:29:25,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:29:25,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:29:25,494 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:29:25,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:29:25,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:29:25,548 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 14:29:25,548 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 14:29:25,549 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 14:29:25,549 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 14:29:25,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:29:25,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 14:29:25,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 14:29:25,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:29:25,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:29:25,552 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 14:29:25,665 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:29:25,667 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:29:25,875 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 14:29:25,876 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:29:26,058 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:29:26,058 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 14:29:26,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:29:26 BoogieIcfgContainer [2024-10-11 14:29:26,059 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:29:26,061 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:29:26,062 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:29:26,067 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:29:26,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:29:25" (1/3) ... [2024-10-11 14:29:26,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be6b7bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:29:26, skipping insertion in model container [2024-10-11 14:29:26,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:25" (2/3) ... [2024-10-11 14:29:26,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be6b7bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:29:26, skipping insertion in model container [2024-10-11 14:29:26,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:29:26" (3/3) ... [2024-10-11 14:29:26,069 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-2.wvr.c [2024-10-11 14:29:26,089 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:29:26,089 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:29:26,089 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 14:29:26,137 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 14:29:26,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 28 transitions, 70 flow [2024-10-11 14:29:26,225 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2024-10-11 14:29:26,225 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 14:29:26,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 4/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 44 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2024-10-11 14:29:26,228 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 28 transitions, 70 flow [2024-10-11 14:29:26,236 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 25 transitions, 62 flow [2024-10-11 14:29:26,269 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:29:26,285 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;@11dad2e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:29:26,286 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-11 14:29:26,299 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:29:26,299 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2024-10-11 14:29:26,299 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 14:29:26,299 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:29:26,304 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:29:26,305 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-10-11 14:29:26,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:29:26,313 INFO L85 PathProgramCache]: Analyzing trace with hash -314967004, now seen corresponding path program 1 times [2024-10-11 14:29:26,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:29:26,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316248968] [2024-10-11 14:29:26,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:29:26,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:29:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:29:26,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:29:26,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:29:26,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316248968] [2024-10-11 14:29:26,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316248968] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:29:26,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:29:26,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:29:26,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420090381] [2024-10-11 14:29:26,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:29:26,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:29:26,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:29:26,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:29:26,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:29:26,711 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 28 [2024-10-11 14:29:26,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 25 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-10-11 14:29:26,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:29:26,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 28 [2024-10-11 14:29:26,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:29:26,842 INFO L124 PetriNetUnfolderBase]: 130/252 cut-off events. [2024-10-11 14:29:26,842 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-10-11 14:29:26,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464 conditions, 252 events. 130/252 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 939 event pairs, 12 based on Foata normal form. 1/214 useless extension candidates. Maximal degree in co-relation 404. Up to 165 conditions per place. [2024-10-11 14:29:26,851 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 21 selfloop transitions, 5 changer transitions 1/36 dead transitions. [2024-10-11 14:29:26,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 36 transitions, 147 flow [2024-10-11 14:29:26,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:29:26,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:29:26,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2024-10-11 14:29:26,864 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7261904761904762 [2024-10-11 14:29:26,866 INFO L175 Difference]: Start difference. First operand has 28 places, 25 transitions, 62 flow. Second operand 3 states and 61 transitions. [2024-10-11 14:29:26,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 36 transitions, 147 flow [2024-10-11 14:29:26,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 36 transitions, 133 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 14:29:26,872 INFO L231 Difference]: Finished difference. Result has 27 places, 29 transitions, 87 flow [2024-10-11 14:29:26,874 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=27, PETRI_TRANSITIONS=29} [2024-10-11 14:29:26,879 INFO L277 CegarLoopForPetriNet]: 28 programPoint places, -1 predicate places. [2024-10-11 14:29:26,880 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 29 transitions, 87 flow [2024-10-11 14:29:26,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-10-11 14:29:26,880 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:29:26,880 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:29:26,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:29:26,881 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-10-11 14:29:26,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:29:26,881 INFO L85 PathProgramCache]: Analyzing trace with hash 112974820, now seen corresponding path program 1 times [2024-10-11 14:29:26,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:29:26,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810242191] [2024-10-11 14:29:26,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:29:26,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:29:26,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:29:27,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:29:27,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:29:27,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810242191] [2024-10-11 14:29:27,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810242191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:29:27,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:29:27,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:29:27,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791156018] [2024-10-11 14:29:27,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:29:27,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:29:27,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:29:27,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:29:27,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:29:27,139 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 28 [2024-10-11 14:29:27,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 29 transitions, 87 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-10-11 14:29:27,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:29:27,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 28 [2024-10-11 14:29:27,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:29:27,327 INFO L124 PetriNetUnfolderBase]: 173/318 cut-off events. [2024-10-11 14:29:27,327 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-10-11 14:29:27,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 678 conditions, 318 events. 173/318 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1320 event pairs, 16 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 342. Up to 129 conditions per place. [2024-10-11 14:29:27,333 INFO L140 encePairwiseOnDemand]: 21/28 looper letters, 35 selfloop transitions, 9 changer transitions 3/58 dead transitions. [2024-10-11 14:29:27,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 58 transitions, 254 flow [2024-10-11 14:29:27,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:29:27,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:29:27,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2024-10-11 14:29:27,336 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7214285714285714 [2024-10-11 14:29:27,336 INFO L175 Difference]: Start difference. First operand has 27 places, 29 transitions, 87 flow. Second operand 5 states and 101 transitions. [2024-10-11 14:29:27,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 58 transitions, 254 flow [2024-10-11 14:29:27,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 58 transitions, 247 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 14:29:27,339 INFO L231 Difference]: Finished difference. Result has 33 places, 36 transitions, 139 flow [2024-10-11 14:29:27,339 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=33, PETRI_TRANSITIONS=36} [2024-10-11 14:29:27,341 INFO L277 CegarLoopForPetriNet]: 28 programPoint places, 5 predicate places. [2024-10-11 14:29:27,341 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 36 transitions, 139 flow [2024-10-11 14:29:27,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-10-11 14:29:27,341 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:29:27,342 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:29:27,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:29:27,342 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-10-11 14:29:27,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:29:27,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1594057982, now seen corresponding path program 2 times [2024-10-11 14:29:27,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:29:27,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226513876] [2024-10-11 14:29:27,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:29:27,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:29:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:29:27,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:29:27,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:29:27,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226513876] [2024-10-11 14:29:27,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226513876] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:29:27,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:29:27,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:29:27,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048061754] [2024-10-11 14:29:27,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:29:27,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:29:27,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:29:27,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:29:27,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:29:27,515 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 28 [2024-10-11 14:29:27,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 36 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-10-11 14:29:27,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:29:27,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 28 [2024-10-11 14:29:27,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:29:27,709 INFO L124 PetriNetUnfolderBase]: 160/325 cut-off events. [2024-10-11 14:29:27,710 INFO L125 PetriNetUnfolderBase]: For 202/206 co-relation queries the response was YES. [2024-10-11 14:29:27,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 822 conditions, 325 events. 160/325 cut-off events. For 202/206 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1402 event pairs, 11 based on Foata normal form. 17/305 useless extension candidates. Maximal degree in co-relation 248. Up to 80 conditions per place. [2024-10-11 14:29:27,717 INFO L140 encePairwiseOnDemand]: 21/28 looper letters, 37 selfloop transitions, 12 changer transitions 3/63 dead transitions. [2024-10-11 14:29:27,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 63 transitions, 343 flow [2024-10-11 14:29:27,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:29:27,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:29:27,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2024-10-11 14:29:27,721 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7214285714285714 [2024-10-11 14:29:27,721 INFO L175 Difference]: Start difference. First operand has 33 places, 36 transitions, 139 flow. Second operand 5 states and 101 transitions. [2024-10-11 14:29:27,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 63 transitions, 343 flow [2024-10-11 14:29:27,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 63 transitions, 343 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 14:29:27,728 INFO L231 Difference]: Finished difference. Result has 41 places, 41 transitions, 225 flow [2024-10-11 14:29:27,729 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=225, PETRI_PLACES=41, PETRI_TRANSITIONS=41} [2024-10-11 14:29:27,731 INFO L277 CegarLoopForPetriNet]: 28 programPoint places, 13 predicate places. [2024-10-11 14:29:27,731 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 41 transitions, 225 flow [2024-10-11 14:29:27,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-10-11 14:29:27,732 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:29:27,732 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:29:27,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:29:27,732 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-10-11 14:29:27,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:29:27,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1183701864, now seen corresponding path program 1 times [2024-10-11 14:29:27,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:29:27,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174155007] [2024-10-11 14:29:27,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:29:27,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:29:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:29:27,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:29:27,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:29:27,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174155007] [2024-10-11 14:29:27,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174155007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:29:27,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:29:27,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:29:27,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326307725] [2024-10-11 14:29:27,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:29:27,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:29:27,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:29:27,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:29:27,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:29:27,873 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 28 [2024-10-11 14:29:27,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 41 transitions, 225 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:29:27,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:29:27,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 28 [2024-10-11 14:29:27,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:29:28,017 INFO L124 PetriNetUnfolderBase]: 159/314 cut-off events. [2024-10-11 14:29:28,018 INFO L125 PetriNetUnfolderBase]: For 587/609 co-relation queries the response was YES. [2024-10-11 14:29:28,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1046 conditions, 314 events. 159/314 cut-off events. For 587/609 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1340 event pairs, 15 based on Foata normal form. 11/287 useless extension candidates. Maximal degree in co-relation 327. Up to 145 conditions per place. [2024-10-11 14:29:28,022 INFO L140 encePairwiseOnDemand]: 21/28 looper letters, 42 selfloop transitions, 8 changer transitions 4/65 dead transitions. [2024-10-11 14:29:28,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 65 transitions, 435 flow [2024-10-11 14:29:28,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:29:28,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:29:28,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2024-10-11 14:29:28,024 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7071428571428572 [2024-10-11 14:29:28,024 INFO L175 Difference]: Start difference. First operand has 41 places, 41 transitions, 225 flow. Second operand 5 states and 99 transitions. [2024-10-11 14:29:28,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 65 transitions, 435 flow [2024-10-11 14:29:28,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 65 transitions, 431 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-10-11 14:29:28,033 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 272 flow [2024-10-11 14:29:28,033 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=272, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2024-10-11 14:29:28,035 INFO L277 CegarLoopForPetriNet]: 28 programPoint places, 19 predicate places. [2024-10-11 14:29:28,035 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 272 flow [2024-10-11 14:29:28,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:29:28,036 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:29:28,036 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:29:28,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:29:28,037 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-10-11 14:29:28,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:29:28,038 INFO L85 PathProgramCache]: Analyzing trace with hash 707370358, now seen corresponding path program 2 times [2024-10-11 14:29:28,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:29:28,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869465860] [2024-10-11 14:29:28,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:29:28,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:29:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:29:28,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:29:28,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:29:28,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869465860] [2024-10-11 14:29:28,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869465860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:29:28,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:29:28,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:29:28,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352004565] [2024-10-11 14:29:28,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:29:28,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:29:28,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:29:28,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:29:28,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:29:28,128 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 28 [2024-10-11 14:29:28,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 272 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:29:28,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:29:28,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 28 [2024-10-11 14:29:28,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:29:28,247 INFO L124 PetriNetUnfolderBase]: 148/311 cut-off events. [2024-10-11 14:29:28,247 INFO L125 PetriNetUnfolderBase]: For 623/631 co-relation queries the response was YES. [2024-10-11 14:29:28,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 311 events. 148/311 cut-off events. For 623/631 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1244 event pairs, 11 based on Foata normal form. 16/292 useless extension candidates. Maximal degree in co-relation 722. Up to 80 conditions per place. [2024-10-11 14:29:28,250 INFO L140 encePairwiseOnDemand]: 21/28 looper letters, 40 selfloop transitions, 12 changer transitions 2/65 dead transitions. [2024-10-11 14:29:28,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 65 transitions, 482 flow [2024-10-11 14:29:28,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:29:28,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:29:28,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2024-10-11 14:29:28,252 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2024-10-11 14:29:28,252 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 272 flow. Second operand 5 states and 96 transitions. [2024-10-11 14:29:28,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 65 transitions, 482 flow [2024-10-11 14:29:28,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 466 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-10-11 14:29:28,257 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 335 flow [2024-10-11 14:29:28,257 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=335, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2024-10-11 14:29:28,258 INFO L277 CegarLoopForPetriNet]: 28 programPoint places, 25 predicate places. [2024-10-11 14:29:28,258 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 335 flow [2024-10-11 14:29:28,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:29:28,258 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:29:28,258 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:29:28,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:29:28,259 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-10-11 14:29:28,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:29:28,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1306210578, now seen corresponding path program 1 times [2024-10-11 14:29:28,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:29:28,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981503120] [2024-10-11 14:29:28,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:29:28,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:29:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:29:28,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:29:28,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:29:28,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981503120] [2024-10-11 14:29:28,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981503120] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:29:28,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962456611] [2024-10-11 14:29:28,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:29:28,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:29:28,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:29:28,517 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:29:28,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 14:29:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:29:28,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 14:29:28,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:29:28,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:29:28,883 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:29:29,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:29:29,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962456611] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:29:29,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:29:29,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2024-10-11 14:29:29,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317265180] [2024-10-11 14:29:29,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:29:29,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 14:29:29,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:29:29,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 14:29:29,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:29:29,138 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 28 [2024-10-11 14:29:29,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 335 flow. Second operand has 12 states, 12 states have (on average 12.666666666666666) internal successors, (152), 12 states have internal predecessors, (152), 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-10-11 14:29:29,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:29:29,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 28 [2024-10-11 14:29:29,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:29:29,893 INFO L124 PetriNetUnfolderBase]: 411/775 cut-off events. [2024-10-11 14:29:29,894 INFO L125 PetriNetUnfolderBase]: For 2447/2447 co-relation queries the response was YES. [2024-10-11 14:29:29,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2835 conditions, 775 events. 411/775 cut-off events. For 2447/2447 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3349 event pairs, 4 based on Foata normal form. 42/754 useless extension candidates. Maximal degree in co-relation 1287. Up to 229 conditions per place. [2024-10-11 14:29:29,903 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 105 selfloop transitions, 49 changer transitions 0/161 dead transitions. [2024-10-11 14:29:29,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 161 transitions, 1332 flow [2024-10-11 14:29:29,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 14:29:29,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-10-11 14:29:29,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 306 transitions. [2024-10-11 14:29:29,907 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2024-10-11 14:29:29,907 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 335 flow. Second operand 18 states and 306 transitions. [2024-10-11 14:29:29,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 161 transitions, 1332 flow [2024-10-11 14:29:29,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 161 transitions, 1299 flow, removed 15 selfloop flow, removed 1 redundant places. [2024-10-11 14:29:29,917 INFO L231 Difference]: Finished difference. Result has 79 places, 79 transitions, 820 flow [2024-10-11 14:29:29,918 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=820, PETRI_PLACES=79, PETRI_TRANSITIONS=79} [2024-10-11 14:29:29,919 INFO L277 CegarLoopForPetriNet]: 28 programPoint places, 51 predicate places. [2024-10-11 14:29:29,919 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 79 transitions, 820 flow [2024-10-11 14:29:29,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.666666666666666) internal successors, (152), 12 states have internal predecessors, (152), 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-10-11 14:29:29,920 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:29:29,920 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:29:29,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 14:29:30,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:29:30,121 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-10-11 14:29:30,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:29:30,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1164099254, now seen corresponding path program 2 times [2024-10-11 14:29:30,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:29:30,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75509181] [2024-10-11 14:29:30,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:29:30,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:29:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:29:30,254 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:29:30,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:29:30,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75509181] [2024-10-11 14:29:30,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75509181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:29:30,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:29:30,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:29:30,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145865662] [2024-10-11 14:29:30,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:29:30,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:29:30,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:29:30,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:29:30,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:29:30,260 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 28 [2024-10-11 14:29:30,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 79 transitions, 820 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-10-11 14:29:30,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:29:30,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 28 [2024-10-11 14:29:30,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:29:30,509 INFO L124 PetriNetUnfolderBase]: 712/1431 cut-off events. [2024-10-11 14:29:30,510 INFO L125 PetriNetUnfolderBase]: For 8150/8171 co-relation queries the response was YES. [2024-10-11 14:29:30,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6132 conditions, 1431 events. 712/1431 cut-off events. For 8150/8171 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 8265 event pairs, 157 based on Foata normal form. 2/1297 useless extension candidates. Maximal degree in co-relation 5425. Up to 431 conditions per place. [2024-10-11 14:29:30,524 INFO L140 encePairwiseOnDemand]: 25/28 looper letters, 99 selfloop transitions, 30 changer transitions 0/158 dead transitions. [2024-10-11 14:29:30,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 158 transitions, 1967 flow [2024-10-11 14:29:30,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:29:30,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 14:29:30,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2024-10-11 14:29:30,526 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-10-11 14:29:30,526 INFO L175 Difference]: Start difference. First operand has 79 places, 79 transitions, 820 flow. Second operand 4 states and 84 transitions. [2024-10-11 14:29:30,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 158 transitions, 1967 flow [2024-10-11 14:29:30,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 158 transitions, 1854 flow, removed 49 selfloop flow, removed 3 redundant places. [2024-10-11 14:29:30,552 INFO L231 Difference]: Finished difference. Result has 82 places, 109 transitions, 1284 flow [2024-10-11 14:29:30,552 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1284, PETRI_PLACES=82, PETRI_TRANSITIONS=109} [2024-10-11 14:29:30,553 INFO L277 CegarLoopForPetriNet]: 28 programPoint places, 54 predicate places. [2024-10-11 14:29:30,553 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 109 transitions, 1284 flow [2024-10-11 14:29:30,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-10-11 14:29:30,553 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:29:30,554 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:29:30,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:29:30,554 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-10-11 14:29:30,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:29:30,555 INFO L85 PathProgramCache]: Analyzing trace with hash 17516002, now seen corresponding path program 1 times [2024-10-11 14:29:30,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:29:30,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104130974] [2024-10-11 14:29:30,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:29:30,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:29:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:29:30,694 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:29:30,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:29:30,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104130974] [2024-10-11 14:29:30,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104130974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:29:30,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:29:30,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:29:30,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794118993] [2024-10-11 14:29:30,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:29:30,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:29:30,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:29:30,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:29:30,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:29:30,698 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 28 [2024-10-11 14:29:30,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 109 transitions, 1284 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-10-11 14:29:30,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:29:30,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 28 [2024-10-11 14:29:30,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:29:31,060 INFO L124 PetriNetUnfolderBase]: 948/2080 cut-off events. [2024-10-11 14:29:31,060 INFO L125 PetriNetUnfolderBase]: For 18135/18403 co-relation queries the response was YES. [2024-10-11 14:29:31,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10328 conditions, 2080 events. 948/2080 cut-off events. For 18135/18403 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 14363 event pairs, 178 based on Foata normal form. 48/1972 useless extension candidates. Maximal degree in co-relation 9422. Up to 650 conditions per place. [2024-10-11 14:29:31,082 INFO L140 encePairwiseOnDemand]: 25/28 looper letters, 138 selfloop transitions, 26 changer transitions 0/194 dead transitions. [2024-10-11 14:29:31,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 194 transitions, 2739 flow [2024-10-11 14:29:31,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:29:31,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 14:29:31,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2024-10-11 14:29:31,084 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7053571428571429 [2024-10-11 14:29:31,084 INFO L175 Difference]: Start difference. First operand has 82 places, 109 transitions, 1284 flow. Second operand 4 states and 79 transitions. [2024-10-11 14:29:31,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 194 transitions, 2739 flow [2024-10-11 14:29:31,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 194 transitions, 2726 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-10-11 14:29:31,119 INFO L231 Difference]: Finished difference. Result has 87 places, 123 transitions, 1530 flow [2024-10-11 14:29:31,119 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1278, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1530, PETRI_PLACES=87, PETRI_TRANSITIONS=123} [2024-10-11 14:29:31,120 INFO L277 CegarLoopForPetriNet]: 28 programPoint places, 59 predicate places. [2024-10-11 14:29:31,120 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 123 transitions, 1530 flow [2024-10-11 14:29:31,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-10-11 14:29:31,120 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:29:31,120 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:29:31,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 14:29:31,121 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-10-11 14:29:31,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:29:31,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1978489132, now seen corresponding path program 1 times [2024-10-11 14:29:31,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:29:31,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414217944] [2024-10-11 14:29:31,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:29:31,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:29:31,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:29:31,237 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:29:31,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:29:31,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414217944] [2024-10-11 14:29:31,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414217944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:29:31,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:29:31,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:29:31,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266525216] [2024-10-11 14:29:31,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:29:31,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:29:31,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:29:31,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:29:31,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:29:31,243 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 28 [2024-10-11 14:29:31,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 123 transitions, 1530 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-10-11 14:29:31,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:29:31,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 28 [2024-10-11 14:29:31,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:29:31,528 INFO L124 PetriNetUnfolderBase]: 817/1793 cut-off events. [2024-10-11 14:29:31,528 INFO L125 PetriNetUnfolderBase]: For 15247/15291 co-relation queries the response was YES. [2024-10-11 14:29:31,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8953 conditions, 1793 events. 817/1793 cut-off events. For 15247/15291 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 11969 event pairs, 180 based on Foata normal form. 46/1781 useless extension candidates. Maximal degree in co-relation 8241. Up to 516 conditions per place. [2024-10-11 14:29:31,548 INFO L140 encePairwiseOnDemand]: 26/28 looper letters, 100 selfloop transitions, 30 changer transitions 0/161 dead transitions. [2024-10-11 14:29:31,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 161 transitions, 2202 flow [2024-10-11 14:29:31,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:29:31,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 14:29:31,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2024-10-11 14:29:31,550 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2024-10-11 14:29:31,550 INFO L175 Difference]: Start difference. First operand has 87 places, 123 transitions, 1530 flow. Second operand 4 states and 80 transitions. [2024-10-11 14:29:31,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 161 transitions, 2202 flow [2024-10-11 14:29:31,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 161 transitions, 2202 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 14:29:31,589 INFO L231 Difference]: Finished difference. Result has 92 places, 112 transitions, 1456 flow [2024-10-11 14:29:31,589 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1358, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1456, PETRI_PLACES=92, PETRI_TRANSITIONS=112} [2024-10-11 14:29:31,590 INFO L277 CegarLoopForPetriNet]: 28 programPoint places, 64 predicate places. [2024-10-11 14:29:31,590 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 112 transitions, 1456 flow [2024-10-11 14:29:31,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-10-11 14:29:31,590 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:29:31,590 INFO L204 CegarLoopForPetriNet]: trace histogram [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-10-11 14:29:31,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 14:29:31,591 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-10-11 14:29:31,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:29:31,591 INFO L85 PathProgramCache]: Analyzing trace with hash -612012798, now seen corresponding path program 1 times [2024-10-11 14:29:31,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:29:31,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286177383] [2024-10-11 14:29:31,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:29:31,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:29:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:29:31,805 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:29:31,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:29:31,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286177383] [2024-10-11 14:29:31,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286177383] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:29:31,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227796702] [2024-10-11 14:29:31,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:29:31,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:29:31,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:29:31,808 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:29:31,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 14:29:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:29:31,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 14:29:31,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:29:31,959 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:29:31,960 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:29:32,048 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:29:32,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227796702] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:29:32,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:29:32,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-10-11 14:29:32,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427328333] [2024-10-11 14:29:32,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:29:32,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:29:32,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:29:32,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:29:32,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:29:32,055 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 28 [2024-10-11 14:29:32,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 112 transitions, 1456 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:29:32,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:29:32,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 28 [2024-10-11 14:29:32,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:29:32,480 INFO L124 PetriNetUnfolderBase]: 1135/2474 cut-off events. [2024-10-11 14:29:32,480 INFO L125 PetriNetUnfolderBase]: For 21575/21679 co-relation queries the response was YES. [2024-10-11 14:29:32,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12951 conditions, 2474 events. 1135/2474 cut-off events. For 21575/21679 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 17134 event pairs, 214 based on Foata normal form. 10/2417 useless extension candidates. Maximal degree in co-relation 11253. Up to 1289 conditions per place. [2024-10-11 14:29:32,508 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 162 selfloop transitions, 15 changer transitions 1/209 dead transitions. [2024-10-11 14:29:32,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 209 transitions, 3061 flow [2024-10-11 14:29:32,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:29:32,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:29:32,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2024-10-11 14:29:32,510 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7785714285714286 [2024-10-11 14:29:32,510 INFO L175 Difference]: Start difference. First operand has 92 places, 112 transitions, 1456 flow. Second operand 5 states and 109 transitions. [2024-10-11 14:29:32,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 209 transitions, 3061 flow [2024-10-11 14:29:32,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 209 transitions, 3061 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 14:29:32,553 INFO L231 Difference]: Finished difference. Result has 97 places, 122 transitions, 1547 flow [2024-10-11 14:29:32,554 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1456, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1547, PETRI_PLACES=97, PETRI_TRANSITIONS=122} [2024-10-11 14:29:32,554 INFO L277 CegarLoopForPetriNet]: 28 programPoint places, 69 predicate places. [2024-10-11 14:29:32,555 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 122 transitions, 1547 flow [2024-10-11 14:29:32,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:29:32,555 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:29:32,555 INFO L204 CegarLoopForPetriNet]: trace histogram [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-10-11 14:29:32,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 14:29:32,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:29:32,760 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-10-11 14:29:32,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:29:32,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1688387524, now seen corresponding path program 2 times [2024-10-11 14:29:32,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:29:32,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159467147] [2024-10-11 14:29:32,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:29:32,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:29:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:29:32,928 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:29:32,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:29:32,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159467147] [2024-10-11 14:29:32,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159467147] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:29:32,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438154995] [2024-10-11 14:29:32,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 14:29:32,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:29:32,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:29:32,931 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:29:32,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 14:29:32,993 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 14:29:32,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:29:32,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 14:29:32,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:29:33,067 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:29:33,067 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:29:33,147 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:29:33,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438154995] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:29:33,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:29:33,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-10-11 14:29:33,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534060552] [2024-10-11 14:29:33,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:29:33,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:29:33,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:29:33,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:29:33,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:29:33,152 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 28 [2024-10-11 14:29:33,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 122 transitions, 1547 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-10-11 14:29:33,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:29:33,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 28 [2024-10-11 14:29:33,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:29:34,024 INFO L124 PetriNetUnfolderBase]: 1990/4349 cut-off events. [2024-10-11 14:29:34,025 INFO L125 PetriNetUnfolderBase]: For 42246/42487 co-relation queries the response was YES. [2024-10-11 14:29:34,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24284 conditions, 4349 events. 1990/4349 cut-off events. For 42246/42487 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 33385 event pairs, 285 based on Foata normal form. 46/4305 useless extension candidates. Maximal degree in co-relation 20984. Up to 1149 conditions per place. [2024-10-11 14:29:34,070 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 260 selfloop transitions, 29 changer transitions 1/321 dead transitions. [2024-10-11 14:29:34,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 321 transitions, 4988 flow [2024-10-11 14:29:34,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:29:34,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 14:29:34,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2024-10-11 14:29:34,073 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7916666666666666 [2024-10-11 14:29:34,073 INFO L175 Difference]: Start difference. First operand has 97 places, 122 transitions, 1547 flow. Second operand 6 states and 133 transitions. [2024-10-11 14:29:34,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 321 transitions, 4988 flow [2024-10-11 14:29:34,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 321 transitions, 4940 flow, removed 24 selfloop flow, removed 0 redundant places. [2024-10-11 14:29:34,151 INFO L231 Difference]: Finished difference. Result has 103 places, 136 transitions, 1669 flow [2024-10-11 14:29:34,151 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1527, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1669, PETRI_PLACES=103, PETRI_TRANSITIONS=136} [2024-10-11 14:29:34,152 INFO L277 CegarLoopForPetriNet]: 28 programPoint places, 75 predicate places. [2024-10-11 14:29:34,152 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 136 transitions, 1669 flow [2024-10-11 14:29:34,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-10-11 14:29:34,152 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:29:34,153 INFO L204 CegarLoopForPetriNet]: trace histogram [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-10-11 14:29:34,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 14:29:34,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:29:34,358 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-10-11 14:29:34,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:29:34,358 INFO L85 PathProgramCache]: Analyzing trace with hash -175691206, now seen corresponding path program 3 times [2024-10-11 14:29:34,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:29:34,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646681631] [2024-10-11 14:29:34,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:29:34,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:29:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:29:34,544 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:29:34,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:29:34,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646681631] [2024-10-11 14:29:34,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646681631] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:29:34,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292435851] [2024-10-11 14:29:34,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 14:29:34,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:29:34,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:29:34,547 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:29:34,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 14:29:34,614 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-11 14:29:34,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:29:34,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 14:29:34,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:29:34,692 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:29:34,692 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:29:34,782 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:29:34,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292435851] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:29:34,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:29:34,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-10-11 14:29:34,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100807837] [2024-10-11 14:29:34,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:29:34,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:29:34,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:29:34,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:29:34,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:29:34,789 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 28 [2024-10-11 14:29:34,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 136 transitions, 1669 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-10-11 14:29:34,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:29:34,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 28 [2024-10-11 14:29:34,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:29:35,994 INFO L124 PetriNetUnfolderBase]: 2526/5576 cut-off events. [2024-10-11 14:29:35,994 INFO L125 PetriNetUnfolderBase]: For 54753/55042 co-relation queries the response was YES. [2024-10-11 14:29:36,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31464 conditions, 5576 events. 2526/5576 cut-off events. For 54753/55042 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 45562 event pairs, 349 based on Foata normal form. 43/5532 useless extension candidates. Maximal degree in co-relation 26755. Up to 2976 conditions per place. [2024-10-11 14:29:36,046 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 253 selfloop transitions, 23 changer transitions 1/308 dead transitions. [2024-10-11 14:29:36,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 308 transitions, 4616 flow [2024-10-11 14:29:36,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:29:36,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 14:29:36,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2024-10-11 14:29:36,048 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7797619047619048 [2024-10-11 14:29:36,048 INFO L175 Difference]: Start difference. First operand has 103 places, 136 transitions, 1669 flow. Second operand 6 states and 131 transitions. [2024-10-11 14:29:36,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 308 transitions, 4616 flow [2024-10-11 14:29:36,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 308 transitions, 4554 flow, removed 24 selfloop flow, removed 1 redundant places. [2024-10-11 14:29:36,157 INFO L231 Difference]: Finished difference. Result has 109 places, 152 transitions, 1809 flow [2024-10-11 14:29:36,158 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1640, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1809, PETRI_PLACES=109, PETRI_TRANSITIONS=152} [2024-10-11 14:29:36,160 INFO L277 CegarLoopForPetriNet]: 28 programPoint places, 81 predicate places. [2024-10-11 14:29:36,161 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 152 transitions, 1809 flow [2024-10-11 14:29:36,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-10-11 14:29:36,161 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:29:36,161 INFO L204 CegarLoopForPetriNet]: trace histogram [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-10-11 14:29:36,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 14:29:36,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 14:29:36,362 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-10-11 14:29:36,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:29:36,362 INFO L85 PathProgramCache]: Analyzing trace with hash -515388196, now seen corresponding path program 4 times [2024-10-11 14:29:36,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:29:36,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131964265] [2024-10-11 14:29:36,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:29:36,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:29:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:29:36,528 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:29:36,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:29:36,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131964265] [2024-10-11 14:29:36,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131964265] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:29:36,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31217510] [2024-10-11 14:29:36,529 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 14:29:36,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:29:36,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:29:36,531 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:29:36,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 14:29:36,596 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 14:29:36,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:29:36,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 14:29:36,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:29:36,675 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:29:36,675 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:29:36,804 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:29:36,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31217510] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:29:36,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:29:36,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-10-11 14:29:36,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049487116] [2024-10-11 14:29:36,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:29:36,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:29:36,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:29:36,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:29:36,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:29:36,813 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 28 [2024-10-11 14:29:36,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 152 transitions, 1809 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-10-11 14:29:36,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:29:36,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 28 [2024-10-11 14:29:36,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:29:38,141 INFO L124 PetriNetUnfolderBase]: 3027/6641 cut-off events. [2024-10-11 14:29:38,141 INFO L125 PetriNetUnfolderBase]: For 65929/66259 co-relation queries the response was YES. [2024-10-11 14:29:38,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37650 conditions, 6641 events. 3027/6641 cut-off events. For 65929/66259 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 55770 event pairs, 428 based on Foata normal form. 91/6638 useless extension candidates. Maximal degree in co-relation 32399. Up to 3382 conditions per place. [2024-10-11 14:29:38,296 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 267 selfloop transitions, 30 changer transitions 1/329 dead transitions. [2024-10-11 14:29:38,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 329 transitions, 4815 flow [2024-10-11 14:29:38,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:29:38,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 14:29:38,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2024-10-11 14:29:38,298 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7797619047619048 [2024-10-11 14:29:38,298 INFO L175 Difference]: Start difference. First operand has 109 places, 152 transitions, 1809 flow. Second operand 6 states and 131 transitions. [2024-10-11 14:29:38,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 329 transitions, 4815 flow [2024-10-11 14:29:38,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 329 transitions, 4805 flow, removed 5 selfloop flow, removed 0 redundant places. [2024-10-11 14:29:38,434 INFO L231 Difference]: Finished difference. Result has 117 places, 173 transitions, 2078 flow [2024-10-11 14:29:38,434 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1799, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2078, PETRI_PLACES=117, PETRI_TRANSITIONS=173} [2024-10-11 14:29:38,435 INFO L277 CegarLoopForPetriNet]: 28 programPoint places, 89 predicate places. [2024-10-11 14:29:38,435 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 173 transitions, 2078 flow [2024-10-11 14:29:38,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-10-11 14:29:38,436 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:29:38,436 INFO L204 CegarLoopForPetriNet]: trace histogram [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-10-11 14:29:38,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 14:29:38,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 14:29:38,637 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-10-11 14:29:38,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:29:38,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1523378012, now seen corresponding path program 5 times [2024-10-11 14:29:38,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:29:38,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456415764] [2024-10-11 14:29:38,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:29:38,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:29:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:29:38,797 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:29:38,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:29:38,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456415764] [2024-10-11 14:29:38,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456415764] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:29:38,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983906505] [2024-10-11 14:29:38,798 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 14:29:38,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:29:38,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:29:38,800 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:29:38,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 14:29:38,863 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-10-11 14:29:38,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:29:38,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 14:29:38,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:29:38,944 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:29:38,944 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:29:39,020 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:29:39,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983906505] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:29:39,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:29:39,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-10-11 14:29:39,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233856405] [2024-10-11 14:29:39,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:29:39,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:29:39,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:29:39,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:29:39,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:29:39,026 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 28 [2024-10-11 14:29:39,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 173 transitions, 2078 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-10-11 14:29:39,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:29:39,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 28 [2024-10-11 14:29:39,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:29:40,339 INFO L124 PetriNetUnfolderBase]: 3534/7693 cut-off events. [2024-10-11 14:29:40,339 INFO L125 PetriNetUnfolderBase]: For 80535/81061 co-relation queries the response was YES. [2024-10-11 14:29:40,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44911 conditions, 7693 events. 3534/7693 cut-off events. For 80535/81061 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 66147 event pairs, 429 based on Foata normal form. 136/7709 useless extension candidates. Maximal degree in co-relation 39026. Up to 3254 conditions per place. [2024-10-11 14:29:40,418 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 302 selfloop transitions, 45 changer transitions 1/379 dead transitions. [2024-10-11 14:29:40,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 379 transitions, 5727 flow [2024-10-11 14:29:40,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:29:40,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 14:29:40,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2024-10-11 14:29:40,420 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7916666666666666 [2024-10-11 14:29:40,420 INFO L175 Difference]: Start difference. First operand has 117 places, 173 transitions, 2078 flow. Second operand 6 states and 133 transitions. [2024-10-11 14:29:40,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 379 transitions, 5727 flow [2024-10-11 14:29:40,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 379 transitions, 5711 flow, removed 8 selfloop flow, removed 0 redundant places. [2024-10-11 14:29:40,606 INFO L231 Difference]: Finished difference. Result has 126 places, 194 transitions, 2427 flow [2024-10-11 14:29:40,607 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2062, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2427, PETRI_PLACES=126, PETRI_TRANSITIONS=194} [2024-10-11 14:29:40,608 INFO L277 CegarLoopForPetriNet]: 28 programPoint places, 98 predicate places. [2024-10-11 14:29:40,608 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 194 transitions, 2427 flow [2024-10-11 14:29:40,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-10-11 14:29:40,609 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:29:40,609 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] [2024-10-11 14:29:40,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 14:29:40,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 14:29:40,810 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-10-11 14:29:40,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:29:40,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1077834746, now seen corresponding path program 6 times [2024-10-11 14:29:40,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:29:40,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499890809] [2024-10-11 14:29:40,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:29:40,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:29:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:29:41,335 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:29:41,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:29:41,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499890809] [2024-10-11 14:29:41,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499890809] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:29:41,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653832213] [2024-10-11 14:29:41,336 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-11 14:29:41,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:29:41,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:29:41,338 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:29:41,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 14:29:41,444 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2024-10-11 14:29:41,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:29:41,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 14:29:41,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:29:41,890 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:29:41,890 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:30:02,059 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:30:02,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653832213] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:30:02,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:30:02,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2024-10-11 14:30:02,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168308944] [2024-10-11 14:30:02,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:30:02,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 14:30:02,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:30:02,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 14:30:02,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=461, Unknown=4, NotChecked=0, Total=552 [2024-10-11 14:30:02,098 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 28 [2024-10-11 14:30:02,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 194 transitions, 2427 flow. Second operand has 24 states, 24 states have (on average 13.375) internal successors, (321), 24 states have internal predecessors, (321), 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-10-11 14:30:02,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:30:02,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 28 [2024-10-11 14:30:02,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:30:10,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 14:30:22,734 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* 8589934592 (div c_~N~0 2147483648))) (.cse1 (* (div (+ c_~i1~0 (- 2)) 4294967296) 4294967296)) (.cse2 (* c_~N~0 2)) (.cse3 (* c_~i1~0 (- 1))) (.cse4 (* (div (mod (+ 2 c_~i2~0) 4294967296) 2) 2)) (.cse5 (mod (+ c_~i1~0 1) 4294967296)) (.cse6 (div c_~i1~0 4294967296))) (and (<= (+ 2 .cse0 c_~i2~0) (+ .cse1 (* (div (+ (- 2) .cse2 c_~i2~0 .cse3) 4294967296) 4294967296) .cse2)) (or (< .cse4 (+ (mod (+ c_~i1~0 2) 4294967296) 1)) (< 4294967293 .cse5)) (<= (+ 3 .cse0 c_~i2~0) (+ .cse1 .cse2 (* (div (+ (- 1) .cse2 c_~i2~0 .cse3) 4294967296) 4294967296))) (<= (+ .cse0 c_~i2~0 1) (+ .cse1 .cse2 (* (div (+ .cse2 (- 3) c_~i2~0 .cse3) 4294967296) 4294967296))) (<= 2 (mod c_~N~0 2147483648)) (<= c_~i2~0 (+ (* (div (+ (- 1) c_~i2~0) 4294967296) 4294967296) 1)) (or (< 4294967293 (mod c_~i1~0 4294967296)) (< .cse4 (+ .cse5 1))) (<= c_~i1~0 (+ (* 4294967296 .cse6) 4294967293)) (<= (+ (* 8589934592 .cse6) c_~i2~0 1) (+ c_~i1~0 (* 4294967296 (div (+ c_~i1~0 (- 1)) 4294967296)) (* (div c_~i2~0 4294967296) 4294967296))))) is different from false [2024-10-11 14:30:24,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 14:30:26,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []