./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe035_power.i --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/pthread-wmm/safe035_power.i -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 6415bffc70cf05f8f6460106962f2f9c59b321fd2fc94a45894cc3c1f3d85b66 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:19:51,052 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:19:51,111 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:19:51,116 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:19:51,116 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:19:51,138 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:19:51,139 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:19:51,139 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:19:51,139 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:19:51,142 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:19:51,142 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:19:51,142 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:19:51,143 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:19:51,143 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:19:51,144 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:19:51,144 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:19:51,145 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:19:51,145 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:19:51,145 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:19:51,145 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:19:51,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:19:51,146 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:19:51,146 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:19:51,146 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:19:51,146 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:19:51,147 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:19:51,147 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:19:51,147 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:19:51,147 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:19:51,147 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:19:51,147 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:19:51,148 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:19:51,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:19:51,148 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:19:51,149 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:19:51,149 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:19:51,149 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:19:51,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:19:51,150 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:19:51,150 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:19:51,150 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:19:51,150 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:19:51,150 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 -> 6415bffc70cf05f8f6460106962f2f9c59b321fd2fc94a45894cc3c1f3d85b66 [2024-10-11 14:19:51,347 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:19:51,367 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:19:51,369 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:19:51,370 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:19:51,370 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:19:51,371 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe035_power.i [2024-10-11 14:19:52,524 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:19:52,720 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:19:52,721 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe035_power.i [2024-10-11 14:19:52,736 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7056dc556/36cb6edb1d4b46a28435f5c6bea12032/FLAGb9918a3bd [2024-10-11 14:19:52,748 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7056dc556/36cb6edb1d4b46a28435f5c6bea12032 [2024-10-11 14:19:52,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:19:52,751 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:19:52,754 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:19:52,754 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:19:52,758 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:19:52,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:19:52" (1/1) ... [2024-10-11 14:19:52,759 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3be1bfb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:19:52, skipping insertion in model container [2024-10-11 14:19:52,759 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:19:52" (1/1) ... [2024-10-11 14:19:52,791 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:19:52,959 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/pthread-wmm/safe035_power.i[947,960] [2024-10-11 14:19:53,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:19:53,154 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:19:53,170 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/pthread-wmm/safe035_power.i[947,960] [2024-10-11 14:19:53,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:19:53,257 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:19:53,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:19:53 WrapperNode [2024-10-11 14:19:53,258 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:19:53,259 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:19:53,259 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:19:53,259 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:19:53,265 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:19:53" (1/1) ... [2024-10-11 14:19:53,280 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:19:53" (1/1) ... [2024-10-11 14:19:53,306 INFO L138 Inliner]: procedures = 175, calls = 48, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 165 [2024-10-11 14:19:53,307 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:19:53,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:19:53,308 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:19:53,308 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:19:53,316 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:19:53" (1/1) ... [2024-10-11 14:19:53,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:19:53" (1/1) ... [2024-10-11 14:19:53,321 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:19:53" (1/1) ... [2024-10-11 14:19:53,346 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:19:53,347 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:19:53" (1/1) ... [2024-10-11 14:19:53,347 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:19:53" (1/1) ... [2024-10-11 14:19:53,359 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:19:53" (1/1) ... [2024-10-11 14:19:53,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:19:53" (1/1) ... [2024-10-11 14:19:53,367 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:19:53" (1/1) ... [2024-10-11 14:19:53,369 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:19:53" (1/1) ... [2024-10-11 14:19:53,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:19:53,377 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:19:53,377 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:19:53,377 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:19:53,377 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:19:53" (1/1) ... [2024-10-11 14:19:53,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:19:53,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:19:53,409 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:19:53,412 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:19:53,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 14:19:53,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:19:53,451 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-11 14:19:53,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-11 14:19:53,451 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-11 14:19:53,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-11 14:19:53,452 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-11 14:19:53,453 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-11 14:19:53,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:19:53,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 14:19:53,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:19:53,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:19:53,455 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:19:53,569 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:19:53,571 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:19:53,914 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 14:19:53,914 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:19:54,114 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:19:54,115 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 14:19:54,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:19:54 BoogieIcfgContainer [2024-10-11 14:19:54,116 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:19:54,117 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:19:54,117 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:19:54,120 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:19:54,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:19:52" (1/3) ... [2024-10-11 14:19:54,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1754764b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:19:54, skipping insertion in model container [2024-10-11 14:19:54,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:19:53" (2/3) ... [2024-10-11 14:19:54,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1754764b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:19:54, skipping insertion in model container [2024-10-11 14:19:54,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:19:54" (3/3) ... [2024-10-11 14:19:54,123 INFO L112 eAbstractionObserver]: Analyzing ICFG safe035_power.i [2024-10-11 14:19:54,135 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:19:54,136 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 14:19:54,136 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 14:19:54,218 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 14:19:54,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 42 transitions, 96 flow [2024-10-11 14:19:54,310 INFO L124 PetriNetUnfolderBase]: 1/39 cut-off events. [2024-10-11 14:19:54,310 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 14:19:54,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 1/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 75 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2024-10-11 14:19:54,313 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 42 transitions, 96 flow [2024-10-11 14:19:54,316 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 39 transitions, 87 flow [2024-10-11 14:19:54,325 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:19:54,331 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;@1423394d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:19:54,332 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-11 14:19:54,338 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:19:54,339 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2024-10-11 14:19:54,339 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 14:19:54,339 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:19:54,339 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:19:54,340 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 14:19:54,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:19:54,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1597382317, now seen corresponding path program 1 times [2024-10-11 14:19:54,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:19:54,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413438833] [2024-10-11 14:19:54,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:19:54,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:19:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:19:54,784 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:19:54,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:19:54,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413438833] [2024-10-11 14:19:54,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413438833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:19:54,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:19:54,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 14:19:54,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462218668] [2024-10-11 14:19:54,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:19:54,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:19:54,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:19:54,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:19:54,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:19:54,821 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 42 [2024-10-11 14:19:54,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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:19:54,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:19:54,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 42 [2024-10-11 14:19:54,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:19:55,464 INFO L124 PetriNetUnfolderBase]: 1951/3088 cut-off events. [2024-10-11 14:19:55,465 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-10-11 14:19:55,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5983 conditions, 3088 events. 1951/3088 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 18876 event pairs, 266 based on Foata normal form. 120/3172 useless extension candidates. Maximal degree in co-relation 5972. Up to 2386 conditions per place. [2024-10-11 14:19:55,487 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 33 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2024-10-11 14:19:55,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 50 transitions, 183 flow [2024-10-11 14:19:55,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:19:55,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:19:55,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2024-10-11 14:19:55,499 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6984126984126984 [2024-10-11 14:19:55,500 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 87 flow. Second operand 3 states and 88 transitions. [2024-10-11 14:19:55,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 50 transitions, 183 flow [2024-10-11 14:19:55,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 50 transitions, 180 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 14:19:55,506 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-10-11 14:19:55,508 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-10-11 14:19:55,511 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2024-10-11 14:19:55,511 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-10-11 14:19:55,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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:19:55,512 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:19:55,512 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:19:55,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:19:55,512 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 14:19:55,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:19:55,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1890798407, now seen corresponding path program 1 times [2024-10-11 14:19:55,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:19:55,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985033299] [2024-10-11 14:19:55,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:19:55,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:19:55,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:19:55,809 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:19:55,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:19:55,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985033299] [2024-10-11 14:19:55,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985033299] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:19:55,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:19:55,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:19:55,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619211460] [2024-10-11 14:19:55,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:19:55,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:19:55,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:19:55,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:19:55,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:19:55,819 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2024-10-11 14:19:55,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:19:55,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:19:55,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2024-10-11 14:19:55,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:19:56,522 INFO L124 PetriNetUnfolderBase]: 2423/3832 cut-off events. [2024-10-11 14:19:56,522 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2024-10-11 14:19:56,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7578 conditions, 3832 events. 2423/3832 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 24159 event pairs, 661 based on Foata normal form. 0/3748 useless extension candidates. Maximal degree in co-relation 7568. Up to 1372 conditions per place. [2024-10-11 14:19:56,535 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 32 selfloop transitions, 2 changer transitions 53/98 dead transitions. [2024-10-11 14:19:56,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 98 transitions, 384 flow [2024-10-11 14:19:56,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 14:19:56,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 14:19:56,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 201 transitions. [2024-10-11 14:19:56,540 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5982142857142857 [2024-10-11 14:19:56,540 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 8 states and 201 transitions. [2024-10-11 14:19:56,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 98 transitions, 384 flow [2024-10-11 14:19:56,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 98 transitions, 376 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 14:19:56,545 INFO L231 Difference]: Finished difference. Result has 55 places, 35 transitions, 92 flow [2024-10-11 14:19:56,545 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=92, PETRI_PLACES=55, PETRI_TRANSITIONS=35} [2024-10-11 14:19:56,546 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places. [2024-10-11 14:19:56,546 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 35 transitions, 92 flow [2024-10-11 14:19:56,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:19:56,546 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:19:56,547 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:19:56,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:19:56,547 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 14:19:56,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:19:56,548 INFO L85 PathProgramCache]: Analyzing trace with hash 286561760, now seen corresponding path program 1 times [2024-10-11 14:19:56,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:19:56,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841122003] [2024-10-11 14:19:56,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:19:56,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:19:56,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:19:57,541 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:19:57,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:19:57,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841122003] [2024-10-11 14:19:57,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841122003] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:19:57,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:19:57,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:19:57,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170768176] [2024-10-11 14:19:57,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:19:57,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:19:57,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:19:57,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:19:57,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:19:57,554 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42 [2024-10-11 14:19:57,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 35 transitions, 92 flow. Second operand has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 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:19:57,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:19:57,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42 [2024-10-11 14:19:57,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:19:58,868 INFO L124 PetriNetUnfolderBase]: 3661/5794 cut-off events. [2024-10-11 14:19:58,868 INFO L125 PetriNetUnfolderBase]: For 730/730 co-relation queries the response was YES. [2024-10-11 14:19:58,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12528 conditions, 5794 events. 3661/5794 cut-off events. For 730/730 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 37061 event pairs, 543 based on Foata normal form. 135/5911 useless extension candidates. Maximal degree in co-relation 12513. Up to 2389 conditions per place. [2024-10-11 14:19:58,891 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 53 selfloop transitions, 15 changer transitions 47/125 dead transitions. [2024-10-11 14:19:58,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 125 transitions, 518 flow [2024-10-11 14:19:58,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 14:19:58,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-11 14:19:58,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 247 transitions. [2024-10-11 14:19:58,893 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5880952380952381 [2024-10-11 14:19:58,893 INFO L175 Difference]: Start difference. First operand has 55 places, 35 transitions, 92 flow. Second operand 10 states and 247 transitions. [2024-10-11 14:19:58,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 125 transitions, 518 flow [2024-10-11 14:19:58,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 125 transitions, 494 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-10-11 14:19:58,949 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 201 flow [2024-10-11 14:19:58,949 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=201, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2024-10-11 14:19:58,949 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 11 predicate places. [2024-10-11 14:19:58,950 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 201 flow [2024-10-11 14:19:58,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 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:19:58,950 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:19:58,950 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] [2024-10-11 14:19:58,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:19:58,951 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 14:19:58,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:19:58,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1248427591, now seen corresponding path program 1 times [2024-10-11 14:19:58,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:19:58,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962196587] [2024-10-11 14:19:58,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:19:58,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:19:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:19:59,793 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:19:59,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:19:59,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962196587] [2024-10-11 14:19:59,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962196587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:19:59,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:19:59,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:19:59,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115777894] [2024-10-11 14:19:59,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:19:59,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:19:59,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:19:59,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:19:59,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:19:59,803 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42 [2024-10-11 14:19:59,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 201 flow. Second operand has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 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:19:59,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:19:59,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42 [2024-10-11 14:19:59,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:20:01,242 INFO L124 PetriNetUnfolderBase]: 4136/6596 cut-off events. [2024-10-11 14:20:01,242 INFO L125 PetriNetUnfolderBase]: For 6750/6770 co-relation queries the response was YES. [2024-10-11 14:20:01,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19896 conditions, 6596 events. 4136/6596 cut-off events. For 6750/6770 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 43690 event pairs, 442 based on Foata normal form. 65/6643 useless extension candidates. Maximal degree in co-relation 19878. Up to 2790 conditions per place. [2024-10-11 14:20:01,279 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 73 selfloop transitions, 20 changer transitions 38/141 dead transitions. [2024-10-11 14:20:01,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 141 transitions, 881 flow [2024-10-11 14:20:01,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 14:20:01,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-11 14:20:01,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 275 transitions. [2024-10-11 14:20:01,282 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5456349206349206 [2024-10-11 14:20:01,282 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 201 flow. Second operand 12 states and 275 transitions. [2024-10-11 14:20:01,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 141 transitions, 881 flow [2024-10-11 14:20:01,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 141 transitions, 858 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-10-11 14:20:01,295 INFO L231 Difference]: Finished difference. Result has 70 places, 60 transitions, 383 flow [2024-10-11 14:20:01,296 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=383, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2024-10-11 14:20:01,296 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 22 predicate places. [2024-10-11 14:20:01,296 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 383 flow [2024-10-11 14:20:01,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 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:20:01,297 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:20:01,297 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] [2024-10-11 14:20:01,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:20:01,297 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 14:20:01,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:20:01,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1719423301, now seen corresponding path program 2 times [2024-10-11 14:20:01,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:20:01,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169279546] [2024-10-11 14:20:01,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:20:01,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:20:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:20:01,517 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:20:01,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:20:01,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169279546] [2024-10-11 14:20:01,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169279546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:20:01,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:20:01,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:20:01,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810993239] [2024-10-11 14:20:01,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:20:01,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:20:01,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:20:01,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:20:01,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:20:01,522 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42 [2024-10-11 14:20:01,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 383 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:20:01,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:20:01,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42 [2024-10-11 14:20:01,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:20:02,578 INFO L124 PetriNetUnfolderBase]: 5898/9037 cut-off events. [2024-10-11 14:20:02,578 INFO L125 PetriNetUnfolderBase]: For 35249/35379 co-relation queries the response was YES. [2024-10-11 14:20:02,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35217 conditions, 9037 events. 5898/9037 cut-off events. For 35249/35379 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 55967 event pairs, 832 based on Foata normal form. 565/9555 useless extension candidates. Maximal degree in co-relation 35193. Up to 4184 conditions per place. [2024-10-11 14:20:02,620 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 99 selfloop transitions, 5 changer transitions 6/123 dead transitions. [2024-10-11 14:20:02,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 123 transitions, 1017 flow [2024-10-11 14:20:02,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:20:02,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 14:20:02,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2024-10-11 14:20:02,622 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6547619047619048 [2024-10-11 14:20:02,623 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 383 flow. Second operand 4 states and 110 transitions. [2024-10-11 14:20:02,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 123 transitions, 1017 flow [2024-10-11 14:20:02,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 123 transitions, 981 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-10-11 14:20:02,647 INFO L231 Difference]: Finished difference. Result has 65 places, 64 transitions, 401 flow [2024-10-11 14:20:02,648 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=401, PETRI_PLACES=65, PETRI_TRANSITIONS=64} [2024-10-11 14:20:02,649 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 17 predicate places. [2024-10-11 14:20:02,649 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 401 flow [2024-10-11 14:20:02,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:20:02,650 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:20:02,650 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, 1] [2024-10-11 14:20:02,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:20:02,650 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 14:20:02,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:20:02,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1533968904, now seen corresponding path program 1 times [2024-10-11 14:20:02,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:20:02,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202941982] [2024-10-11 14:20:02,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:20:02,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:20:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:20:02,845 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:20:02,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:20:02,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202941982] [2024-10-11 14:20:02,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202941982] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:20:02,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:20:02,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:20:02,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212775991] [2024-10-11 14:20:02,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:20:02,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:20:02,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:20:02,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:20:02,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:20:02,856 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42 [2024-10-11 14:20:02,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 401 flow. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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:20:02,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:20:02,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42 [2024-10-11 14:20:02,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:20:03,670 INFO L124 PetriNetUnfolderBase]: 4475/6982 cut-off events. [2024-10-11 14:20:03,670 INFO L125 PetriNetUnfolderBase]: For 26026/26142 co-relation queries the response was YES. [2024-10-11 14:20:03,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28149 conditions, 6982 events. 4475/6982 cut-off events. For 26026/26142 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 42094 event pairs, 736 based on Foata normal form. 404/7339 useless extension candidates. Maximal degree in co-relation 28125. Up to 2574 conditions per place. [2024-10-11 14:20:03,700 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 99 selfloop transitions, 8 changer transitions 12/132 dead transitions. [2024-10-11 14:20:03,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 132 transitions, 1092 flow [2024-10-11 14:20:03,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:20:03,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:20:03,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2024-10-11 14:20:03,702 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6714285714285714 [2024-10-11 14:20:03,702 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 401 flow. Second operand 5 states and 141 transitions. [2024-10-11 14:20:03,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 132 transitions, 1092 flow [2024-10-11 14:20:03,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 132 transitions, 1089 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 14:20:03,716 INFO L231 Difference]: Finished difference. Result has 70 places, 66 transitions, 439 flow [2024-10-11 14:20:03,716 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=439, PETRI_PLACES=70, PETRI_TRANSITIONS=66} [2024-10-11 14:20:03,717 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 22 predicate places. [2024-10-11 14:20:03,717 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 66 transitions, 439 flow [2024-10-11 14:20:03,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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:20:03,717 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:20:03,718 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, 1, 1, 1, 1, 1] [2024-10-11 14:20:03,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:20:03,718 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 14:20:03,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:20:03,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1491675154, now seen corresponding path program 1 times [2024-10-11 14:20:03,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:20:03,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824838476] [2024-10-11 14:20:03,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:20:03,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:20:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:20:04,999 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:20:05,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:20:05,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824838476] [2024-10-11 14:20:05,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824838476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:20:05,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:20:05,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:20:05,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357106526] [2024-10-11 14:20:05,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:20:05,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:20:05,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:20:05,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:20:05,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:20:05,007 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42 [2024-10-11 14:20:05,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 66 transitions, 439 flow. Second operand has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 9 states have internal predecessors, (136), 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:20:05,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:20:05,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42 [2024-10-11 14:20:05,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:20:06,074 INFO L124 PetriNetUnfolderBase]: 3424/6083 cut-off events. [2024-10-11 14:20:06,074 INFO L125 PetriNetUnfolderBase]: For 20206/21314 co-relation queries the response was YES. [2024-10-11 14:20:06,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24252 conditions, 6083 events. 3424/6083 cut-off events. For 20206/21314 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 43917 event pairs, 583 based on Foata normal form. 185/5890 useless extension candidates. Maximal degree in co-relation 24225. Up to 1940 conditions per place. [2024-10-11 14:20:06,101 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 52 selfloop transitions, 13 changer transitions 70/153 dead transitions. [2024-10-11 14:20:06,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 153 transitions, 1353 flow [2024-10-11 14:20:06,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 14:20:06,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-11 14:20:06,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 285 transitions. [2024-10-11 14:20:06,104 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.521978021978022 [2024-10-11 14:20:06,104 INFO L175 Difference]: Start difference. First operand has 70 places, 66 transitions, 439 flow. Second operand 13 states and 285 transitions. [2024-10-11 14:20:06,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 153 transitions, 1353 flow [2024-10-11 14:20:06,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 153 transitions, 1329 flow, removed 9 selfloop flow, removed 2 redundant places. [2024-10-11 14:20:06,125 INFO L231 Difference]: Finished difference. Result has 88 places, 62 transitions, 475 flow [2024-10-11 14:20:06,125 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=475, PETRI_PLACES=88, PETRI_TRANSITIONS=62} [2024-10-11 14:20:06,126 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 40 predicate places. [2024-10-11 14:20:06,126 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 62 transitions, 475 flow [2024-10-11 14:20:06,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 9 states have internal predecessors, (136), 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:20:06,126 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:20:06,126 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, 1, 1, 1, 1, 1] [2024-10-11 14:20:06,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:20:06,126 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 14:20:06,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:20:06,127 INFO L85 PathProgramCache]: Analyzing trace with hash 70659006, now seen corresponding path program 2 times [2024-10-11 14:20:06,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:20:06,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789999060] [2024-10-11 14:20:06,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:20:06,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:20:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:20:06,355 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:20:06,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:20:06,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789999060] [2024-10-11 14:20:06,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789999060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:20:06,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:20:06,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:20:06,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074920887] [2024-10-11 14:20:06,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:20:06,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:20:06,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:20:06,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:20:06,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:20:06,364 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42 [2024-10-11 14:20:06,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 62 transitions, 475 flow. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:20:06,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:20:06,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42 [2024-10-11 14:20:06,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:20:06,709 INFO L124 PetriNetUnfolderBase]: 1487/2411 cut-off events. [2024-10-11 14:20:06,709 INFO L125 PetriNetUnfolderBase]: For 16111/16205 co-relation queries the response was YES. [2024-10-11 14:20:06,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11330 conditions, 2411 events. 1487/2411 cut-off events. For 16111/16205 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 12529 event pairs, 252 based on Foata normal form. 107/2501 useless extension candidates. Maximal degree in co-relation 11295. Up to 967 conditions per place. [2024-10-11 14:20:06,722 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 77 selfloop transitions, 11 changer transitions 0/99 dead transitions. [2024-10-11 14:20:06,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 99 transitions, 941 flow [2024-10-11 14:20:06,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:20:06,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 14:20:06,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2024-10-11 14:20:06,723 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5515873015873016 [2024-10-11 14:20:06,723 INFO L175 Difference]: Start difference. First operand has 88 places, 62 transitions, 475 flow. Second operand 6 states and 139 transitions. [2024-10-11 14:20:06,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 99 transitions, 941 flow [2024-10-11 14:20:06,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 99 transitions, 756 flow, removed 55 selfloop flow, removed 18 redundant places. [2024-10-11 14:20:06,737 INFO L231 Difference]: Finished difference. Result has 70 places, 62 transitions, 387 flow [2024-10-11 14:20:06,737 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=387, PETRI_PLACES=70, PETRI_TRANSITIONS=62} [2024-10-11 14:20:06,737 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 22 predicate places. [2024-10-11 14:20:06,737 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 62 transitions, 387 flow [2024-10-11 14:20:06,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:20:06,738 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:20:06,738 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:20:06,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 14:20:06,738 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 14:20:06,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:20:06,739 INFO L85 PathProgramCache]: Analyzing trace with hash 619321625, now seen corresponding path program 1 times [2024-10-11 14:20:06,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:20:06,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320665156] [2024-10-11 14:20:06,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:20:06,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:20:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:20:07,040 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:20:07,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:20:07,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320665156] [2024-10-11 14:20:07,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320665156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:20:07,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:20:07,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:20:07,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775875601] [2024-10-11 14:20:07,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:20:07,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:20:07,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:20:07,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:20:07,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:20:07,045 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42 [2024-10-11 14:20:07,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 62 transitions, 387 flow. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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:20:07,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:20:07,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42 [2024-10-11 14:20:07,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:20:07,422 INFO L124 PetriNetUnfolderBase]: 1254/2284 cut-off events. [2024-10-11 14:20:07,422 INFO L125 PetriNetUnfolderBase]: For 7507/8077 co-relation queries the response was YES. [2024-10-11 14:20:07,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8435 conditions, 2284 events. 1254/2284 cut-off events. For 7507/8077 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 14344 event pairs, 173 based on Foata normal form. 90/2157 useless extension candidates. Maximal degree in co-relation 8411. Up to 1187 conditions per place. [2024-10-11 14:20:07,431 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 33 selfloop transitions, 1 changer transitions 43/96 dead transitions. [2024-10-11 14:20:07,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 96 transitions, 710 flow [2024-10-11 14:20:07,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:20:07,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 14:20:07,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2024-10-11 14:20:07,432 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5158730158730159 [2024-10-11 14:20:07,433 INFO L175 Difference]: Start difference. First operand has 70 places, 62 transitions, 387 flow. Second operand 6 states and 130 transitions. [2024-10-11 14:20:07,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 96 transitions, 710 flow [2024-10-11 14:20:07,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 96 transitions, 650 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-10-11 14:20:07,440 INFO L231 Difference]: Finished difference. Result has 74 places, 48 transitions, 265 flow [2024-10-11 14:20:07,440 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=265, PETRI_PLACES=74, PETRI_TRANSITIONS=48} [2024-10-11 14:20:07,441 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 26 predicate places. [2024-10-11 14:20:07,441 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 48 transitions, 265 flow [2024-10-11 14:20:07,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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:20:07,441 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:20:07,442 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:20:07,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 14:20:07,442 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 14:20:07,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:20:07,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1922864293, now seen corresponding path program 2 times [2024-10-11 14:20:07,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:20:07,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112684801] [2024-10-11 14:20:07,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:20:07,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:20:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:20:09,171 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:20:09,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:20:09,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112684801] [2024-10-11 14:20:09,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112684801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:20:09,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:20:09,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:20:09,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482170124] [2024-10-11 14:20:09,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:20:09,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:20:09,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:20:09,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:20:09,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:20:09,178 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42 [2024-10-11 14:20:09,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 48 transitions, 265 flow. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 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:20:09,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:20:09,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42 [2024-10-11 14:20:09,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:20:09,708 INFO L124 PetriNetUnfolderBase]: 1011/1925 cut-off events. [2024-10-11 14:20:09,709 INFO L125 PetriNetUnfolderBase]: For 3315/3570 co-relation queries the response was YES. [2024-10-11 14:20:09,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6348 conditions, 1925 events. 1011/1925 cut-off events. For 3315/3570 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 12365 event pairs, 289 based on Foata normal form. 52/1780 useless extension candidates. Maximal degree in co-relation 6323. Up to 937 conditions per place. [2024-10-11 14:20:09,715 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 30 selfloop transitions, 5 changer transitions 29/83 dead transitions. [2024-10-11 14:20:09,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 83 transitions, 570 flow [2024-10-11 14:20:09,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 14:20:09,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 14:20:09,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions. [2024-10-11 14:20:09,716 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2024-10-11 14:20:09,716 INFO L175 Difference]: Start difference. First operand has 74 places, 48 transitions, 265 flow. Second operand 8 states and 161 transitions. [2024-10-11 14:20:09,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 83 transitions, 570 flow [2024-10-11 14:20:09,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 83 transitions, 543 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-10-11 14:20:09,720 INFO L231 Difference]: Finished difference. Result has 74 places, 50 transitions, 301 flow [2024-10-11 14:20:09,720 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=301, PETRI_PLACES=74, PETRI_TRANSITIONS=50} [2024-10-11 14:20:09,721 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 26 predicate places. [2024-10-11 14:20:09,721 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 50 transitions, 301 flow [2024-10-11 14:20:09,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 9 states have internal predecessors, (139), 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:20:09,722 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:20:09,722 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:20:09,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 14:20:09,722 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 14:20:09,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:20:09,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1686839965, now seen corresponding path program 3 times [2024-10-11 14:20:09,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:20:09,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036368567] [2024-10-11 14:20:09,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:20:09,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:20:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:20:11,738 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:20:11,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:20:11,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036368567] [2024-10-11 14:20:11,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036368567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:20:11,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:20:11,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 14:20:11,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131903460] [2024-10-11 14:20:11,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:20:11,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 14:20:11,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:20:11,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 14:20:11,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-11 14:20:11,744 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42 [2024-10-11 14:20:11,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 50 transitions, 301 flow. Second operand has 13 states, 13 states have (on average 14.692307692307692) internal successors, (191), 13 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:20:11,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:20:11,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42 [2024-10-11 14:20:11,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:20:12,128 INFO L124 PetriNetUnfolderBase]: 457/981 cut-off events. [2024-10-11 14:20:12,129 INFO L125 PetriNetUnfolderBase]: For 2309/2436 co-relation queries the response was YES. [2024-10-11 14:20:12,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3443 conditions, 981 events. 457/981 cut-off events. For 2309/2436 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5820 event pairs, 142 based on Foata normal form. 27/934 useless extension candidates. Maximal degree in co-relation 3425. Up to 366 conditions per place. [2024-10-11 14:20:12,132 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 0 selfloop transitions, 0 changer transitions 67/67 dead transitions. [2024-10-11 14:20:12,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 67 transitions, 468 flow [2024-10-11 14:20:12,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:20:12,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 14:20:12,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-10-11 14:20:12,133 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4312169312169312 [2024-10-11 14:20:12,133 INFO L175 Difference]: Start difference. First operand has 74 places, 50 transitions, 301 flow. Second operand 9 states and 163 transitions. [2024-10-11 14:20:12,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 67 transitions, 468 flow [2024-10-11 14:20:12,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 67 transitions, 455 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-11 14:20:12,136 INFO L231 Difference]: Finished difference. Result has 73 places, 0 transitions, 0 flow [2024-10-11 14:20:12,137 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=0, PETRI_PLACES=73, PETRI_TRANSITIONS=0} [2024-10-11 14:20:12,137 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 25 predicate places. [2024-10-11 14:20:12,137 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 0 transitions, 0 flow [2024-10-11 14:20:12,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 14.692307692307692) internal successors, (191), 13 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:20:12,139 INFO L782 garLoopResultBuilder]: Registering result SAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-10-11 14:20:12,140 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-10-11 14:20:12,140 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-10-11 14:20:12,140 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-10-11 14:20:12,140 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-10-11 14:20:12,140 INFO L782 garLoopResultBuilder]: Registering result SAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-10-11 14:20:12,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 14:20:12,141 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1] [2024-10-11 14:20:12,144 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 14:20:12,144 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 14:20:12,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:20:12 BasicIcfg [2024-10-11 14:20:12,148 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 14:20:12,148 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 14:20:12,148 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 14:20:12,149 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 14:20:12,149 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:19:54" (3/4) ... [2024-10-11 14:20:12,150 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 14:20:12,152 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure P0 [2024-10-11 14:20:12,152 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure P1 [2024-10-11 14:20:12,152 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure P2 [2024-10-11 14:20:12,157 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 88 nodes and edges [2024-10-11 14:20:12,158 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-11 14:20:12,159 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-11 14:20:12,159 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-11 14:20:12,232 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 14:20:12,232 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 14:20:12,232 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 14:20:12,233 INFO L158 Benchmark]: Toolchain (without parser) took 19481.58ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 72.5MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 70.6MB. Max. memory is 16.1GB. [2024-10-11 14:20:12,233 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 142.6MB. Free memory is still 94.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 14:20:12,233 INFO L158 Benchmark]: CACSL2BoogieTranslator took 504.44ms. Allocated memory was 142.6MB in the beginning and 211.8MB in the end (delta: 69.2MB). Free memory was 72.3MB in the beginning and 165.7MB in the end (delta: -93.3MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2024-10-11 14:20:12,234 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.31ms. Allocated memory is still 211.8MB. Free memory was 165.7MB in the beginning and 162.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 14:20:12,234 INFO L158 Benchmark]: Boogie Preprocessor took 68.41ms. Allocated memory is still 211.8MB. Free memory was 162.5MB in the beginning and 156.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 14:20:12,234 INFO L158 Benchmark]: RCFGBuilder took 738.98ms. Allocated memory is still 211.8MB. Free memory was 156.2MB in the beginning and 70.2MB in the end (delta: 86.0MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. [2024-10-11 14:20:12,234 INFO L158 Benchmark]: TraceAbstraction took 18030.88ms. Allocated memory was 211.8MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 69.2MB in the beginning and 1.5GB in the end (delta: -1.4GB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 14:20:12,235 INFO L158 Benchmark]: Witness Printer took 83.90ms. Allocated memory is still 1.6GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 14:20:12,236 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 142.6MB. Free memory is still 94.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 504.44ms. Allocated memory was 142.6MB in the beginning and 211.8MB in the end (delta: 69.2MB). Free memory was 72.3MB in the beginning and 165.7MB in the end (delta: -93.3MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.31ms. Allocated memory is still 211.8MB. Free memory was 165.7MB in the beginning and 162.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.41ms. Allocated memory is still 211.8MB. Free memory was 162.5MB in the beginning and 156.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 738.98ms. Allocated memory is still 211.8MB. Free memory was 156.2MB in the beginning and 70.2MB in the end (delta: 86.0MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. * TraceAbstraction took 18030.88ms. Allocated memory was 211.8MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 69.2MB in the beginning and 1.5GB in the end (delta: -1.4GB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 83.90ms. Allocated memory is still 1.6GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 70 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 693 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 676 mSDsluCounter, 243 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 208 mSDsCounter, 157 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2424 IncrementalHoareTripleChecker+Invalid, 2581 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 157 mSolverCounterUnsat, 35 mSDtfsCounter, 2424 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=475occurred in iteration=7, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 239 ConstructedInterpolants, 0 QuantifiedInterpolants, 1896 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 14:20:12,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE