./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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/safe030_power.opt_pso.opt_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 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 19:16:49,552 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 19:16:49,643 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 19:16:49,650 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 19:16:49,650 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 19:16:49,673 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 19:16:49,674 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 19:16:49,674 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 19:16:49,675 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 19:16:49,675 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 19:16:49,675 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 19:16:49,676 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 19:16:49,676 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 19:16:49,679 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 19:16:49,679 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 19:16:49,679 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 19:16:49,680 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 19:16:49,684 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 19:16:49,684 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 19:16:49,685 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 19:16:49,685 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 19:16:49,685 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 19:16:49,685 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 19:16:49,686 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 19:16:49,686 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 19:16:49,686 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 19:16:49,686 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 19:16:49,686 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 19:16:49,687 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 19:16:49,687 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 19:16:49,687 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 19:16:49,687 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 19:16:49,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 19:16:49,688 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 19:16:49,688 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 19:16:49,688 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 19:16:49,688 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 19:16:49,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 19:16:49,689 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 19:16:49,689 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 19:16:49,692 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 19:16:49,692 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 19:16:49,693 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 -> 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 [2024-11-16 19:16:49,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 19:16:49,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 19:16:49,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 19:16:49,946 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 19:16:49,946 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 19:16:49,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2024-11-16 19:16:51,383 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 19:16:51,633 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 19:16:51,634 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2024-11-16 19:16:51,653 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26388e857/609d7051d72d48769040c075da814187/FLAGf3c1f3063 [2024-11-16 19:16:51,666 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26388e857/609d7051d72d48769040c075da814187 [2024-11-16 19:16:51,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 19:16:51,671 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 19:16:51,672 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 19:16:51,672 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 19:16:51,677 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 19:16:51,677 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:16:51" (1/1) ... [2024-11-16 19:16:51,678 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46a376d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:16:51, skipping insertion in model container [2024-11-16 19:16:51,678 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:16:51" (1/1) ... [2024-11-16 19:16:51,727 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 19:16:51,930 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/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2024-11-16 19:16:52,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 19:16:52,102 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 19:16:52,119 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/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2024-11-16 19:16:52,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 19:16:52,248 INFO L204 MainTranslator]: Completed translation [2024-11-16 19:16:52,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:16:52 WrapperNode [2024-11-16 19:16:52,249 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 19:16:52,250 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 19:16:52,250 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 19:16:52,251 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 19:16:52,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:16:52" (1/1) ... [2024-11-16 19:16:52,280 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:16:52" (1/1) ... [2024-11-16 19:16:52,318 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2024-11-16 19:16:52,319 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 19:16:52,320 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 19:16:52,320 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 19:16:52,320 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 19:16:52,332 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:16:52" (1/1) ... [2024-11-16 19:16:52,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:16:52" (1/1) ... [2024-11-16 19:16:52,339 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:16:52" (1/1) ... [2024-11-16 19:16:52,360 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-16 19:16:52,361 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:16:52" (1/1) ... [2024-11-16 19:16:52,361 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:16:52" (1/1) ... [2024-11-16 19:16:52,374 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:16:52" (1/1) ... [2024-11-16 19:16:52,375 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:16:52" (1/1) ... [2024-11-16 19:16:52,376 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:16:52" (1/1) ... [2024-11-16 19:16:52,378 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:16:52" (1/1) ... [2024-11-16 19:16:52,381 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 19:16:52,382 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 19:16:52,382 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 19:16:52,382 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 19:16:52,384 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:16:52" (1/1) ... [2024-11-16 19:16:52,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 19:16:52,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:16:52,419 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-16 19:16:52,423 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-16 19:16:52,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-16 19:16:52,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 19:16:52,471 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-16 19:16:52,471 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-16 19:16:52,471 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-16 19:16:52,471 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-16 19:16:52,471 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-16 19:16:52,473 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-16 19:16:52,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 19:16:52,473 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-16 19:16:52,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 19:16:52,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 19:16:52,475 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 19:16:52,621 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 19:16:52,623 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 19:16:52,919 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 19:16:52,920 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 19:16:53,153 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 19:16:53,153 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 19:16:53,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:16:53 BoogieIcfgContainer [2024-11-16 19:16:53,155 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 19:16:53,156 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 19:16:53,157 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 19:16:53,160 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 19:16:53,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:16:51" (1/3) ... [2024-11-16 19:16:53,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fba5334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:16:53, skipping insertion in model container [2024-11-16 19:16:53,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:16:52" (2/3) ... [2024-11-16 19:16:53,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fba5334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:16:53, skipping insertion in model container [2024-11-16 19:16:53,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:16:53" (3/3) ... [2024-11-16 19:16:53,164 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.opt_pso.opt_rmo.opt.i [2024-11-16 19:16:53,180 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 19:16:53,181 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-16 19:16:53,181 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 19:16:53,234 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-16 19:16:53,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2024-11-16 19:16:53,303 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2024-11-16 19:16:53,303 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 19:16:53,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 1/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 67 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2024-11-16 19:16:53,308 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2024-11-16 19:16:53,311 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 81 flow [2024-11-16 19:16:53,318 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 19:16:53,323 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;@7316596c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 19:16:53,323 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-16 19:16:53,354 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 19:16:53,355 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2024-11-16 19:16:53,355 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 19:16:53,355 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:16:53,356 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:16:53,356 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:16:53,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:16:53,363 INFO L85 PathProgramCache]: Analyzing trace with hash -2096445211, now seen corresponding path program 1 times [2024-11-16 19:16:53,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:16:53,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076942599] [2024-11-16 19:16:53,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:16:53,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:16:53,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:16:53,902 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-16 19:16:53,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:16:53,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076942599] [2024-11-16 19:16:53,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076942599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:16:53,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:16:53,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-16 19:16:53,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467714905] [2024-11-16 19:16:53,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:16:53,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 19:16:53,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:16:53,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 19:16:53,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 19:16:53,942 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2024-11-16 19:16:53,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-16 19:16:53,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:16:53,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2024-11-16 19:16:53,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:16:54,932 INFO L124 PetriNetUnfolderBase]: 4775/6887 cut-off events. [2024-11-16 19:16:54,932 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-16 19:16:54,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13782 conditions, 6887 events. 4775/6887 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 36030 event pairs, 635 based on Foata normal form. 216/7088 useless extension candidates. Maximal degree in co-relation 13771. Up to 5761 conditions per place. [2024-11-16 19:16:54,985 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 43 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2024-11-16 19:16:54,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 52 transitions, 207 flow [2024-11-16 19:16:54,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 19:16:54,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 19:16:54,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-11-16 19:16:54,998 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6324786324786325 [2024-11-16 19:16:54,999 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 3 states and 74 transitions. [2024-11-16 19:16:55,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 52 transitions, 207 flow [2024-11-16 19:16:55,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 204 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-16 19:16:55,008 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 76 flow [2024-11-16 19:16:55,011 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2024-11-16 19:16:55,016 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2024-11-16 19:16:55,017 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 76 flow [2024-11-16 19:16:55,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-16 19:16:55,017 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:16:55,017 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:16:55,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 19:16:55,018 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:16:55,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:16:55,019 INFO L85 PathProgramCache]: Analyzing trace with hash -302137077, now seen corresponding path program 1 times [2024-11-16 19:16:55,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:16:55,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184494144] [2024-11-16 19:16:55,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:16:55,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:16:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:16:55,389 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-16 19:16:55,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:16:55,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184494144] [2024-11-16 19:16:55,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184494144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:16:55,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:16:55,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 19:16:55,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663699283] [2024-11-16 19:16:55,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:16:55,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 19:16:55,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:16:55,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 19:16:55,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 19:16:55,396 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-16 19:16:55,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:16:55,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:16:55,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-16 19:16:55,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:16:56,557 INFO L124 PetriNetUnfolderBase]: 6055/8892 cut-off events. [2024-11-16 19:16:56,558 INFO L125 PetriNetUnfolderBase]: For 408/408 co-relation queries the response was YES. [2024-11-16 19:16:56,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18074 conditions, 8892 events. 6055/8892 cut-off events. For 408/408 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 50746 event pairs, 1501 based on Foata normal form. 0/8685 useless extension candidates. Maximal degree in co-relation 18064. Up to 5757 conditions per place. [2024-11-16 19:16:56,601 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 41 selfloop transitions, 3 changer transitions 67/115 dead transitions. [2024-11-16 19:16:56,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 115 transitions, 478 flow [2024-11-16 19:16:56,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 19:16:56,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-16 19:16:56,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2024-11-16 19:16:56,604 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-11-16 19:16:56,604 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 76 flow. Second operand 8 states and 169 transitions. [2024-11-16 19:16:56,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 115 transitions, 478 flow [2024-11-16 19:16:56,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 115 transitions, 462 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 19:16:56,610 INFO L231 Difference]: Finished difference. Result has 52 places, 34 transitions, 105 flow [2024-11-16 19:16:56,611 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=105, PETRI_PLACES=52, PETRI_TRANSITIONS=34} [2024-11-16 19:16:56,612 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2024-11-16 19:16:56,612 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 105 flow [2024-11-16 19:16:56,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:16:56,613 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:16:56,613 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:16:56,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 19:16:56,613 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:16:56,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:16:56,614 INFO L85 PathProgramCache]: Analyzing trace with hash 2052481132, now seen corresponding path program 1 times [2024-11-16 19:16:56,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:16:56,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267655551] [2024-11-16 19:16:56,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:16:56,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:16:56,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:16:57,401 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-16 19:16:57,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:16:57,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267655551] [2024-11-16 19:16:57,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267655551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:16:57,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:16:57,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 19:16:57,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92288731] [2024-11-16 19:16:57,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:16:57,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 19:16:57,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:16:57,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 19:16:57,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 19:16:57,410 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-16 19:16:57,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 34 transitions, 105 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:16:57,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:16:57,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-16 19:16:57,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:16:59,252 INFO L124 PetriNetUnfolderBase]: 8087/11898 cut-off events. [2024-11-16 19:16:59,253 INFO L125 PetriNetUnfolderBase]: For 6646/6646 co-relation queries the response was YES. [2024-11-16 19:16:59,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28654 conditions, 11898 events. 8087/11898 cut-off events. For 6646/6646 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 70471 event pairs, 614 based on Foata normal form. 350/12246 useless extension candidates. Maximal degree in co-relation 28639. Up to 5927 conditions per place. [2024-11-16 19:16:59,313 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 59 selfloop transitions, 12 changer transitions 81/156 dead transitions. [2024-11-16 19:16:59,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 156 transitions, 785 flow [2024-11-16 19:16:59,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 19:16:59,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-16 19:16:59,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 221 transitions. [2024-11-16 19:16:59,316 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2024-11-16 19:16:59,316 INFO L175 Difference]: Start difference. First operand has 52 places, 34 transitions, 105 flow. Second operand 10 states and 221 transitions. [2024-11-16 19:16:59,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 156 transitions, 785 flow [2024-11-16 19:16:59,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 156 transitions, 766 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-11-16 19:16:59,367 INFO L231 Difference]: Finished difference. Result has 61 places, 45 transitions, 236 flow [2024-11-16 19:16:59,367 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=236, PETRI_PLACES=61, PETRI_TRANSITIONS=45} [2024-11-16 19:16:59,368 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places. [2024-11-16 19:16:59,368 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 45 transitions, 236 flow [2024-11-16 19:16:59,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:16:59,369 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:16:59,369 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:16:59,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 19:16:59,369 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:16:59,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:16:59,370 INFO L85 PathProgramCache]: Analyzing trace with hash -192916813, now seen corresponding path program 1 times [2024-11-16 19:16:59,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:16:59,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530423140] [2024-11-16 19:16:59,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:16:59,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:16:59,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:16:59,942 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-16 19:16:59,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:16:59,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530423140] [2024-11-16 19:16:59,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530423140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:16:59,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:16:59,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 19:16:59,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701451615] [2024-11-16 19:16:59,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:16:59,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 19:16:59,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:16:59,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 19:16:59,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 19:16:59,947 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-16 19:16:59,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 45 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 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-16 19:16:59,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:16:59,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-16 19:16:59,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:17:01,995 INFO L124 PetriNetUnfolderBase]: 9842/14497 cut-off events. [2024-11-16 19:17:01,996 INFO L125 PetriNetUnfolderBase]: For 30337/30337 co-relation queries the response was YES. [2024-11-16 19:17:02,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47256 conditions, 14497 events. 9842/14497 cut-off events. For 30337/30337 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 87551 event pairs, 2166 based on Foata normal form. 308/14804 useless extension candidates. Maximal degree in co-relation 47233. Up to 6613 conditions per place. [2024-11-16 19:17:02,093 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 68 selfloop transitions, 21 changer transitions 76/169 dead transitions. [2024-11-16 19:17:02,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 169 transitions, 1130 flow [2024-11-16 19:17:02,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 19:17:02,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-16 19:17:02,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 216 transitions. [2024-11-16 19:17:02,095 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5538461538461539 [2024-11-16 19:17:02,095 INFO L175 Difference]: Start difference. First operand has 61 places, 45 transitions, 236 flow. Second operand 10 states and 216 transitions. [2024-11-16 19:17:02,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 169 transitions, 1130 flow [2024-11-16 19:17:02,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 169 transitions, 1086 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-11-16 19:17:02,179 INFO L231 Difference]: Finished difference. Result has 69 places, 57 transitions, 446 flow [2024-11-16 19:17:02,179 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=446, PETRI_PLACES=69, PETRI_TRANSITIONS=57} [2024-11-16 19:17:02,180 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2024-11-16 19:17:02,180 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 57 transitions, 446 flow [2024-11-16 19:17:02,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 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-16 19:17:02,181 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:17:02,181 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:17:02,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 19:17:02,181 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:17:02,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:17:02,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1922991201, now seen corresponding path program 1 times [2024-11-16 19:17:02,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:17:02,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008974623] [2024-11-16 19:17:02,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:17:02,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:17:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:17:02,669 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-16 19:17:02,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:17:02,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008974623] [2024-11-16 19:17:02,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008974623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:17:02,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:17:02,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 19:17:02,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454586056] [2024-11-16 19:17:02,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:17:02,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 19:17:02,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:17:02,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 19:17:02,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 19:17:02,673 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-16 19:17:02,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 57 transitions, 446 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 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-16 19:17:02,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:17:02,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-16 19:17:02,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:17:04,044 INFO L124 PetriNetUnfolderBase]: 9888/14908 cut-off events. [2024-11-16 19:17:04,044 INFO L125 PetriNetUnfolderBase]: For 53749/53751 co-relation queries the response was YES. [2024-11-16 19:17:04,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55159 conditions, 14908 events. 9888/14908 cut-off events. For 53749/53751 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 91280 event pairs, 3271 based on Foata normal form. 389/15290 useless extension candidates. Maximal degree in co-relation 55129. Up to 11977 conditions per place. [2024-11-16 19:17:04,172 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 68 selfloop transitions, 5 changer transitions 60/137 dead transitions. [2024-11-16 19:17:04,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 137 transitions, 1250 flow [2024-11-16 19:17:04,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 19:17:04,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-16 19:17:04,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-11-16 19:17:04,174 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4908424908424908 [2024-11-16 19:17:04,175 INFO L175 Difference]: Start difference. First operand has 69 places, 57 transitions, 446 flow. Second operand 7 states and 134 transitions. [2024-11-16 19:17:04,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 137 transitions, 1250 flow [2024-11-16 19:17:04,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 137 transitions, 1222 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-11-16 19:17:04,375 INFO L231 Difference]: Finished difference. Result has 70 places, 60 transitions, 495 flow [2024-11-16 19:17:04,375 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=495, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2024-11-16 19:17:04,376 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 25 predicate places. [2024-11-16 19:17:04,376 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 495 flow [2024-11-16 19:17:04,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 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-16 19:17:04,377 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:17:04,377 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:17:04,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 19:17:04,377 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:17:04,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:17:04,378 INFO L85 PathProgramCache]: Analyzing trace with hash 995840848, now seen corresponding path program 1 times [2024-11-16 19:17:04,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:17:04,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704572367] [2024-11-16 19:17:04,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:17:04,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:17:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:17:04,669 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-16 19:17:04,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:17:04,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704572367] [2024-11-16 19:17:04,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704572367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:17:04,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:17:04,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 19:17:04,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411282150] [2024-11-16 19:17:04,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:17:04,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 19:17:04,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:17:04,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 19:17:04,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 19:17:04,677 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-16 19:17:04,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 495 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-16 19:17:04,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:17:04,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-16 19:17:04,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:17:06,055 INFO L124 PetriNetUnfolderBase]: 9621/14300 cut-off events. [2024-11-16 19:17:06,055 INFO L125 PetriNetUnfolderBase]: For 56541/56549 co-relation queries the response was YES. [2024-11-16 19:17:06,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56893 conditions, 14300 events. 9621/14300 cut-off events. For 56541/56549 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 85515 event pairs, 1423 based on Foata normal form. 323/14616 useless extension candidates. Maximal degree in co-relation 56860. Up to 10713 conditions per place. [2024-11-16 19:17:06,141 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 81 selfloop transitions, 10 changer transitions 63/158 dead transitions. [2024-11-16 19:17:06,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 158 transitions, 1499 flow [2024-11-16 19:17:06,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 19:17:06,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-16 19:17:06,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2024-11-16 19:17:06,143 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5032051282051282 [2024-11-16 19:17:06,144 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 495 flow. Second operand 8 states and 157 transitions. [2024-11-16 19:17:06,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 158 transitions, 1499 flow [2024-11-16 19:17:06,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 158 transitions, 1474 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-11-16 19:17:06,264 INFO L231 Difference]: Finished difference. Result has 75 places, 63 transitions, 550 flow [2024-11-16 19:17:06,264 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=550, PETRI_PLACES=75, PETRI_TRANSITIONS=63} [2024-11-16 19:17:06,267 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 30 predicate places. [2024-11-16 19:17:06,267 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 63 transitions, 550 flow [2024-11-16 19:17:06,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-16 19:17:06,268 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:17:06,268 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:17:06,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 19:17:06,268 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:17:06,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:17:06,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1494542188, now seen corresponding path program 2 times [2024-11-16 19:17:06,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:17:06,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078522824] [2024-11-16 19:17:06,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:17:06,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:17:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:17:06,768 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-16 19:17:06,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:17:06,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078522824] [2024-11-16 19:17:06,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078522824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:17:06,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:17:06,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 19:17:06,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120279612] [2024-11-16 19:17:06,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:17:06,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 19:17:06,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:17:06,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 19:17:06,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 19:17:06,775 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-16 19:17:06,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 63 transitions, 550 flow. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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-16 19:17:06,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:17:06,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-16 19:17:06,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:17:08,343 INFO L124 PetriNetUnfolderBase]: 9237/13955 cut-off events. [2024-11-16 19:17:08,343 INFO L125 PetriNetUnfolderBase]: For 68080/68094 co-relation queries the response was YES. [2024-11-16 19:17:08,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57184 conditions, 13955 events. 9237/13955 cut-off events. For 68080/68094 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 83943 event pairs, 1821 based on Foata normal form. 327/14275 useless extension candidates. Maximal degree in co-relation 57147. Up to 10537 conditions per place. [2024-11-16 19:17:08,430 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 80 selfloop transitions, 11 changer transitions 75/170 dead transitions. [2024-11-16 19:17:08,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 170 transitions, 1702 flow [2024-11-16 19:17:08,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 19:17:08,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-16 19:17:08,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2024-11-16 19:17:08,432 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-11-16 19:17:08,432 INFO L175 Difference]: Start difference. First operand has 75 places, 63 transitions, 550 flow. Second operand 10 states and 182 transitions. [2024-11-16 19:17:08,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 170 transitions, 1702 flow [2024-11-16 19:17:08,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 170 transitions, 1643 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-11-16 19:17:08,694 INFO L231 Difference]: Finished difference. Result has 82 places, 65 transitions, 601 flow [2024-11-16 19:17:08,694 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=601, PETRI_PLACES=82, PETRI_TRANSITIONS=65} [2024-11-16 19:17:08,695 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 37 predicate places. [2024-11-16 19:17:08,696 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 65 transitions, 601 flow [2024-11-16 19:17:08,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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-16 19:17:08,696 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:17:08,696 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:17:08,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 19:17:08,697 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:17:08,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:17:08,697 INFO L85 PathProgramCache]: Analyzing trace with hash 69924700, now seen corresponding path program 1 times [2024-11-16 19:17:08,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:17:08,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53717131] [2024-11-16 19:17:08,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:17:08,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:17:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:17:09,205 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-16 19:17:09,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:17:09,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53717131] [2024-11-16 19:17:09,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53717131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:17:09,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:17:09,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 19:17:09,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761088920] [2024-11-16 19:17:09,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:17:09,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 19:17:09,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:17:09,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 19:17:09,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 19:17:09,211 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-16 19:17:09,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 65 transitions, 601 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-16 19:17:09,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:17:09,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-16 19:17:09,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:17:11,277 INFO L124 PetriNetUnfolderBase]: 14073/20985 cut-off events. [2024-11-16 19:17:11,278 INFO L125 PetriNetUnfolderBase]: For 128832/128832 co-relation queries the response was YES. [2024-11-16 19:17:11,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86882 conditions, 20985 events. 14073/20985 cut-off events. For 128832/128832 co-relation queries the response was YES. Maximal size of possible extension queue 708. Compared 134325 event pairs, 2461 based on Foata normal form. 444/21413 useless extension candidates. Maximal degree in co-relation 86841. Up to 8214 conditions per place. [2024-11-16 19:17:11,448 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 77 selfloop transitions, 21 changer transitions 81/183 dead transitions. [2024-11-16 19:17:11,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 183 transitions, 1741 flow [2024-11-16 19:17:11,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 19:17:11,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-16 19:17:11,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 214 transitions. [2024-11-16 19:17:11,450 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5487179487179488 [2024-11-16 19:17:11,450 INFO L175 Difference]: Start difference. First operand has 82 places, 65 transitions, 601 flow. Second operand 10 states and 214 transitions. [2024-11-16 19:17:11,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 183 transitions, 1741 flow [2024-11-16 19:17:11,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 183 transitions, 1673 flow, removed 30 selfloop flow, removed 5 redundant places. [2024-11-16 19:17:11,964 INFO L231 Difference]: Finished difference. Result has 89 places, 68 transitions, 721 flow [2024-11-16 19:17:11,964 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=721, PETRI_PLACES=89, PETRI_TRANSITIONS=68} [2024-11-16 19:17:11,965 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 44 predicate places. [2024-11-16 19:17:11,965 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 68 transitions, 721 flow [2024-11-16 19:17:11,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-16 19:17:11,965 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:17:11,965 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-16 19:17:11,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 19:17:11,966 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:17:11,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:17:11,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1139819000, now seen corresponding path program 1 times [2024-11-16 19:17:11,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:17:11,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717212760] [2024-11-16 19:17:11,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:17:11,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:17:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:17:12,474 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-16 19:17:12,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:17:12,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717212760] [2024-11-16 19:17:12,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717212760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:17:12,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:17:12,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 19:17:12,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812619486] [2024-11-16 19:17:12,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:17:12,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 19:17:12,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:17:12,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 19:17:12,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 19:17:12,478 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-16 19:17:12,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 68 transitions, 721 flow. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:17:12,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:17:12,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-16 19:17:12,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:17:14,037 INFO L124 PetriNetUnfolderBase]: 12552/19169 cut-off events. [2024-11-16 19:17:14,037 INFO L125 PetriNetUnfolderBase]: For 143730/143750 co-relation queries the response was YES. [2024-11-16 19:17:14,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82498 conditions, 19169 events. 12552/19169 cut-off events. For 143730/143750 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 123274 event pairs, 3878 based on Foata normal form. 222/19384 useless extension candidates. Maximal degree in co-relation 82451. Up to 16321 conditions per place. [2024-11-16 19:17:14,179 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 80 selfloop transitions, 11 changer transitions 55/150 dead transitions. [2024-11-16 19:17:14,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 150 transitions, 1675 flow [2024-11-16 19:17:14,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 19:17:14,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-16 19:17:14,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-11-16 19:17:14,180 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49038461538461536 [2024-11-16 19:17:14,180 INFO L175 Difference]: Start difference. First operand has 89 places, 68 transitions, 721 flow. Second operand 8 states and 153 transitions. [2024-11-16 19:17:14,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 150 transitions, 1675 flow [2024-11-16 19:17:14,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 150 transitions, 1595 flow, removed 40 selfloop flow, removed 4 redundant places. [2024-11-16 19:17:14,518 INFO L231 Difference]: Finished difference. Result has 92 places, 69 transitions, 741 flow [2024-11-16 19:17:14,518 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=741, PETRI_PLACES=92, PETRI_TRANSITIONS=69} [2024-11-16 19:17:14,519 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 47 predicate places. [2024-11-16 19:17:14,519 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 69 transitions, 741 flow [2024-11-16 19:17:14,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:17:14,520 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:17:14,520 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-16 19:17:14,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 19:17:14,520 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:17:14,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:17:14,520 INFO L85 PathProgramCache]: Analyzing trace with hash 944600879, now seen corresponding path program 1 times [2024-11-16 19:17:14,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:17:14,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490049576] [2024-11-16 19:17:14,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:17:14,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:17:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:17:15,153 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-16 19:17:15,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:17:15,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490049576] [2024-11-16 19:17:15,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490049576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:17:15,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:17:15,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 19:17:15,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011714165] [2024-11-16 19:17:15,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:17:15,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 19:17:15,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:17:15,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 19:17:15,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 19:17:15,161 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-16 19:17:15,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 69 transitions, 741 flow. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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-16 19:17:15,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:17:15,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-16 19:17:15,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:17:17,001 INFO L124 PetriNetUnfolderBase]: 14485/22026 cut-off events. [2024-11-16 19:17:17,001 INFO L125 PetriNetUnfolderBase]: For 179675/179701 co-relation queries the response was YES. [2024-11-16 19:17:17,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96582 conditions, 22026 events. 14485/22026 cut-off events. For 179675/179701 co-relation queries the response was YES. Maximal size of possible extension queue 712. Compared 144289 event pairs, 5020 based on Foata normal form. 592/22611 useless extension candidates. Maximal degree in co-relation 96531. Up to 15915 conditions per place. [2024-11-16 19:17:17,129 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 98 selfloop transitions, 21 changer transitions 89/212 dead transitions. [2024-11-16 19:17:17,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 212 transitions, 2615 flow [2024-11-16 19:17:17,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 19:17:17,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-16 19:17:17,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2024-11-16 19:17:17,131 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5014245014245015 [2024-11-16 19:17:17,131 INFO L175 Difference]: Start difference. First operand has 92 places, 69 transitions, 741 flow. Second operand 9 states and 176 transitions. [2024-11-16 19:17:17,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 212 transitions, 2615 flow [2024-11-16 19:17:17,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 212 transitions, 2571 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-11-16 19:17:17,900 INFO L231 Difference]: Finished difference. Result has 96 places, 80 transitions, 950 flow [2024-11-16 19:17:17,901 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=950, PETRI_PLACES=96, PETRI_TRANSITIONS=80} [2024-11-16 19:17:17,901 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 51 predicate places. [2024-11-16 19:17:17,901 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 80 transitions, 950 flow [2024-11-16 19:17:17,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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-16 19:17:17,902 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:17:17,902 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:17:17,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 19:17:17,902 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:17:17,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:17:17,902 INFO L85 PathProgramCache]: Analyzing trace with hash -70660494, now seen corresponding path program 1 times [2024-11-16 19:17:17,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:17:17,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878339207] [2024-11-16 19:17:17,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:17:17,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:17:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:17:18,054 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-16 19:17:18,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:17:18,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878339207] [2024-11-16 19:17:18,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878339207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:17:18,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:17:18,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 19:17:18,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807388996] [2024-11-16 19:17:18,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:17:18,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 19:17:18,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:17:18,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 19:17:18,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 19:17:18,058 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2024-11-16 19:17:18,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 80 transitions, 950 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 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-16 19:17:18,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:17:18,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2024-11-16 19:17:18,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:17:19,232 INFO L124 PetriNetUnfolderBase]: 10066/15732 cut-off events. [2024-11-16 19:17:19,232 INFO L125 PetriNetUnfolderBase]: For 124490/124516 co-relation queries the response was YES. [2024-11-16 19:17:19,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67886 conditions, 15732 events. 10066/15732 cut-off events. For 124490/124516 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 103389 event pairs, 1783 based on Foata normal form. 814/16540 useless extension candidates. Maximal degree in co-relation 67833. Up to 8505 conditions per place. [2024-11-16 19:17:19,352 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 132 selfloop transitions, 5 changer transitions 28/169 dead transitions. [2024-11-16 19:17:19,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 169 transitions, 2382 flow [2024-11-16 19:17:19,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 19:17:19,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-16 19:17:19,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2024-11-16 19:17:19,353 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6089743589743589 [2024-11-16 19:17:19,353 INFO L175 Difference]: Start difference. First operand has 96 places, 80 transitions, 950 flow. Second operand 4 states and 95 transitions. [2024-11-16 19:17:19,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 169 transitions, 2382 flow [2024-11-16 19:17:19,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 169 transitions, 2273 flow, removed 49 selfloop flow, removed 3 redundant places. [2024-11-16 19:17:19,932 INFO L231 Difference]: Finished difference. Result has 94 places, 79 transitions, 869 flow [2024-11-16 19:17:19,932 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=877, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=869, PETRI_PLACES=94, PETRI_TRANSITIONS=79} [2024-11-16 19:17:19,933 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 49 predicate places. [2024-11-16 19:17:19,933 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 79 transitions, 869 flow [2024-11-16 19:17:19,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 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-16 19:17:19,933 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:17:19,933 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] [2024-11-16 19:17:19,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 19:17:19,934 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:17:19,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:17:19,934 INFO L85 PathProgramCache]: Analyzing trace with hash -2103513959, now seen corresponding path program 1 times [2024-11-16 19:17:19,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:17:19,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844826182] [2024-11-16 19:17:19,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:17:19,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:17:19,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:17:20,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-16 19:17:20,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:17:20,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844826182] [2024-11-16 19:17:20,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844826182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:17:20,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:17:20,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 19:17:20,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484936933] [2024-11-16 19:17:20,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:17:20,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 19:17:20,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:17:20,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 19:17:20,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 19:17:20,140 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2024-11-16 19:17:20,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 79 transitions, 869 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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-16 19:17:20,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:17:20,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2024-11-16 19:17:20,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:17:21,365 INFO L124 PetriNetUnfolderBase]: 5820/9220 cut-off events. [2024-11-16 19:17:21,365 INFO L125 PetriNetUnfolderBase]: For 59854/59880 co-relation queries the response was YES. [2024-11-16 19:17:21,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39095 conditions, 9220 events. 5820/9220 cut-off events. For 59854/59880 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 56614 event pairs, 656 based on Foata normal form. 624/9838 useless extension candidates. Maximal degree in co-relation 39041. Up to 2931 conditions per place. [2024-11-16 19:17:21,398 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 117 selfloop transitions, 8 changer transitions 38/167 dead transitions. [2024-11-16 19:17:21,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 167 transitions, 2204 flow [2024-11-16 19:17:21,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 19:17:21,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-16 19:17:21,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2024-11-16 19:17:21,399 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6205128205128205 [2024-11-16 19:17:21,399 INFO L175 Difference]: Start difference. First operand has 94 places, 79 transitions, 869 flow. Second operand 5 states and 121 transitions. [2024-11-16 19:17:21,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 167 transitions, 2204 flow [2024-11-16 19:17:21,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 167 transitions, 2075 flow, removed 26 selfloop flow, removed 8 redundant places. [2024-11-16 19:17:21,482 INFO L231 Difference]: Finished difference. Result has 92 places, 71 transitions, 687 flow [2024-11-16 19:17:21,482 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=687, PETRI_PLACES=92, PETRI_TRANSITIONS=71} [2024-11-16 19:17:21,482 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 47 predicate places. [2024-11-16 19:17:21,483 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 71 transitions, 687 flow [2024-11-16 19:17:21,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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-16 19:17:21,483 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:17:21,483 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:17:21,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 19:17:21,483 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:17:21,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:17:21,484 INFO L85 PathProgramCache]: Analyzing trace with hash 2036740913, now seen corresponding path program 1 times [2024-11-16 19:17:21,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:17:21,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107189222] [2024-11-16 19:17:21,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:17:21,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:17:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:17:22,226 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-16 19:17:22,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:17:22,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107189222] [2024-11-16 19:17:22,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107189222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:17:22,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:17:22,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 19:17:22,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586159670] [2024-11-16 19:17:22,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:17:22,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 19:17:22,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:17:22,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 19:17:22,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-16 19:17:22,233 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-16 19:17:22,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 71 transitions, 687 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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-16 19:17:22,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:17:22,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-16 19:17:22,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:17:23,222 INFO L124 PetriNetUnfolderBase]: 3787/6109 cut-off events. [2024-11-16 19:17:23,222 INFO L125 PetriNetUnfolderBase]: For 28372/28392 co-relation queries the response was YES. [2024-11-16 19:17:23,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25640 conditions, 6109 events. 3787/6109 cut-off events. For 28372/28392 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 34537 event pairs, 1359 based on Foata normal form. 32/6134 useless extension candidates. Maximal degree in co-relation 25606. Up to 4861 conditions per place. [2024-11-16 19:17:23,258 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 80 selfloop transitions, 13 changer transitions 34/131 dead transitions. [2024-11-16 19:17:23,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 131 transitions, 1362 flow [2024-11-16 19:17:23,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 19:17:23,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-16 19:17:23,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-11-16 19:17:23,260 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.42735042735042733 [2024-11-16 19:17:23,260 INFO L175 Difference]: Start difference. First operand has 92 places, 71 transitions, 687 flow. Second operand 9 states and 150 transitions. [2024-11-16 19:17:23,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 131 transitions, 1362 flow [2024-11-16 19:17:23,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 131 transitions, 1270 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-11-16 19:17:23,319 INFO L231 Difference]: Finished difference. Result has 98 places, 70 transitions, 680 flow [2024-11-16 19:17:23,319 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=680, PETRI_PLACES=98, PETRI_TRANSITIONS=70} [2024-11-16 19:17:23,320 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 53 predicate places. [2024-11-16 19:17:23,320 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 70 transitions, 680 flow [2024-11-16 19:17:23,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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-16 19:17:23,320 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:17:23,320 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:17:23,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 19:17:23,321 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:17:23,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:17:23,321 INFO L85 PathProgramCache]: Analyzing trace with hash -223657475, now seen corresponding path program 2 times [2024-11-16 19:17:23,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:17:23,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992013493] [2024-11-16 19:17:23,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:17:23,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:17:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:17:24,183 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-16 19:17:24,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:17:24,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992013493] [2024-11-16 19:17:24,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992013493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:17:24,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:17:24,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 19:17:24,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138362129] [2024-11-16 19:17:24,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:17:24,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 19:17:24,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:17:24,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 19:17:24,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-16 19:17:24,186 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-16 19:17:24,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 70 transitions, 680 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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-16 19:17:24,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:17:24,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-16 19:17:24,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:17:24,991 INFO L124 PetriNetUnfolderBase]: 3767/6081 cut-off events. [2024-11-16 19:17:24,991 INFO L125 PetriNetUnfolderBase]: For 25442/25462 co-relation queries the response was YES. [2024-11-16 19:17:25,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24347 conditions, 6081 events. 3767/6081 cut-off events. For 25442/25462 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 34484 event pairs, 1435 based on Foata normal form. 32/6106 useless extension candidates. Maximal degree in co-relation 24311. Up to 4489 conditions per place. [2024-11-16 19:17:25,038 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 73 selfloop transitions, 20 changer transitions 37/134 dead transitions. [2024-11-16 19:17:25,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 134 transitions, 1381 flow [2024-11-16 19:17:25,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 19:17:25,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-16 19:17:25,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-11-16 19:17:25,040 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.42735042735042733 [2024-11-16 19:17:25,040 INFO L175 Difference]: Start difference. First operand has 98 places, 70 transitions, 680 flow. Second operand 9 states and 150 transitions. [2024-11-16 19:17:25,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 134 transitions, 1381 flow [2024-11-16 19:17:25,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 134 transitions, 1353 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-11-16 19:17:25,086 INFO L231 Difference]: Finished difference. Result has 102 places, 70 transitions, 733 flow [2024-11-16 19:17:25,086 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=733, PETRI_PLACES=102, PETRI_TRANSITIONS=70} [2024-11-16 19:17:25,088 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 57 predicate places. [2024-11-16 19:17:25,088 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 70 transitions, 733 flow [2024-11-16 19:17:25,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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-16 19:17:25,089 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:17:25,089 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:17:25,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 19:17:25,089 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:17:25,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:17:25,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1662732193, now seen corresponding path program 3 times [2024-11-16 19:17:25,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:17:25,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266940751] [2024-11-16 19:17:25,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:17:25,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:17:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:17:25,754 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-16 19:17:25,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:17:25,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266940751] [2024-11-16 19:17:25,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266940751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:17:25,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:17:25,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 19:17:25,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214862632] [2024-11-16 19:17:25,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:17:25,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 19:17:25,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:17:25,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 19:17:25,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-16 19:17:25,757 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-16 19:17:25,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 70 transitions, 733 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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-16 19:17:25,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:17:25,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-16 19:17:25,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:17:26,499 INFO L124 PetriNetUnfolderBase]: 4112/6636 cut-off events. [2024-11-16 19:17:26,499 INFO L125 PetriNetUnfolderBase]: For 36118/36132 co-relation queries the response was YES. [2024-11-16 19:17:26,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28058 conditions, 6636 events. 4112/6636 cut-off events. For 36118/36132 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 38305 event pairs, 1613 based on Foata normal form. 28/6657 useless extension candidates. Maximal degree in co-relation 28019. Up to 5308 conditions per place. [2024-11-16 19:17:26,532 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 75 selfloop transitions, 12 changer transitions 43/134 dead transitions. [2024-11-16 19:17:26,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 134 transitions, 1491 flow [2024-11-16 19:17:26,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 19:17:26,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-16 19:17:26,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2024-11-16 19:17:26,533 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.42165242165242167 [2024-11-16 19:17:26,533 INFO L175 Difference]: Start difference. First operand has 102 places, 70 transitions, 733 flow. Second operand 9 states and 148 transitions. [2024-11-16 19:17:26,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 134 transitions, 1491 flow [2024-11-16 19:17:26,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 134 transitions, 1406 flow, removed 21 selfloop flow, removed 10 redundant places. [2024-11-16 19:17:26,610 INFO L231 Difference]: Finished difference. Result has 101 places, 74 transitions, 785 flow [2024-11-16 19:17:26,611 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=785, PETRI_PLACES=101, PETRI_TRANSITIONS=74} [2024-11-16 19:17:26,611 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 56 predicate places. [2024-11-16 19:17:26,611 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 74 transitions, 785 flow [2024-11-16 19:17:26,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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-16 19:17:26,611 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:17:26,611 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:17:26,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 19:17:26,612 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:17:26,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:17:26,612 INFO L85 PathProgramCache]: Analyzing trace with hash 733744291, now seen corresponding path program 4 times [2024-11-16 19:17:26,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:17:26,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030895977] [2024-11-16 19:17:26,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:17:26,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:17:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:17:27,560 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-16 19:17:27,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:17:27,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030895977] [2024-11-16 19:17:27,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030895977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:17:27,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:17:27,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 19:17:27,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156639073] [2024-11-16 19:17:27,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:17:27,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 19:17:27,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:17:27,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 19:17:27,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-16 19:17:27,564 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-16 19:17:27,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 74 transitions, 785 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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-16 19:17:27,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:17:27,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-16 19:17:27,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:17:28,917 INFO L124 PetriNetUnfolderBase]: 5370/8638 cut-off events. [2024-11-16 19:17:28,918 INFO L125 PetriNetUnfolderBase]: For 43672/43686 co-relation queries the response was YES. [2024-11-16 19:17:28,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35167 conditions, 8638 events. 5370/8638 cut-off events. For 43672/43686 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 52529 event pairs, 1491 based on Foata normal form. 92/8723 useless extension candidates. Maximal degree in co-relation 35128. Up to 3740 conditions per place. [2024-11-16 19:17:28,965 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 73 selfloop transitions, 27 changer transitions 81/185 dead transitions. [2024-11-16 19:17:28,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 185 transitions, 1984 flow [2024-11-16 19:17:28,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 19:17:28,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-16 19:17:28,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 216 transitions. [2024-11-16 19:17:28,967 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4260355029585799 [2024-11-16 19:17:28,967 INFO L175 Difference]: Start difference. First operand has 101 places, 74 transitions, 785 flow. Second operand 13 states and 216 transitions. [2024-11-16 19:17:28,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 185 transitions, 1984 flow [2024-11-16 19:17:29,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 185 transitions, 1895 flow, removed 35 selfloop flow, removed 7 redundant places. [2024-11-16 19:17:29,065 INFO L231 Difference]: Finished difference. Result has 110 places, 70 transitions, 800 flow [2024-11-16 19:17:29,065 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=800, PETRI_PLACES=110, PETRI_TRANSITIONS=70} [2024-11-16 19:17:29,065 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 65 predicate places. [2024-11-16 19:17:29,066 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 70 transitions, 800 flow [2024-11-16 19:17:29,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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-16 19:17:29,066 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:17:29,066 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:17:29,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 19:17:29,067 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:17:29,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:17:29,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1755972404, now seen corresponding path program 1 times [2024-11-16 19:17:29,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:17:29,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008325544] [2024-11-16 19:17:29,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:17:29,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:17:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:17:29,317 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-16 19:17:29,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:17:29,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008325544] [2024-11-16 19:17:29,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008325544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:17:29,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:17:29,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 19:17:29,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382813340] [2024-11-16 19:17:29,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:17:29,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 19:17:29,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:17:29,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 19:17:29,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 19:17:29,320 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2024-11-16 19:17:29,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 70 transitions, 800 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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-16 19:17:29,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:17:29,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2024-11-16 19:17:29,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:17:29,774 INFO L124 PetriNetUnfolderBase]: 2134/3459 cut-off events. [2024-11-16 19:17:29,774 INFO L125 PetriNetUnfolderBase]: For 16490/16496 co-relation queries the response was YES. [2024-11-16 19:17:29,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13334 conditions, 3459 events. 2134/3459 cut-off events. For 16490/16496 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 18617 event pairs, 212 based on Foata normal form. 193/3650 useless extension candidates. Maximal degree in co-relation 13291. Up to 1280 conditions per place. [2024-11-16 19:17:29,791 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 47 selfloop transitions, 11 changer transitions 56/118 dead transitions. [2024-11-16 19:17:29,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 118 transitions, 1532 flow [2024-11-16 19:17:29,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 19:17:29,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 19:17:29,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2024-11-16 19:17:29,792 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49145299145299143 [2024-11-16 19:17:29,792 INFO L175 Difference]: Start difference. First operand has 110 places, 70 transitions, 800 flow. Second operand 6 states and 115 transitions. [2024-11-16 19:17:29,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 118 transitions, 1532 flow [2024-11-16 19:17:29,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 118 transitions, 1325 flow, removed 60 selfloop flow, removed 21 redundant places. [2024-11-16 19:17:29,809 INFO L231 Difference]: Finished difference. Result has 90 places, 40 transitions, 284 flow [2024-11-16 19:17:29,809 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=284, PETRI_PLACES=90, PETRI_TRANSITIONS=40} [2024-11-16 19:17:29,809 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 45 predicate places. [2024-11-16 19:17:29,810 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 40 transitions, 284 flow [2024-11-16 19:17:29,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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-16 19:17:29,810 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:17:29,810 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:17:29,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 19:17:29,810 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:17:29,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:17:29,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1685690520, now seen corresponding path program 1 times [2024-11-16 19:17:29,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:17:29,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192712913] [2024-11-16 19:17:29,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:17:29,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:17:29,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 19:17:29,855 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 19:17:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 19:17:29,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 19:17:29,935 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 19:17:29,937 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-16 19:17:29,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-11-16 19:17:29,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-11-16 19:17:29,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-16 19:17:29,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-16 19:17:29,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-16 19:17:29,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 19:17:29,940 INFO L407 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:17:30,029 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-16 19:17:30,029 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 19:17:30,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 07:17:30 BasicIcfg [2024-11-16 19:17:30,034 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 19:17:30,035 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 19:17:30,035 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 19:17:30,035 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 19:17:30,036 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:16:53" (3/4) ... [2024-11-16 19:17:30,036 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 19:17:30,125 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 19:17:30,125 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 19:17:30,126 INFO L158 Benchmark]: Toolchain (without parser) took 38455.73ms. Allocated memory was 176.2MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 144.7MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2024-11-16 19:17:30,126 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 125.8MB. Free memory was 87.3MB in the beginning and 87.2MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 19:17:30,126 INFO L158 Benchmark]: CACSL2BoogieTranslator took 577.34ms. Allocated memory is still 176.2MB. Free memory was 144.7MB in the beginning and 118.7MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-16 19:17:30,126 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.14ms. Allocated memory is still 176.2MB. Free memory was 118.7MB in the beginning and 116.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 19:17:30,127 INFO L158 Benchmark]: Boogie Preprocessor took 61.35ms. Allocated memory is still 176.2MB. Free memory was 116.6MB in the beginning and 112.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 19:17:30,127 INFO L158 Benchmark]: IcfgBuilder took 772.93ms. Allocated memory is still 176.2MB. Free memory was 112.4MB in the beginning and 61.0MB in the end (delta: 51.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-11-16 19:17:30,127 INFO L158 Benchmark]: TraceAbstraction took 36878.02ms. Allocated memory was 176.2MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 60.0MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2024-11-16 19:17:30,127 INFO L158 Benchmark]: Witness Printer took 90.56ms. Allocated memory is still 4.8GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-16 19:17:30,128 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 125.8MB. Free memory was 87.3MB in the beginning and 87.2MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 577.34ms. Allocated memory is still 176.2MB. Free memory was 144.7MB in the beginning and 118.7MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.14ms. Allocated memory is still 176.2MB. Free memory was 118.7MB in the beginning and 116.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.35ms. Allocated memory is still 176.2MB. Free memory was 116.6MB in the beginning and 112.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 772.93ms. Allocated memory is still 176.2MB. Free memory was 112.4MB in the beginning and 61.0MB in the end (delta: 51.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * TraceAbstraction took 36878.02ms. Allocated memory was 176.2MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 60.0MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. * Witness Printer took 90.56ms. Allocated memory is still 4.8GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L716] 0 _Bool y$flush_delayed; [L717] 0 int y$mem_tmp; [L718] 0 _Bool y$r_buff0_thd0; [L719] 0 _Bool y$r_buff0_thd1; [L720] 0 _Bool y$r_buff0_thd2; [L721] 0 _Bool y$r_buff0_thd3; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$r_buff1_thd3; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L811] 0 pthread_t t2492; [L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2492=-3, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L813] 0 pthread_t t2493; [L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2492=-3, t2493=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L815] 0 pthread_t t2494; [L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2492=-3, t2493=-2, t2494=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L778] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L778] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L786] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L739] 1 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L742] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L754] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L757] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492=-3, t2493=-2, t2494=-1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492=-3, t2493=-2, t2494=-1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492=-3, t2493=-2, t2494=-1, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 812]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 64 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 36.7s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 27.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1283 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1280 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 104 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4104 IncrementalHoareTripleChecker+Invalid, 4208 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 104 mSolverCounterUnsat, 5 mSDtfsCounter, 4104 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=950occurred in iteration=10, InterpolantAutomatonStates: 138, 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, 8.3s InterpolantComputationTime, 373 NumberOfCodeBlocks, 373 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 327 ConstructedInterpolants, 0 QuantifiedInterpolants, 3135 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-16 19:17:30,160 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE