./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9d6df98e8ac4880739ff8c7fa9cf00b32c56a4c64770b2bc9bcfef3d013872fa --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:16:41,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:16:41,680 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 10:16:41,684 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:16:41,684 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:16:41,699 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:16:41,700 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:16:41,700 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:16:41,701 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:16:41,701 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:16:41,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:16:41,702 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:16:41,702 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:16:41,702 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:16:41,703 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:16:41,703 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:16:41,703 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:16:41,704 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:16:41,704 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:16:41,704 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:16:41,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:16:41,705 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:16:41,705 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:16:41,705 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:16:41,705 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:16:41,706 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:16:41,706 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:16:41,706 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:16:41,706 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:16:41,707 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:16:41,707 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:16:41,707 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:16:41,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:16:41,708 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:16:41,708 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:16:41,708 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:16:41,708 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:16:41,709 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:16:41,709 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:16:41,709 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:16:41,709 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:16:41,710 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:16:41,710 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9d6df98e8ac4880739ff8c7fa9cf00b32c56a4c64770b2bc9bcfef3d013872fa [2024-11-10 10:16:41,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:16:41,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:16:41,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:16:41,927 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:16:41,928 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:16:41,929 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-10 10:16:43,342 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:16:43,554 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:16:43,555 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-10 10:16:43,580 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c247c20f/392ac93beb774d58b744e4d9cfde5898/FLAGad18e4093 [2024-11-10 10:16:43,596 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c247c20f/392ac93beb774d58b744e4d9cfde5898 [2024-11-10 10:16:43,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:16:43,602 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:16:43,604 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:16:43,605 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:16:43,610 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:16:43,612 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:16:43" (1/1) ... [2024-11-10 10:16:43,613 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ad575f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:16:43, skipping insertion in model container [2024-11-10 10:16:43,613 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:16:43" (1/1) ... [2024-11-10 10:16:43,655 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:16:43,868 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2024-11-10 10:16:44,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:16:44,046 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:16:44,058 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2024-11-10 10:16:44,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:16:44,152 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:16:44,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:16:44 WrapperNode [2024-11-10 10:16:44,153 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:16:44,154 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:16:44,154 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:16:44,154 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:16:44,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:16:44" (1/1) ... [2024-11-10 10:16:44,172 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:16:44" (1/1) ... [2024-11-10 10:16:44,198 INFO L138 Inliner]: procedures = 174, calls = 39, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 149 [2024-11-10 10:16:44,199 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:16:44,199 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:16:44,200 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:16:44,200 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:16:44,210 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:16:44" (1/1) ... [2024-11-10 10:16:44,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:16:44" (1/1) ... [2024-11-10 10:16:44,215 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:16:44" (1/1) ... [2024-11-10 10:16:44,231 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 10:16:44,231 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:16:44" (1/1) ... [2024-11-10 10:16:44,231 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:16:44" (1/1) ... [2024-11-10 10:16:44,238 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:16:44" (1/1) ... [2024-11-10 10:16:44,239 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:16:44" (1/1) ... [2024-11-10 10:16:44,240 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:16:44" (1/1) ... [2024-11-10 10:16:44,242 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:16:44" (1/1) ... [2024-11-10 10:16:44,244 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:16:44,245 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:16:44,245 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:16:44,245 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:16:44,246 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:16:44" (1/1) ... [2024-11-10 10:16:44,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:16:44,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:16:44,282 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 10:16:44,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 10:16:44,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 10:16:44,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:16:44,333 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-10 10:16:44,333 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-10 10:16:44,333 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-10 10:16:44,333 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-10 10:16:44,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 10:16:44,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 10:16:44,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:16:44,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:16:44,335 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 10:16:44,440 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:16:44,442 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:16:44,806 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 10:16:44,807 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:16:45,118 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:16:45,119 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:16:45,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:16:45 BoogieIcfgContainer [2024-11-10 10:16:45,119 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:16:45,122 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:16:45,123 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:16:45,126 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:16:45,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:16:43" (1/3) ... [2024-11-10 10:16:45,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33275fce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:16:45, skipping insertion in model container [2024-11-10 10:16:45,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:16:44" (2/3) ... [2024-11-10 10:16:45,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33275fce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:16:45, skipping insertion in model container [2024-11-10 10:16:45,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:16:45" (3/3) ... [2024-11-10 10:16:45,129 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-10 10:16:45,144 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:16:45,145 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 10:16:45,146 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 10:16:45,191 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 10:16:45,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 33 transitions, 74 flow [2024-11-10 10:16:45,252 INFO L124 PetriNetUnfolderBase]: 1/31 cut-off events. [2024-11-10 10:16:45,253 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:16:45,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 31 events. 1/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 52 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2024-11-10 10:16:45,257 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 33 transitions, 74 flow [2024-11-10 10:16:45,259 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 31 transitions, 68 flow [2024-11-10 10:16:45,266 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:16:45,272 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;@125cdcbd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:16:45,272 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-10 10:16:45,279 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:16:45,281 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-10 10:16:45,281 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:16:45,281 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:16:45,283 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 10:16:45,284 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:16:45,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:16:45,290 INFO L85 PathProgramCache]: Analyzing trace with hash -726072993, now seen corresponding path program 1 times [2024-11-10 10:16:45,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:16:45,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470599426] [2024-11-10 10:16:45,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:16:45,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:16:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:16:45,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:16:45,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:16:45,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470599426] [2024-11-10 10:16:45,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470599426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:16:45,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:16:45,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 10:16:45,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771788800] [2024-11-10 10:16:45,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:16:45,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:16:45,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:16:45,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:16:45,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:16:45,896 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-11-10 10:16:45,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:16:45,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:16:45,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-11-10 10:16:45,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:16:46,394 INFO L124 PetriNetUnfolderBase]: 830/1366 cut-off events. [2024-11-10 10:16:46,399 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-10 10:16:46,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2735 conditions, 1366 events. 830/1366 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6377 event pairs, 60 based on Foata normal form. 56/1419 useless extension candidates. Maximal degree in co-relation 2725. Up to 1212 conditions per place. [2024-11-10 10:16:46,419 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 35 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2024-11-10 10:16:46,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 43 transitions, 170 flow [2024-11-10 10:16:46,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:16:46,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:16:46,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2024-11-10 10:16:46,440 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2024-11-10 10:16:46,442 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 68 flow. Second operand 3 states and 60 transitions. [2024-11-10 10:16:46,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 43 transitions, 170 flow [2024-11-10 10:16:46,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 43 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:16:46,450 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 64 flow [2024-11-10 10:16:46,451 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2024-11-10 10:16:46,459 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, -1 predicate places. [2024-11-10 10:16:46,459 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 64 flow [2024-11-10 10:16:46,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:16:46,459 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:16:46,460 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:16:46,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:16:46,460 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:16:46,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:16:46,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1408746165, now seen corresponding path program 1 times [2024-11-10 10:16:46,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:16:46,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311234381] [2024-11-10 10:16:46,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:16:46,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:16:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:16:47,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:16:47,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:16:47,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311234381] [2024-11-10 10:16:47,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311234381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:16:47,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:16:47,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:16:47,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611251371] [2024-11-10 10:16:47,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:16:47,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:16:47,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:16:47,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:16:47,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:16:47,186 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-11-10 10:16:47,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 64 flow. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:16:47,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:16:47,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-11-10 10:16:47,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:16:47,618 INFO L124 PetriNetUnfolderBase]: 930/1571 cut-off events. [2024-11-10 10:16:47,618 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2024-11-10 10:16:47,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3180 conditions, 1571 events. 930/1571 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 7503 event pairs, 236 based on Foata normal form. 0/1533 useless extension candidates. Maximal degree in co-relation 3170. Up to 745 conditions per place. [2024-11-10 10:16:47,625 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 32 selfloop transitions, 2 changer transitions 54/91 dead transitions. [2024-11-10 10:16:47,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 91 transitions, 370 flow [2024-11-10 10:16:47,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 10:16:47,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 10:16:47,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2024-11-10 10:16:47,627 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49242424242424243 [2024-11-10 10:16:47,627 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 64 flow. Second operand 8 states and 130 transitions. [2024-11-10 10:16:47,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 91 transitions, 370 flow [2024-11-10 10:16:47,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 91 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:16:47,630 INFO L231 Difference]: Finished difference. Result has 45 places, 27 transitions, 74 flow [2024-11-10 10:16:47,631 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=74, PETRI_PLACES=45, PETRI_TRANSITIONS=27} [2024-11-10 10:16:47,631 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 8 predicate places. [2024-11-10 10:16:47,631 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 27 transitions, 74 flow [2024-11-10 10:16:47,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:16:47,631 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:16:47,632 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:16:47,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:16:47,632 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:16:47,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:16:47,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1136412050, now seen corresponding path program 1 times [2024-11-10 10:16:47,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:16:47,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492899338] [2024-11-10 10:16:47,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:16:47,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:16:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:16:48,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:16:48,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:16:48,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492899338] [2024-11-10 10:16:48,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492899338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:16:48,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:16:48,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:16:48,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506689033] [2024-11-10 10:16:48,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:16:48,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:16:48,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:16:48,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:16:48,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:16:48,022 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-11-10 10:16:48,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 27 transitions, 74 flow. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:16:48,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:16:48,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-11-10 10:16:48,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:16:48,328 INFO L124 PetriNetUnfolderBase]: 631/1079 cut-off events. [2024-11-10 10:16:48,329 INFO L125 PetriNetUnfolderBase]: For 245/245 co-relation queries the response was YES. [2024-11-10 10:16:48,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2415 conditions, 1079 events. 631/1079 cut-off events. For 245/245 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4803 event pairs, 211 based on Foata normal form. 35/1111 useless extension candidates. Maximal degree in co-relation 2400. Up to 598 conditions per place. [2024-11-10 10:16:48,332 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 35 selfloop transitions, 2 changer transitions 31/71 dead transitions. [2024-11-10 10:16:48,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 71 transitions, 313 flow [2024-11-10 10:16:48,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 10:16:48,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 10:16:48,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2024-11-10 10:16:48,334 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-11-10 10:16:48,334 INFO L175 Difference]: Start difference. First operand has 45 places, 27 transitions, 74 flow. Second operand 7 states and 105 transitions. [2024-11-10 10:16:48,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 71 transitions, 313 flow [2024-11-10 10:16:48,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 71 transitions, 291 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-10 10:16:48,340 INFO L231 Difference]: Finished difference. Result has 44 places, 27 transitions, 78 flow [2024-11-10 10:16:48,340 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=78, PETRI_PLACES=44, PETRI_TRANSITIONS=27} [2024-11-10 10:16:48,341 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 7 predicate places. [2024-11-10 10:16:48,341 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 27 transitions, 78 flow [2024-11-10 10:16:48,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:16:48,341 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:16:48,341 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-11-10 10:16:48,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 10:16:48,342 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:16:48,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:16:48,342 INFO L85 PathProgramCache]: Analyzing trace with hash -382664594, now seen corresponding path program 1 times [2024-11-10 10:16:48,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:16:48,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319740352] [2024-11-10 10:16:48,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:16:48,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:16:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:16:49,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:16:49,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:16:49,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319740352] [2024-11-10 10:16:49,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319740352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:16:49,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:16:49,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 10:16:49,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939312669] [2024-11-10 10:16:49,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:16:49,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 10:16:49,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:16:49,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 10:16:49,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 10:16:49,141 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-11-10 10:16:49,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 27 transitions, 78 flow. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:16:49,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:16:49,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-11-10 10:16:49,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:16:49,609 INFO L124 PetriNetUnfolderBase]: 708/1204 cut-off events. [2024-11-10 10:16:49,610 INFO L125 PetriNetUnfolderBase]: For 233/233 co-relation queries the response was YES. [2024-11-10 10:16:49,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2748 conditions, 1204 events. 708/1204 cut-off events. For 233/233 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5209 event pairs, 145 based on Foata normal form. 24/1225 useless extension candidates. Maximal degree in co-relation 2732. Up to 750 conditions per place. [2024-11-10 10:16:49,617 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 45 selfloop transitions, 10 changer transitions 27/85 dead transitions. [2024-11-10 10:16:49,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 85 transitions, 379 flow [2024-11-10 10:16:49,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 10:16:49,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-10 10:16:49,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2024-11-10 10:16:49,618 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.40606060606060607 [2024-11-10 10:16:49,618 INFO L175 Difference]: Start difference. First operand has 44 places, 27 transitions, 78 flow. Second operand 10 states and 134 transitions. [2024-11-10 10:16:49,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 85 transitions, 379 flow [2024-11-10 10:16:49,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 85 transitions, 355 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-10 10:16:49,621 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 152 flow [2024-11-10 10:16:49,621 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=152, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2024-11-10 10:16:49,622 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 12 predicate places. [2024-11-10 10:16:49,622 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 152 flow [2024-11-10 10:16:49,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:16:49,623 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:16:49,623 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-11-10 10:16:49,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 10:16:49,623 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:16:49,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:16:49,624 INFO L85 PathProgramCache]: Analyzing trace with hash -521673456, now seen corresponding path program 2 times [2024-11-10 10:16:49,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:16:49,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723642226] [2024-11-10 10:16:49,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:16:49,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:16:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:16:49,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:16:49,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:16:49,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723642226] [2024-11-10 10:16:49,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723642226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:16:49,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:16:49,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:16:49,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668361308] [2024-11-10 10:16:49,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:16:49,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:16:49,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:16:49,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:16:49,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:16:49,800 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-11-10 10:16:49,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:16:49,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:16:49,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-11-10 10:16:49,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:16:49,987 INFO L124 PetriNetUnfolderBase]: 468/842 cut-off events. [2024-11-10 10:16:49,987 INFO L125 PetriNetUnfolderBase]: For 758/758 co-relation queries the response was YES. [2024-11-10 10:16:49,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2473 conditions, 842 events. 468/842 cut-off events. For 758/758 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3576 event pairs, 128 based on Foata normal form. 70/909 useless extension candidates. Maximal degree in co-relation 2455. Up to 319 conditions per place. [2024-11-10 10:16:49,991 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 59 selfloop transitions, 4 changer transitions 1/67 dead transitions. [2024-11-10 10:16:49,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 67 transitions, 428 flow [2024-11-10 10:16:49,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:16:49,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:16:49,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2024-11-10 10:16:49,993 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2024-11-10 10:16:49,993 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 152 flow. Second operand 4 states and 78 transitions. [2024-11-10 10:16:49,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 67 transitions, 428 flow [2024-11-10 10:16:49,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 67 transitions, 423 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-11-10 10:16:49,995 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 173 flow [2024-11-10 10:16:49,996 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-11-10 10:16:49,996 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 10 predicate places. [2024-11-10 10:16:49,996 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 173 flow [2024-11-10 10:16:49,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:16:49,997 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:16:49,997 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-11-10 10:16:49,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 10:16:49,997 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:16:49,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:16:49,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1807962995, now seen corresponding path program 1 times [2024-11-10 10:16:49,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:16:49,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676099934] [2024-11-10 10:16:49,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:16:49,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:16:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:16:50,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:16:50,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:16:50,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676099934] [2024-11-10 10:16:50,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676099934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:16:50,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:16:50,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:16:50,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129407797] [2024-11-10 10:16:50,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:16:50,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:16:50,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:16:50,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:16:50,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:16:50,244 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2024-11-10 10:16:50,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 173 flow. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:16:50,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:16:50,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2024-11-10 10:16:50,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:16:50,363 INFO L124 PetriNetUnfolderBase]: 252/468 cut-off events. [2024-11-10 10:16:50,364 INFO L125 PetriNetUnfolderBase]: For 461/461 co-relation queries the response was YES. [2024-11-10 10:16:50,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1494 conditions, 468 events. 252/468 cut-off events. For 461/461 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1687 event pairs, 84 based on Foata normal form. 30/495 useless extension candidates. Maximal degree in co-relation 1475. Up to 194 conditions per place. [2024-11-10 10:16:50,366 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 47 selfloop transitions, 6 changer transitions 1/57 dead transitions. [2024-11-10 10:16:50,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 57 transitions, 367 flow [2024-11-10 10:16:50,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:16:50,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:16:50,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2024-11-10 10:16:50,368 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46060606060606063 [2024-11-10 10:16:50,368 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 173 flow. Second operand 5 states and 76 transitions. [2024-11-10 10:16:50,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 57 transitions, 367 flow [2024-11-10 10:16:50,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 57 transitions, 340 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-11-10 10:16:50,370 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 173 flow [2024-11-10 10:16:50,370 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=173, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2024-11-10 10:16:50,371 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 12 predicate places. [2024-11-10 10:16:50,371 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 173 flow [2024-11-10 10:16:50,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:16:50,371 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:16:50,371 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] [2024-11-10 10:16:50,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 10:16:50,371 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:16:50,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:16:50,372 INFO L85 PathProgramCache]: Analyzing trace with hash 909647547, now seen corresponding path program 1 times [2024-11-10 10:16:50,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:16:50,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875693879] [2024-11-10 10:16:50,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:16:50,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:16:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:16:51,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:16:51,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:16:51,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875693879] [2024-11-10 10:16:51,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875693879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:16:51,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:16:51,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 10:16:51,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423013081] [2024-11-10 10:16:51,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:16:51,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 10:16:51,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:16:51,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 10:16:51,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 10:16:51,034 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-11-10 10:16:51,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 173 flow. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:16:51,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:16:51,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-11-10 10:16:51,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:16:51,433 INFO L124 PetriNetUnfolderBase]: 294/554 cut-off events. [2024-11-10 10:16:51,433 INFO L125 PetriNetUnfolderBase]: For 565/565 co-relation queries the response was YES. [2024-11-10 10:16:51,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1734 conditions, 554 events. 294/554 cut-off events. For 565/565 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2089 event pairs, 68 based on Foata normal form. 4/555 useless extension candidates. Maximal degree in co-relation 1715. Up to 246 conditions per place. [2024-11-10 10:16:51,436 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 48 selfloop transitions, 17 changer transitions 16/84 dead transitions. [2024-11-10 10:16:51,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 84 transitions, 541 flow [2024-11-10 10:16:51,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 10:16:51,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-10 10:16:51,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-11-10 10:16:51,437 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.37575757575757573 [2024-11-10 10:16:51,437 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 173 flow. Second operand 10 states and 124 transitions. [2024-11-10 10:16:51,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 84 transitions, 541 flow [2024-11-10 10:16:51,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 84 transitions, 444 flow, removed 28 selfloop flow, removed 8 redundant places. [2024-11-10 10:16:51,441 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 249 flow [2024-11-10 10:16:51,441 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=249, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2024-11-10 10:16:51,442 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 18 predicate places. [2024-11-10 10:16:51,442 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 249 flow [2024-11-10 10:16:51,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:16:51,442 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:16:51,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] [2024-11-10 10:16:51,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 10:16:51,443 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:16:51,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:16:51,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1244588535, now seen corresponding path program 2 times [2024-11-10 10:16:51,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:16:51,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40769243] [2024-11-10 10:16:51,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:16:51,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:16:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:16:51,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:16:51,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:16:51,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40769243] [2024-11-10 10:16:51,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40769243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:16:51,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:16:51,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 10:16:51,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719674260] [2024-11-10 10:16:51,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:16:51,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:16:51,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:16:51,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:16:51,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:16:51,838 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-11-10 10:16:51,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 249 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:16:51,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:16:51,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-11-10 10:16:51,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:16:52,090 INFO L124 PetriNetUnfolderBase]: 330/622 cut-off events. [2024-11-10 10:16:52,091 INFO L125 PetriNetUnfolderBase]: For 691/691 co-relation queries the response was YES. [2024-11-10 10:16:52,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1956 conditions, 622 events. 330/622 cut-off events. For 691/691 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2488 event pairs, 134 based on Foata normal form. 4/623 useless extension candidates. Maximal degree in co-relation 1937. Up to 282 conditions per place. [2024-11-10 10:16:52,094 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 34 selfloop transitions, 6 changer transitions 32/75 dead transitions. [2024-11-10 10:16:52,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 75 transitions, 517 flow [2024-11-10 10:16:52,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:16:52,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:16:52,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2024-11-10 10:16:52,096 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-11-10 10:16:52,096 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 249 flow. Second operand 6 states and 84 transitions. [2024-11-10 10:16:52,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 75 transitions, 517 flow [2024-11-10 10:16:52,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 75 transitions, 501 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-10 10:16:52,100 INFO L231 Difference]: Finished difference. Result has 57 places, 40 transitions, 218 flow [2024-11-10 10:16:52,101 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=218, PETRI_PLACES=57, PETRI_TRANSITIONS=40} [2024-11-10 10:16:52,101 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 20 predicate places. [2024-11-10 10:16:52,101 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 40 transitions, 218 flow [2024-11-10 10:16:52,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:16:52,101 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:16:52,101 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] [2024-11-10 10:16:52,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 10:16:52,102 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:16:52,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:16:52,102 INFO L85 PathProgramCache]: Analyzing trace with hash 38544065, now seen corresponding path program 3 times [2024-11-10 10:16:52,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:16:52,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953518199] [2024-11-10 10:16:52,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:16:52,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:16:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:16:53,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:16:53,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:16:53,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953518199] [2024-11-10 10:16:53,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953518199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:16:53,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:16:53,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 10:16:53,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347394229] [2024-11-10 10:16:53,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:16:53,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 10:16:53,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:16:53,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 10:16:53,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 10:16:53,547 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-11-10 10:16:53,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 40 transitions, 218 flow. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:16:53,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:16:53,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-11-10 10:16:53,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:16:53,931 INFO L124 PetriNetUnfolderBase]: 234/461 cut-off events. [2024-11-10 10:16:53,932 INFO L125 PetriNetUnfolderBase]: For 496/496 co-relation queries the response was YES. [2024-11-10 10:16:53,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1410 conditions, 461 events. 234/461 cut-off events. For 496/496 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1642 event pairs, 54 based on Foata normal form. 4/463 useless extension candidates. Maximal degree in co-relation 1390. Up to 274 conditions per place. [2024-11-10 10:16:53,934 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 34 selfloop transitions, 12 changer transitions 23/72 dead transitions. [2024-11-10 10:16:53,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 72 transitions, 471 flow [2024-11-10 10:16:53,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 10:16:53,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 10:16:53,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-11-10 10:16:53,935 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.35353535353535354 [2024-11-10 10:16:53,935 INFO L175 Difference]: Start difference. First operand has 57 places, 40 transitions, 218 flow. Second operand 9 states and 105 transitions. [2024-11-10 10:16:53,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 72 transitions, 471 flow [2024-11-10 10:16:53,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 72 transitions, 420 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-11-10 10:16:53,938 INFO L231 Difference]: Finished difference. Result has 59 places, 37 transitions, 207 flow [2024-11-10 10:16:53,938 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=207, PETRI_PLACES=59, PETRI_TRANSITIONS=37} [2024-11-10 10:16:53,939 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 22 predicate places. [2024-11-10 10:16:53,939 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 37 transitions, 207 flow [2024-11-10 10:16:53,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:16:53,939 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:16:53,939 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] [2024-11-10 10:16:53,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 10:16:53,940 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:16:53,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:16:53,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1180418285, now seen corresponding path program 4 times [2024-11-10 10:16:53,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:16:53,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230664031] [2024-11-10 10:16:53,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:16:53,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:16:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:16:54,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:16:54,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:16:54,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230664031] [2024-11-10 10:16:54,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230664031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:16:54,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:16:54,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 10:16:54,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463851993] [2024-11-10 10:16:54,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:16:54,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 10:16:54,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:16:54,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 10:16:54,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-10 10:16:54,813 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-11-10 10:16:54,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 37 transitions, 207 flow. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:16:54,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:16:54,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-11-10 10:16:54,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:16:55,144 INFO L124 PetriNetUnfolderBase]: 176/357 cut-off events. [2024-11-10 10:16:55,144 INFO L125 PetriNetUnfolderBase]: For 360/360 co-relation queries the response was YES. [2024-11-10 10:16:55,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1143 conditions, 357 events. 176/357 cut-off events. For 360/360 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1174 event pairs, 60 based on Foata normal form. 4/359 useless extension candidates. Maximal degree in co-relation 1124. Up to 146 conditions per place. [2024-11-10 10:16:55,146 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 32 selfloop transitions, 4 changer transitions 37/76 dead transitions. [2024-11-10 10:16:55,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 76 transitions, 514 flow [2024-11-10 10:16:55,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 10:16:55,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-10 10:16:55,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2024-11-10 10:16:55,147 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.31955922865013775 [2024-11-10 10:16:55,147 INFO L175 Difference]: Start difference. First operand has 59 places, 37 transitions, 207 flow. Second operand 11 states and 116 transitions. [2024-11-10 10:16:55,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 76 transitions, 514 flow [2024-11-10 10:16:55,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 76 transitions, 458 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-11-10 10:16:55,151 INFO L231 Difference]: Finished difference. Result has 62 places, 34 transitions, 169 flow [2024-11-10 10:16:55,151 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=169, PETRI_PLACES=62, PETRI_TRANSITIONS=34} [2024-11-10 10:16:55,152 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 25 predicate places. [2024-11-10 10:16:55,152 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 34 transitions, 169 flow [2024-11-10 10:16:55,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:16:55,152 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:16:55,152 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] [2024-11-10 10:16:55,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 10:16:55,153 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:16:55,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:16:55,154 INFO L85 PathProgramCache]: Analyzing trace with hash 948571629, now seen corresponding path program 5 times [2024-11-10 10:16:55,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:16:55,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180357055] [2024-11-10 10:16:55,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:16:55,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:16:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:16:56,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:16:56,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:16:56,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180357055] [2024-11-10 10:16:56,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180357055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:16:56,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:16:56,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 10:16:56,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753404179] [2024-11-10 10:16:56,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:16:56,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 10:16:56,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:16:56,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 10:16:56,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 10:16:56,263 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-11-10 10:16:56,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 34 transitions, 169 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:16:56,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:16:56,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-11-10 10:16:56,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:16:56,475 INFO L124 PetriNetUnfolderBase]: 88/179 cut-off events. [2024-11-10 10:16:56,475 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2024-11-10 10:16:56,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 559 conditions, 179 events. 88/179 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 417 event pairs, 24 based on Foata normal form. 4/182 useless extension candidates. Maximal degree in co-relation 549. Up to 121 conditions per place. [2024-11-10 10:16:56,476 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 0 selfloop transitions, 0 changer transitions 41/41 dead transitions. [2024-11-10 10:16:56,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 41 transitions, 259 flow [2024-11-10 10:16:56,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 10:16:56,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 10:16:56,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 73 transitions. [2024-11-10 10:16:56,477 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2765151515151515 [2024-11-10 10:16:56,477 INFO L175 Difference]: Start difference. First operand has 62 places, 34 transitions, 169 flow. Second operand 8 states and 73 transitions. [2024-11-10 10:16:56,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 41 transitions, 259 flow [2024-11-10 10:16:56,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 41 transitions, 232 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-11-10 10:16:56,478 INFO L231 Difference]: Finished difference. Result has 50 places, 0 transitions, 0 flow [2024-11-10 10:16:56,478 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=50, PETRI_TRANSITIONS=0} [2024-11-10 10:16:56,479 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 13 predicate places. [2024-11-10 10:16:56,479 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 0 transitions, 0 flow [2024-11-10 10:16:56,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:16:56,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-11-10 10:16:56,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-11-10 10:16:56,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-10 10:16:56,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-10 10:16:56,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-11-10 10:16:56,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 10:16:56,484 INFO L407 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1] [2024-11-10 10:16:56,488 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 10:16:56,488 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 10:16:56,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:16:56 BasicIcfg [2024-11-10 10:16:56,491 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 10:16:56,492 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 10:16:56,492 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 10:16:56,492 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 10:16:56,492 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:16:45" (3/4) ... [2024-11-10 10:16:56,494 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 10:16:56,495 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure P0 [2024-11-10 10:16:56,496 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure P1 [2024-11-10 10:16:56,498 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 39 nodes and edges [2024-11-10 10:16:56,499 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-11-10 10:16:56,499 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-10 10:16:56,499 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-10 10:16:56,559 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 10:16:56,559 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 10:16:56,559 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 10:16:56,560 INFO L158 Benchmark]: Toolchain (without parser) took 12958.44ms. Allocated memory was 142.6MB in the beginning and 536.9MB in the end (delta: 394.3MB). Free memory was 71.9MB in the beginning and 255.0MB in the end (delta: -183.1MB). Peak memory consumption was 213.6MB. Max. memory is 16.1GB. [2024-11-10 10:16:56,560 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 142.6MB. Free memory is still 93.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 10:16:56,560 INFO L158 Benchmark]: CACSL2BoogieTranslator took 548.85ms. Allocated memory was 142.6MB in the beginning and 228.6MB in the end (delta: 86.0MB). Free memory was 71.7MB in the beginning and 182.3MB in the end (delta: -110.6MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2024-11-10 10:16:56,560 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.38ms. Allocated memory is still 228.6MB. Free memory was 182.3MB in the beginning and 179.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 10:16:56,561 INFO L158 Benchmark]: Boogie Preprocessor took 45.01ms. Allocated memory is still 228.6MB. Free memory was 179.2MB in the beginning and 173.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 10:16:56,561 INFO L158 Benchmark]: IcfgBuilder took 874.08ms. Allocated memory is still 228.6MB. Free memory was 173.9MB in the beginning and 94.2MB in the end (delta: 79.7MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. [2024-11-10 10:16:56,561 INFO L158 Benchmark]: TraceAbstraction took 11369.28ms. Allocated memory was 228.6MB in the beginning and 536.9MB in the end (delta: 308.3MB). Free memory was 93.2MB in the beginning and 260.2MB in the end (delta: -167.0MB). Peak memory consumption was 141.3MB. Max. memory is 16.1GB. [2024-11-10 10:16:56,561 INFO L158 Benchmark]: Witness Printer took 67.45ms. Allocated memory is still 536.9MB. Free memory was 259.2MB in the beginning and 255.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 10:16:56,562 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.17ms. Allocated memory is still 142.6MB. Free memory is still 93.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 548.85ms. Allocated memory was 142.6MB in the beginning and 228.6MB in the end (delta: 86.0MB). Free memory was 71.7MB in the beginning and 182.3MB in the end (delta: -110.6MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.38ms. Allocated memory is still 228.6MB. Free memory was 182.3MB in the beginning and 179.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.01ms. Allocated memory is still 228.6MB. Free memory was 179.2MB in the beginning and 173.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 874.08ms. Allocated memory is still 228.6MB. Free memory was 173.9MB in the beginning and 94.2MB in the end (delta: 79.7MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11369.28ms. Allocated memory was 228.6MB in the beginning and 536.9MB in the end (delta: 308.3MB). Free memory was 93.2MB in the beginning and 260.2MB in the end (delta: -167.0MB). Peak memory consumption was 141.3MB. Max. memory is 16.1GB. * Witness Printer took 67.45ms. Allocated memory is still 536.9MB. Free memory was 259.2MB in the beginning and 255.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: 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: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 53 locations, 5 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: 11.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 480 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 479 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 99 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1841 IncrementalHoareTripleChecker+Invalid, 1940 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 99 mSolverCounterUnsat, 2 mSDtfsCounter, 1841 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=249occurred in iteration=7, InterpolantAutomatonStates: 81, 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.4s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 221 NumberOfCodeBlocks, 221 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 1861 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-11-10 10:16:56,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE