./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 408d8d7e58240f749ab11087191b04ec647cfea8447827b0505b793eb68a9c0a --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:12:41,664 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:12:41,716 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 01:12:41,724 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:12:41,724 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:12:41,747 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:12:41,747 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:12:41,748 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:12:41,748 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:12:41,748 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:12:41,749 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:12:41,749 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:12:41,749 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:12:41,750 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:12:41,750 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:12:41,750 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:12:41,750 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:12:41,750 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:12:41,750 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:12:41,750 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:12:41,750 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:12:41,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:12:41,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:12:41,750 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:12:41,751 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:12:41,751 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:12:41,751 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:12:41,751 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:12:41,751 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:12:41,751 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:12:41,751 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:12:41,751 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:12:41,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:12:41,752 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:12:41,752 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:12:41,752 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:12:41,752 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:12:41,752 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:12:41,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:12:41,752 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:12:41,752 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:12:41,752 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:12:41,753 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:12:41,753 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 408d8d7e58240f749ab11087191b04ec647cfea8447827b0505b793eb68a9c0a [2025-02-08 01:12:41,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:12:42,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:12:42,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:12:42,008 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:12:42,008 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:12:42,009 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c [2025-02-08 01:12:43,219 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fe89a909a/8d2c442573804ef5a500fc0321d3644a/FLAG31f32d7e4 [2025-02-08 01:12:43,462 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:12:43,463 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c [2025-02-08 01:12:43,468 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fe89a909a/8d2c442573804ef5a500fc0321d3644a/FLAG31f32d7e4 [2025-02-08 01:12:43,785 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fe89a909a/8d2c442573804ef5a500fc0321d3644a [2025-02-08 01:12:43,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:12:43,788 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:12:43,789 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:12:43,789 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:12:43,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:12:43,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:12:43" (1/1) ... [2025-02-08 01:12:43,793 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f5a5339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:12:43, skipping insertion in model container [2025-02-08 01:12:43,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:12:43" (1/1) ... [2025-02-08 01:12:43,802 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:12:43,921 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c[2856,2869] [2025-02-08 01:12:43,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:12:43,933 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:12:43,946 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c[2856,2869] [2025-02-08 01:12:43,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:12:43,955 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:12:43,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:12:43 WrapperNode [2025-02-08 01:12:43,956 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:12:43,957 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:12:43,957 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:12:43,957 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:12:43,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:12:43" (1/1) ... [2025-02-08 01:12:43,965 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:12:43" (1/1) ... [2025-02-08 01:12:43,984 INFO L138 Inliner]: procedures = 22, calls = 15, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 192 [2025-02-08 01:12:43,984 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:12:43,985 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:12:43,985 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:12:43,985 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:12:43,995 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:12:43" (1/1) ... [2025-02-08 01:12:43,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:12:43" (1/1) ... [2025-02-08 01:12:44,001 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:12:43" (1/1) ... [2025-02-08 01:12:44,012 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]. [2025-02-08 01:12:44,012 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:12:43" (1/1) ... [2025-02-08 01:12:44,012 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:12:43" (1/1) ... [2025-02-08 01:12:44,015 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:12:43" (1/1) ... [2025-02-08 01:12:44,016 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:12:43" (1/1) ... [2025-02-08 01:12:44,016 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:12:43" (1/1) ... [2025-02-08 01:12:44,017 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:12:43" (1/1) ... [2025-02-08 01:12:44,018 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:12:44,018 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:12:44,019 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:12:44,019 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:12:44,019 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:12:43" (1/1) ... [2025-02-08 01:12:44,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:12:44,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:12:44,055 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 01:12:44,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 01:12:44,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:12:44,074 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 01:12:44,074 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 01:12:44,074 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 01:12:44,074 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 01:12:44,074 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 01:12:44,074 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 01:12:44,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:12:44,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:12:44,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:12:44,075 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 01:12:44,138 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:12:44,139 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:12:44,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-9: #t~ite2#1 := #t~ret1#1; [2025-02-08 01:12:44,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-10: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret1#1 && #t~ret1#1 <= 2147483647; [2025-02-08 01:12:44,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-11: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 01:12:44,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-12: havoc minus_~a#1, minus_~b#1; [2025-02-08 01:12:44,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-13: #t~ret1#1 := minus_#res#1; [2025-02-08 01:12:44,242 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-9: #t~ite7#1 := #t~ret6#1; [2025-02-08 01:12:44,242 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-10: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647; [2025-02-08 01:12:44,242 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-11: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 01:12:44,243 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-12: havoc minus_~a#1, minus_~b#1; [2025-02-08 01:12:44,243 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-13: #t~ret6#1 := minus_#res#1; [2025-02-08 01:12:44,276 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-9: #t~ite12#1 := #t~ret11#1; [2025-02-08 01:12:44,277 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-10: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret11#1 && #t~ret11#1 <= 2147483647; [2025-02-08 01:12:44,277 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-11: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 01:12:44,277 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-12: havoc minus_~a#1, minus_~b#1; [2025-02-08 01:12:44,277 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-13: #t~ret11#1 := minus_#res#1; [2025-02-08 01:12:44,360 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:12:44,360 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:12:44,587 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:12:44,587 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:12:44,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:12:44 BoogieIcfgContainer [2025-02-08 01:12:44,588 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:12:44,590 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:12:44,590 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:12:44,593 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:12:44,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:12:43" (1/3) ... [2025-02-08 01:12:44,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229ccd54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:12:44, skipping insertion in model container [2025-02-08 01:12:44,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:12:43" (2/3) ... [2025-02-08 01:12:44,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229ccd54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:12:44, skipping insertion in model container [2025-02-08 01:12:44,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:12:44" (3/3) ... [2025-02-08 01:12:44,595 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-file-item-trans.wvr.c [2025-02-08 01:12:44,604 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:12:44,606 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-file-item-trans.wvr.c that has 4 procedures, 44 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-08 01:12:44,607 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:12:44,660 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 01:12:44,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 52 transitions, 125 flow [2025-02-08 01:12:44,719 INFO L124 PetriNetUnfolderBase]: 9/49 cut-off events. [2025-02-08 01:12:44,721 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 01:12:44,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 49 events. 9/49 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 114 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2025-02-08 01:12:44,728 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 52 transitions, 125 flow [2025-02-08 01:12:44,731 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 48 transitions, 114 flow [2025-02-08 01:12:44,737 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:12:44,743 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;@5721a19f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:12:44,744 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 01:12:44,760 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:12:44,760 INFO L124 PetriNetUnfolderBase]: 9/47 cut-off events. [2025-02-08 01:12:44,761 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 01:12:44,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:12:44,761 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:12:44,762 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:12:44,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:12:44,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1912677226, now seen corresponding path program 1 times [2025-02-08 01:12:44,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:12:44,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942454150] [2025-02-08 01:12:44,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:12:44,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:12:44,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 01:12:44,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 01:12:44,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:12:44,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:12:45,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:12:45,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:12:45,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942454150] [2025-02-08 01:12:45,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942454150] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:12:45,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:12:45,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:12:45,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849228496] [2025-02-08 01:12:45,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:12:45,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:12:45,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:12:45,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:12:45,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:12:45,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 52 [2025-02-08 01:12:45,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 48 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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) [2025-02-08 01:12:45,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:12:45,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 52 [2025-02-08 01:12:45,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:12:45,646 INFO L124 PetriNetUnfolderBase]: 2707/3972 cut-off events. [2025-02-08 01:12:45,646 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2025-02-08 01:12:45,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8007 conditions, 3972 events. 2707/3972 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 24654 event pairs, 835 based on Foata normal form. 1/3178 useless extension candidates. Maximal degree in co-relation 7261. Up to 1548 conditions per place. [2025-02-08 01:12:45,669 INFO L140 encePairwiseOnDemand]: 44/52 looper letters, 97 selfloop transitions, 8 changer transitions 4/125 dead transitions. [2025-02-08 01:12:45,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 125 transitions, 525 flow [2025-02-08 01:12:45,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:12:45,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:12:45,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 227 transitions. [2025-02-08 01:12:45,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7275641025641025 [2025-02-08 01:12:45,683 INFO L175 Difference]: Start difference. First operand has 49 places, 48 transitions, 114 flow. Second operand 6 states and 227 transitions. [2025-02-08 01:12:45,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 125 transitions, 525 flow [2025-02-08 01:12:45,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 125 transitions, 487 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 01:12:45,698 INFO L231 Difference]: Finished difference. Result has 52 places, 54 transitions, 160 flow [2025-02-08 01:12:45,699 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=52, PETRI_TRANSITIONS=54} [2025-02-08 01:12:45,702 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2025-02-08 01:12:45,702 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 54 transitions, 160 flow [2025-02-08 01:12:45,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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) [2025-02-08 01:12:45,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:12:45,702 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:12:45,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:12:45,702 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:12:45,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:12:45,703 INFO L85 PathProgramCache]: Analyzing trace with hash -518719722, now seen corresponding path program 2 times [2025-02-08 01:12:45,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:12:45,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474150242] [2025-02-08 01:12:45,703 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:12:45,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:12:45,716 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 1 equivalence classes. [2025-02-08 01:12:45,735 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 01:12:45,735 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:12:45,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:12:45,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:12:45,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:12:45,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474150242] [2025-02-08 01:12:45,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474150242] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:12:45,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:12:45,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:12:45,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181571183] [2025-02-08 01:12:45,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:12:45,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:12:45,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:12:45,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:12:45,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:12:45,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 52 [2025-02-08 01:12:45,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 54 transitions, 160 flow. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:12:45,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:12:45,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 52 [2025-02-08 01:12:45,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:12:46,326 INFO L124 PetriNetUnfolderBase]: 3278/4822 cut-off events. [2025-02-08 01:12:46,327 INFO L125 PetriNetUnfolderBase]: For 1524/1745 co-relation queries the response was YES. [2025-02-08 01:12:46,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10742 conditions, 4822 events. 3278/4822 cut-off events. For 1524/1745 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 31461 event pairs, 1311 based on Foata normal form. 1/3839 useless extension candidates. Maximal degree in co-relation 7394. Up to 2310 conditions per place. [2025-02-08 01:12:46,353 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 93 selfloop transitions, 9 changer transitions 4/124 dead transitions. [2025-02-08 01:12:46,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 124 transitions, 547 flow [2025-02-08 01:12:46,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:12:46,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:12:46,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 226 transitions. [2025-02-08 01:12:46,354 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7243589743589743 [2025-02-08 01:12:46,354 INFO L175 Difference]: Start difference. First operand has 52 places, 54 transitions, 160 flow. Second operand 6 states and 226 transitions. [2025-02-08 01:12:46,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 124 transitions, 547 flow [2025-02-08 01:12:46,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 124 transitions, 547 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 01:12:46,359 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 205 flow [2025-02-08 01:12:46,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=205, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2025-02-08 01:12:46,360 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places. [2025-02-08 01:12:46,360 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 205 flow [2025-02-08 01:12:46,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:12:46,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:12:46,360 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:12:46,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:12:46,360 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:12:46,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:12:46,361 INFO L85 PathProgramCache]: Analyzing trace with hash -56064252, now seen corresponding path program 3 times [2025-02-08 01:12:46,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:12:46,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292394157] [2025-02-08 01:12:46,361 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:12:46,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:12:46,367 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 1 equivalence classes. [2025-02-08 01:12:46,372 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 01:12:46,372 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:12:46,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:12:46,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:12:46,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:12:46,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292394157] [2025-02-08 01:12:46,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292394157] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:12:46,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:12:46,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:12:46,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573626905] [2025-02-08 01:12:46,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:12:46,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:12:46,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:12:46,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:12:46,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:12:46,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 52 [2025-02-08 01:12:46,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 205 flow. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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) [2025-02-08 01:12:46,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:12:46,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 52 [2025-02-08 01:12:46,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:12:47,013 INFO L124 PetriNetUnfolderBase]: 3933/6147 cut-off events. [2025-02-08 01:12:47,013 INFO L125 PetriNetUnfolderBase]: For 4021/4021 co-relation queries the response was YES. [2025-02-08 01:12:47,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14157 conditions, 6147 events. 3933/6147 cut-off events. For 4021/4021 co-relation queries the response was YES. Maximal size of possible extension queue 615. Compared 43556 event pairs, 567 based on Foata normal form. 1/5371 useless extension candidates. Maximal degree in co-relation 13807. Up to 1704 conditions per place. [2025-02-08 01:12:47,033 INFO L140 encePairwiseOnDemand]: 43/52 looper letters, 102 selfloop transitions, 16 changer transitions 3/137 dead transitions. [2025-02-08 01:12:47,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 137 transitions, 655 flow [2025-02-08 01:12:47,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:12:47,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:12:47,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 228 transitions. [2025-02-08 01:12:47,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7307692307692307 [2025-02-08 01:12:47,034 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 205 flow. Second operand 6 states and 228 transitions. [2025-02-08 01:12:47,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 137 transitions, 655 flow [2025-02-08 01:12:47,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 137 transitions, 651 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:12:47,045 INFO L231 Difference]: Finished difference. Result has 65 places, 66 transitions, 313 flow [2025-02-08 01:12:47,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=313, PETRI_PLACES=65, PETRI_TRANSITIONS=66} [2025-02-08 01:12:47,046 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 16 predicate places. [2025-02-08 01:12:47,046 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 313 flow [2025-02-08 01:12:47,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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) [2025-02-08 01:12:47,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:12:47,046 INFO L206 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] [2025-02-08 01:12:47,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:12:47,046 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:12:47,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:12:47,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1673026627, now seen corresponding path program 1 times [2025-02-08 01:12:47,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:12:47,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025617701] [2025-02-08 01:12:47,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:12:47,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:12:47,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 01:12:47,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 01:12:47,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:12:47,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:12:47,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:12:47,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:12:47,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025617701] [2025-02-08 01:12:47,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025617701] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:12:47,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:12:47,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:12:47,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543805085] [2025-02-08 01:12:47,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:12:47,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:12:47,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:12:47,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:12:47,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:12:47,081 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 52 [2025-02-08 01:12:47,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 66 transitions, 313 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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) [2025-02-08 01:12:47,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:12:47,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 52 [2025-02-08 01:12:47,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:12:47,519 INFO L124 PetriNetUnfolderBase]: 4179/6745 cut-off events. [2025-02-08 01:12:47,522 INFO L125 PetriNetUnfolderBase]: For 9418/9897 co-relation queries the response was YES. [2025-02-08 01:12:47,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16399 conditions, 6745 events. 4179/6745 cut-off events. For 9418/9897 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 48259 event pairs, 1554 based on Foata normal form. 143/5909 useless extension candidates. Maximal degree in co-relation 15904. Up to 4815 conditions per place. [2025-02-08 01:12:47,565 INFO L140 encePairwiseOnDemand]: 48/52 looper letters, 61 selfloop transitions, 2 changer transitions 4/89 dead transitions. [2025-02-08 01:12:47,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 89 transitions, 554 flow [2025-02-08 01:12:47,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:12:47,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:12:47,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2025-02-08 01:12:47,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.717948717948718 [2025-02-08 01:12:47,566 INFO L175 Difference]: Start difference. First operand has 65 places, 66 transitions, 313 flow. Second operand 3 states and 112 transitions. [2025-02-08 01:12:47,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 89 transitions, 554 flow [2025-02-08 01:12:47,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 89 transitions, 552 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-08 01:12:47,579 INFO L231 Difference]: Finished difference. Result has 69 places, 66 transitions, 311 flow [2025-02-08 01:12:47,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=311, PETRI_PLACES=69, PETRI_TRANSITIONS=66} [2025-02-08 01:12:47,580 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 20 predicate places. [2025-02-08 01:12:47,580 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 311 flow [2025-02-08 01:12:47,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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) [2025-02-08 01:12:47,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:12:47,581 INFO L206 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] [2025-02-08 01:12:47,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:12:47,581 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:12:47,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:12:47,581 INFO L85 PathProgramCache]: Analyzing trace with hash -126025861, now seen corresponding path program 2 times [2025-02-08 01:12:47,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:12:47,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277936971] [2025-02-08 01:12:47,582 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:12:47,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:12:47,589 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-02-08 01:12:47,596 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 01:12:47,601 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:12:47,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:12:47,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:12:47,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:12:47,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277936971] [2025-02-08 01:12:47,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277936971] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:12:47,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:12:47,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:12:47,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194769512] [2025-02-08 01:12:47,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:12:47,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:12:47,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:12:47,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:12:47,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:12:47,646 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 52 [2025-02-08 01:12:47,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 311 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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) [2025-02-08 01:12:47,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:12:47,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 52 [2025-02-08 01:12:47,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:12:48,056 INFO L124 PetriNetUnfolderBase]: 2860/4545 cut-off events. [2025-02-08 01:12:48,056 INFO L125 PetriNetUnfolderBase]: For 6838/7363 co-relation queries the response was YES. [2025-02-08 01:12:48,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11786 conditions, 4545 events. 2860/4545 cut-off events. For 6838/7363 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 31913 event pairs, 1904 based on Foata normal form. 164/3870 useless extension candidates. Maximal degree in co-relation 11578. Up to 3407 conditions per place. [2025-02-08 01:12:48,073 INFO L140 encePairwiseOnDemand]: 48/52 looper letters, 56 selfloop transitions, 3 changer transitions 5/86 dead transitions. [2025-02-08 01:12:48,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 86 transitions, 523 flow [2025-02-08 01:12:48,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:12:48,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:12:48,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2025-02-08 01:12:48,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.717948717948718 [2025-02-08 01:12:48,074 INFO L175 Difference]: Start difference. First operand has 69 places, 66 transitions, 311 flow. Second operand 3 states and 112 transitions. [2025-02-08 01:12:48,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 86 transitions, 523 flow [2025-02-08 01:12:48,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 86 transitions, 517 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-08 01:12:48,083 INFO L231 Difference]: Finished difference. Result has 71 places, 67 transitions, 333 flow [2025-02-08 01:12:48,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=333, PETRI_PLACES=71, PETRI_TRANSITIONS=67} [2025-02-08 01:12:48,084 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 22 predicate places. [2025-02-08 01:12:48,084 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 67 transitions, 333 flow [2025-02-08 01:12:48,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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) [2025-02-08 01:12:48,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:12:48,085 INFO L206 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] [2025-02-08 01:12:48,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:12:48,085 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:12:48,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:12:48,085 INFO L85 PathProgramCache]: Analyzing trace with hash -561169775, now seen corresponding path program 1 times [2025-02-08 01:12:48,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:12:48,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549810103] [2025-02-08 01:12:48,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:12:48,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:12:48,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 01:12:48,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 01:12:48,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:12:48,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:12:48,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:12:48,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:12:48,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549810103] [2025-02-08 01:12:48,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549810103] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:12:48,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:12:48,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:12:48,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780512322] [2025-02-08 01:12:48,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:12:48,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:12:48,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:12:48,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:12:48,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:12:48,157 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 52 [2025-02-08 01:12:48,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 67 transitions, 333 flow. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 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) [2025-02-08 01:12:48,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:12:48,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 52 [2025-02-08 01:12:48,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:12:48,632 INFO L124 PetriNetUnfolderBase]: 3709/5700 cut-off events. [2025-02-08 01:12:48,632 INFO L125 PetriNetUnfolderBase]: For 9505/10086 co-relation queries the response was YES. [2025-02-08 01:12:48,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14996 conditions, 5700 events. 3709/5700 cut-off events. For 9505/10086 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 39887 event pairs, 1914 based on Foata normal form. 121/4696 useless extension candidates. Maximal degree in co-relation 14957. Up to 3837 conditions per place. [2025-02-08 01:12:48,646 INFO L140 encePairwiseOnDemand]: 48/52 looper letters, 69 selfloop transitions, 3 changer transitions 38/134 dead transitions. [2025-02-08 01:12:48,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 134 transitions, 914 flow [2025-02-08 01:12:48,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:12:48,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:12:48,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 184 transitions. [2025-02-08 01:12:48,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7076923076923077 [2025-02-08 01:12:48,648 INFO L175 Difference]: Start difference. First operand has 71 places, 67 transitions, 333 flow. Second operand 5 states and 184 transitions. [2025-02-08 01:12:48,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 134 transitions, 914 flow [2025-02-08 01:12:48,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 134 transitions, 879 flow, removed 13 selfloop flow, removed 2 redundant places. [2025-02-08 01:12:48,656 INFO L231 Difference]: Finished difference. Result has 75 places, 69 transitions, 337 flow [2025-02-08 01:12:48,656 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=337, PETRI_PLACES=75, PETRI_TRANSITIONS=69} [2025-02-08 01:12:48,657 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 26 predicate places. [2025-02-08 01:12:48,658 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 337 flow [2025-02-08 01:12:48,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 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) [2025-02-08 01:12:48,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:12:48,658 INFO L206 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] [2025-02-08 01:12:48,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 01:12:48,658 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:12:48,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:12:48,659 INFO L85 PathProgramCache]: Analyzing trace with hash 48755228, now seen corresponding path program 1 times [2025-02-08 01:12:48,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:12:48,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209330802] [2025-02-08 01:12:48,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:12:48,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:12:48,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 01:12:48,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:12:48,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:12:48,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:12:48,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:12:48,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:12:48,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209330802] [2025-02-08 01:12:48,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209330802] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:12:48,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:12:48,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:12:48,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274430660] [2025-02-08 01:12:48,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:12:48,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:12:48,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:12:48,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:12:48,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:12:48,739 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 52 [2025-02-08 01:12:48,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 337 flow. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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) [2025-02-08 01:12:48,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:12:48,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 52 [2025-02-08 01:12:48,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:12:49,197 INFO L124 PetriNetUnfolderBase]: 4354/7373 cut-off events. [2025-02-08 01:12:49,197 INFO L125 PetriNetUnfolderBase]: For 12495/13609 co-relation queries the response was YES. [2025-02-08 01:12:49,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19442 conditions, 7373 events. 4354/7373 cut-off events. For 12495/13609 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 55269 event pairs, 1149 based on Foata normal form. 462/6883 useless extension candidates. Maximal degree in co-relation 17397. Up to 4364 conditions per place. [2025-02-08 01:12:49,215 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 70 selfloop transitions, 2 changer transitions 24/120 dead transitions. [2025-02-08 01:12:49,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 120 transitions, 786 flow [2025-02-08 01:12:49,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:12:49,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:12:49,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2025-02-08 01:12:49,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6538461538461539 [2025-02-08 01:12:49,217 INFO L175 Difference]: Start difference. First operand has 75 places, 69 transitions, 337 flow. Second operand 5 states and 170 transitions. [2025-02-08 01:12:49,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 120 transitions, 786 flow [2025-02-08 01:12:49,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 120 transitions, 785 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:12:49,231 INFO L231 Difference]: Finished difference. Result has 82 places, 71 transitions, 364 flow [2025-02-08 01:12:49,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=364, PETRI_PLACES=82, PETRI_TRANSITIONS=71} [2025-02-08 01:12:49,231 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 33 predicate places. [2025-02-08 01:12:49,231 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 71 transitions, 364 flow [2025-02-08 01:12:49,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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) [2025-02-08 01:12:49,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:12:49,231 INFO L206 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] [2025-02-08 01:12:49,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 01:12:49,232 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:12:49,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:12:49,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1297544964, now seen corresponding path program 1 times [2025-02-08 01:12:49,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:12:49,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776506976] [2025-02-08 01:12:49,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:12:49,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:12:49,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 01:12:49,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:12:49,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:12:49,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:12:49,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:12:49,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:12:49,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776506976] [2025-02-08 01:12:49,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776506976] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:12:49,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:12:49,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:12:49,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281166512] [2025-02-08 01:12:49,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:12:49,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:12:49,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:12:49,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:12:49,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:12:49,314 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 52 [2025-02-08 01:12:49,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 71 transitions, 364 flow. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:12:49,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:12:49,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 52 [2025-02-08 01:12:49,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:12:49,701 INFO L124 PetriNetUnfolderBase]: 3639/6003 cut-off events. [2025-02-08 01:12:49,701 INFO L125 PetriNetUnfolderBase]: For 10888/11526 co-relation queries the response was YES. [2025-02-08 01:12:49,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17545 conditions, 6003 events. 3639/6003 cut-off events. For 10888/11526 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 44268 event pairs, 1659 based on Foata normal form. 117/4906 useless extension candidates. Maximal degree in co-relation 17496. Up to 3413 conditions per place. [2025-02-08 01:12:49,717 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 71 selfloop transitions, 10 changer transitions 13/121 dead transitions. [2025-02-08 01:12:49,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 121 transitions, 777 flow [2025-02-08 01:12:49,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:12:49,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:12:49,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 179 transitions. [2025-02-08 01:12:49,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6884615384615385 [2025-02-08 01:12:49,721 INFO L175 Difference]: Start difference. First operand has 82 places, 71 transitions, 364 flow. Second operand 5 states and 179 transitions. [2025-02-08 01:12:49,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 121 transitions, 777 flow [2025-02-08 01:12:49,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 121 transitions, 765 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-02-08 01:12:49,744 INFO L231 Difference]: Finished difference. Result has 83 places, 74 transitions, 408 flow [2025-02-08 01:12:49,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=408, PETRI_PLACES=83, PETRI_TRANSITIONS=74} [2025-02-08 01:12:49,745 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 34 predicate places. [2025-02-08 01:12:49,745 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 74 transitions, 408 flow [2025-02-08 01:12:49,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:12:49,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:12:49,745 INFO L206 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] [2025-02-08 01:12:49,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 01:12:49,745 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:12:49,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:12:49,746 INFO L85 PathProgramCache]: Analyzing trace with hash -343047702, now seen corresponding path program 2 times [2025-02-08 01:12:49,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:12:49,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868107197] [2025-02-08 01:12:49,746 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:12:49,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:12:49,751 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-02-08 01:12:49,753 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:12:49,753 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:12:49,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:12:49,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:12:49,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:12:49,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868107197] [2025-02-08 01:12:49,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868107197] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:12:49,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:12:49,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:12:49,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875618410] [2025-02-08 01:12:49,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:12:49,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:12:49,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:12:49,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:12:49,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:12:49,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 52 [2025-02-08 01:12:49,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 74 transitions, 408 flow. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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) [2025-02-08 01:12:49,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:12:49,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 52 [2025-02-08 01:12:49,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:12:50,127 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([487] L44-5-->thread1EXIT: Formula: (and (= v_~result_9~0_4 |v_thread1Thread1of1ForFork1_#t~ite5#1_3|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {thread1Thread1of1ForFork1_#t~ite5#1=|v_thread1Thread1of1ForFork1_#t~ite5#1_3|} OutVars{thread1Thread1of1ForFork1_#t~ite2#1=|v_thread1Thread1of1ForFork1_#t~ite2#1_1|, thread1Thread1of1ForFork1_#t~ret1#1=|v_thread1Thread1of1ForFork1_#t~ret1#1_1|, thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_1|, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_3|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|, ~result_9~0=v_~result_9~0_4, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~ite2#1, thread1Thread1of1ForFork1_#t~ret1#1, thread1Thread1of1ForFork1_#t~ite3#1, thread1Thread1of1ForFork1_#t~ite4#1, thread1Thread1of1ForFork1_#t~ite5#1, thread1Thread1of1ForFork1_#res#1.offset, ~result_9~0, thread1Thread1of1ForFork1_#res#1.base][84], [130#true, 24#thread2EXITtrue, Black: 60#(<= ~result_9~0 0), Black: 94#true, Black: 62#(and (not (= (mod ~isNull_3~0 256) 0)) (<= ~result_9~0 0)), Black: 56#true, Black: 101#(not (= (mod ~isNull_0~0 256) 0)), 117#(= (mod ~isNull_6~0 256) 0), Black: 136#(and (<= ~result_10~0 0) (or (and (not (= (mod ~isNull_6~0 256) 0)) (= 0 |thread2Thread1of1ForFork0_#t~ite10#1|)) (and (= (mod ~isNull_6~0 256) 0) (= 1 |thread2Thread1of1ForFork0_#t~ite10#1|)))), Black: 134#(<= ~result_10~0 0), 81#true, Black: 73#(or (and (not (= (mod ~isNull_3~0 256) 0)) (= ~result_9~0 0)) (and (= ~result_9~0 1) (= (mod ~isNull_3~0 256) 0))), Black: 106#(<= (+ |thread2Thread1of1ForFork0_#t~ite9#1| 1) 0), 17#thread1EXITtrue, Black: 110#(and (<= (+ |thread2Thread1of1ForFork0_#t~ite9#1| 1) 0) (<= (+ 1 |thread2Thread1of1ForFork0_#t~ite10#1|) 0)), 34#L77-1true, Black: 108#(<= (+ ~result_10~0 1) 0), 143#true, 96#(= (mod ~isNull_0~0 256) 0), 58#(not (= (mod ~isNull_3~0 256) 0)), 48#L56-19true, Black: 85#(<= ~result_9~0 0), Black: 87#(and (<= ~result_9~0 0) (or (= |thread1Thread1of1ForFork1_#t~ite5#1| 0) (= (mod ~isNull_3~0 256) 0))), Black: 115#true]) [2025-02-08 01:12:50,127 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-02-08 01:12:50,127 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-08 01:12:50,127 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-08 01:12:50,127 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-02-08 01:12:50,152 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([487] L44-5-->thread1EXIT: Formula: (and (= v_~result_9~0_4 |v_thread1Thread1of1ForFork1_#t~ite5#1_3|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {thread1Thread1of1ForFork1_#t~ite5#1=|v_thread1Thread1of1ForFork1_#t~ite5#1_3|} OutVars{thread1Thread1of1ForFork1_#t~ite2#1=|v_thread1Thread1of1ForFork1_#t~ite2#1_1|, thread1Thread1of1ForFork1_#t~ret1#1=|v_thread1Thread1of1ForFork1_#t~ret1#1_1|, thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_1|, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_3|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|, ~result_9~0=v_~result_9~0_4, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~ite2#1, thread1Thread1of1ForFork1_#t~ret1#1, thread1Thread1of1ForFork1_#t~ite3#1, thread1Thread1of1ForFork1_#t~ite4#1, thread1Thread1of1ForFork1_#t~ite5#1, thread1Thread1of1ForFork1_#res#1.offset, ~result_9~0, thread1Thread1of1ForFork1_#res#1.base][84], [130#true, Black: 60#(<= ~result_9~0 0), 24#thread2EXITtrue, Black: 94#true, Black: 62#(and (not (= (mod ~isNull_3~0 256) 0)) (<= ~result_9~0 0)), Black: 56#true, Black: 101#(not (= (mod ~isNull_0~0 256) 0)), 117#(= (mod ~isNull_6~0 256) 0), Black: 136#(and (<= ~result_10~0 0) (or (and (not (= (mod ~isNull_6~0 256) 0)) (= 0 |thread2Thread1of1ForFork0_#t~ite10#1|)) (and (= (mod ~isNull_6~0 256) 0) (= 1 |thread2Thread1of1ForFork0_#t~ite10#1|)))), 81#true, Black: 134#(<= ~result_10~0 0), Black: 73#(or (and (not (= (mod ~isNull_3~0 256) 0)) (= ~result_9~0 0)) (and (= ~result_9~0 1) (= (mod ~isNull_3~0 256) 0))), Black: 106#(<= (+ |thread2Thread1of1ForFork0_#t~ite9#1| 1) 0), 17#thread1EXITtrue, Black: 110#(and (<= (+ |thread2Thread1of1ForFork0_#t~ite9#1| 1) 0) (<= (+ 1 |thread2Thread1of1ForFork0_#t~ite10#1|) 0)), Black: 108#(<= (+ ~result_10~0 1) 0), 143#true, 39#L78true, 96#(= (mod ~isNull_0~0 256) 0), 58#(not (= (mod ~isNull_3~0 256) 0)), 48#L56-19true, Black: 85#(<= ~result_9~0 0), Black: 87#(and (<= ~result_9~0 0) (or (= |thread1Thread1of1ForFork1_#t~ite5#1| 0) (= (mod ~isNull_3~0 256) 0))), Black: 115#true]) [2025-02-08 01:12:50,152 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-02-08 01:12:50,152 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-02-08 01:12:50,152 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:12:50,152 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:12:50,154 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([487] L44-5-->thread1EXIT: Formula: (and (= v_~result_9~0_4 |v_thread1Thread1of1ForFork1_#t~ite5#1_3|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {thread1Thread1of1ForFork1_#t~ite5#1=|v_thread1Thread1of1ForFork1_#t~ite5#1_3|} OutVars{thread1Thread1of1ForFork1_#t~ite2#1=|v_thread1Thread1of1ForFork1_#t~ite2#1_1|, thread1Thread1of1ForFork1_#t~ret1#1=|v_thread1Thread1of1ForFork1_#t~ret1#1_1|, thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_1|, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_3|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|, ~result_9~0=v_~result_9~0_4, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~ite2#1, thread1Thread1of1ForFork1_#t~ret1#1, thread1Thread1of1ForFork1_#t~ite3#1, thread1Thread1of1ForFork1_#t~ite4#1, thread1Thread1of1ForFork1_#t~ite5#1, thread1Thread1of1ForFork1_#res#1.offset, ~result_9~0, thread1Thread1of1ForFork1_#res#1.base][84], [130#true, Black: 60#(<= ~result_9~0 0), 24#thread2EXITtrue, Black: 94#true, Black: 62#(and (not (= (mod ~isNull_3~0 256) 0)) (<= ~result_9~0 0)), 20#L56-7true, Black: 56#true, Black: 101#(not (= (mod ~isNull_0~0 256) 0)), 117#(= (mod ~isNull_6~0 256) 0), Black: 136#(and (<= ~result_10~0 0) (or (and (not (= (mod ~isNull_6~0 256) 0)) (= 0 |thread2Thread1of1ForFork0_#t~ite10#1|)) (and (= (mod ~isNull_6~0 256) 0) (= 1 |thread2Thread1of1ForFork0_#t~ite10#1|)))), 81#true, Black: 134#(<= ~result_10~0 0), Black: 73#(or (and (not (= (mod ~isNull_3~0 256) 0)) (= ~result_9~0 0)) (and (= ~result_9~0 1) (= (mod ~isNull_3~0 256) 0))), Black: 106#(<= (+ |thread2Thread1of1ForFork0_#t~ite9#1| 1) 0), 34#L77-1true, Black: 110#(and (<= (+ |thread2Thread1of1ForFork0_#t~ite9#1| 1) 0) (<= (+ 1 |thread2Thread1of1ForFork0_#t~ite10#1|) 0)), 17#thread1EXITtrue, Black: 108#(<= (+ ~result_10~0 1) 0), 143#true, 96#(= (mod ~isNull_0~0 256) 0), 58#(not (= (mod ~isNull_3~0 256) 0)), Black: 85#(<= ~result_9~0 0), Black: 87#(and (<= ~result_9~0 0) (or (= |thread1Thread1of1ForFork1_#t~ite5#1| 0) (= (mod ~isNull_3~0 256) 0))), Black: 115#true]) [2025-02-08 01:12:50,154 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-02-08 01:12:50,154 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-02-08 01:12:50,154 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:12:50,154 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:12:50,175 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([487] L44-5-->thread1EXIT: Formula: (and (= v_~result_9~0_4 |v_thread1Thread1of1ForFork1_#t~ite5#1_3|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {thread1Thread1of1ForFork1_#t~ite5#1=|v_thread1Thread1of1ForFork1_#t~ite5#1_3|} OutVars{thread1Thread1of1ForFork1_#t~ite2#1=|v_thread1Thread1of1ForFork1_#t~ite2#1_1|, thread1Thread1of1ForFork1_#t~ret1#1=|v_thread1Thread1of1ForFork1_#t~ret1#1_1|, thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_1|, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_3|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|, ~result_9~0=v_~result_9~0_4, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~ite2#1, thread1Thread1of1ForFork1_#t~ret1#1, thread1Thread1of1ForFork1_#t~ite3#1, thread1Thread1of1ForFork1_#t~ite4#1, thread1Thread1of1ForFork1_#t~ite5#1, thread1Thread1of1ForFork1_#res#1.offset, ~result_9~0, thread1Thread1of1ForFork1_#res#1.base][84], [130#true, 24#thread2EXITtrue, Black: 60#(<= ~result_9~0 0), Black: 94#true, Black: 62#(and (not (= (mod ~isNull_3~0 256) 0)) (<= ~result_9~0 0)), 20#L56-7true, Black: 56#true, Black: 101#(not (= (mod ~isNull_0~0 256) 0)), 117#(= (mod ~isNull_6~0 256) 0), Black: 136#(and (<= ~result_10~0 0) (or (and (not (= (mod ~isNull_6~0 256) 0)) (= 0 |thread2Thread1of1ForFork0_#t~ite10#1|)) (and (= (mod ~isNull_6~0 256) 0) (= 1 |thread2Thread1of1ForFork0_#t~ite10#1|)))), Black: 134#(<= ~result_10~0 0), 81#true, Black: 73#(or (and (not (= (mod ~isNull_3~0 256) 0)) (= ~result_9~0 0)) (and (= ~result_9~0 1) (= (mod ~isNull_3~0 256) 0))), Black: 106#(<= (+ |thread2Thread1of1ForFork0_#t~ite9#1| 1) 0), 17#thread1EXITtrue, Black: 110#(and (<= (+ |thread2Thread1of1ForFork0_#t~ite9#1| 1) 0) (<= (+ 1 |thread2Thread1of1ForFork0_#t~ite10#1|) 0)), Black: 108#(<= (+ ~result_10~0 1) 0), 143#true, 39#L78true, 96#(= (mod ~isNull_0~0 256) 0), 58#(not (= (mod ~isNull_3~0 256) 0)), Black: 85#(<= ~result_9~0 0), Black: 87#(and (<= ~result_9~0 0) (or (= |thread1Thread1of1ForFork1_#t~ite5#1| 0) (= (mod ~isNull_3~0 256) 0))), Black: 115#true]) [2025-02-08 01:12:50,175 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-02-08 01:12:50,175 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-08 01:12:50,175 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:12:50,175 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:12:50,176 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([487] L44-5-->thread1EXIT: Formula: (and (= v_~result_9~0_4 |v_thread1Thread1of1ForFork1_#t~ite5#1_3|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {thread1Thread1of1ForFork1_#t~ite5#1=|v_thread1Thread1of1ForFork1_#t~ite5#1_3|} OutVars{thread1Thread1of1ForFork1_#t~ite2#1=|v_thread1Thread1of1ForFork1_#t~ite2#1_1|, thread1Thread1of1ForFork1_#t~ret1#1=|v_thread1Thread1of1ForFork1_#t~ret1#1_1|, thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_1|, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_3|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|, ~result_9~0=v_~result_9~0_4, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~ite2#1, thread1Thread1of1ForFork1_#t~ret1#1, thread1Thread1of1ForFork1_#t~ite3#1, thread1Thread1of1ForFork1_#t~ite4#1, thread1Thread1of1ForFork1_#t~ite5#1, thread1Thread1of1ForFork1_#res#1.offset, ~result_9~0, thread1Thread1of1ForFork1_#res#1.base][84], [130#true, 24#thread2EXITtrue, Black: 60#(<= ~result_9~0 0), Black: 94#true, Black: 62#(and (not (= (mod ~isNull_3~0 256) 0)) (<= ~result_9~0 0)), Black: 56#true, Black: 101#(not (= (mod ~isNull_0~0 256) 0)), 41#L91true, 117#(= (mod ~isNull_6~0 256) 0), Black: 136#(and (<= ~result_10~0 0) (or (and (not (= (mod ~isNull_6~0 256) 0)) (= 0 |thread2Thread1of1ForFork0_#t~ite10#1|)) (and (= (mod ~isNull_6~0 256) 0) (= 1 |thread2Thread1of1ForFork0_#t~ite10#1|)))), 81#true, Black: 134#(<= ~result_10~0 0), Black: 73#(or (and (not (= (mod ~isNull_3~0 256) 0)) (= ~result_9~0 0)) (and (= ~result_9~0 1) (= (mod ~isNull_3~0 256) 0))), Black: 106#(<= (+ |thread2Thread1of1ForFork0_#t~ite9#1| 1) 0), 34#L77-1true, 17#thread1EXITtrue, Black: 110#(and (<= (+ |thread2Thread1of1ForFork0_#t~ite9#1| 1) 0) (<= (+ 1 |thread2Thread1of1ForFork0_#t~ite10#1|) 0)), Black: 108#(<= (+ ~result_10~0 1) 0), 143#true, 96#(= (mod ~isNull_0~0 256) 0), 58#(not (= (mod ~isNull_3~0 256) 0)), Black: 85#(<= ~result_9~0 0), Black: 87#(and (<= ~result_9~0 0) (or (= |thread1Thread1of1ForFork1_#t~ite5#1| 0) (= (mod ~isNull_3~0 256) 0))), Black: 115#true]) [2025-02-08 01:12:50,176 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-02-08 01:12:50,176 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:12:50,176 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-08 01:12:50,176 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:12:50,192 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([487] L44-5-->thread1EXIT: Formula: (and (= v_~result_9~0_4 |v_thread1Thread1of1ForFork1_#t~ite5#1_3|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {thread1Thread1of1ForFork1_#t~ite5#1=|v_thread1Thread1of1ForFork1_#t~ite5#1_3|} OutVars{thread1Thread1of1ForFork1_#t~ite2#1=|v_thread1Thread1of1ForFork1_#t~ite2#1_1|, thread1Thread1of1ForFork1_#t~ret1#1=|v_thread1Thread1of1ForFork1_#t~ret1#1_1|, thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_1|, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_3|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|, ~result_9~0=v_~result_9~0_4, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~ite2#1, thread1Thread1of1ForFork1_#t~ret1#1, thread1Thread1of1ForFork1_#t~ite3#1, thread1Thread1of1ForFork1_#t~ite4#1, thread1Thread1of1ForFork1_#t~ite5#1, thread1Thread1of1ForFork1_#res#1.offset, ~result_9~0, thread1Thread1of1ForFork1_#res#1.base][84], [130#true, 24#thread2EXITtrue, Black: 60#(<= ~result_9~0 0), Black: 94#true, Black: 62#(and (not (= (mod ~isNull_3~0 256) 0)) (<= ~result_9~0 0)), Black: 56#true, Black: 101#(not (= (mod ~isNull_0~0 256) 0)), 41#L91true, 117#(= (mod ~isNull_6~0 256) 0), Black: 136#(and (<= ~result_10~0 0) (or (and (not (= (mod ~isNull_6~0 256) 0)) (= 0 |thread2Thread1of1ForFork0_#t~ite10#1|)) (and (= (mod ~isNull_6~0 256) 0) (= 1 |thread2Thread1of1ForFork0_#t~ite10#1|)))), 81#true, Black: 134#(<= ~result_10~0 0), Black: 73#(or (and (not (= (mod ~isNull_3~0 256) 0)) (= ~result_9~0 0)) (and (= ~result_9~0 1) (= (mod ~isNull_3~0 256) 0))), Black: 106#(<= (+ |thread2Thread1of1ForFork0_#t~ite9#1| 1) 0), 17#thread1EXITtrue, Black: 110#(and (<= (+ |thread2Thread1of1ForFork0_#t~ite9#1| 1) 0) (<= (+ 1 |thread2Thread1of1ForFork0_#t~ite10#1|) 0)), Black: 108#(<= (+ ~result_10~0 1) 0), 143#true, 39#L78true, 96#(= (mod ~isNull_0~0 256) 0), 58#(not (= (mod ~isNull_3~0 256) 0)), Black: 85#(<= ~result_9~0 0), Black: 87#(and (<= ~result_9~0 0) (or (= |thread1Thread1of1ForFork1_#t~ite5#1| 0) (= (mod ~isNull_3~0 256) 0))), Black: 115#true]) [2025-02-08 01:12:50,192 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-02-08 01:12:50,192 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:12:50,192 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:12:50,193 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:12:50,212 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([487] L44-5-->thread1EXIT: Formula: (and (= v_~result_9~0_4 |v_thread1Thread1of1ForFork1_#t~ite5#1_3|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {thread1Thread1of1ForFork1_#t~ite5#1=|v_thread1Thread1of1ForFork1_#t~ite5#1_3|} OutVars{thread1Thread1of1ForFork1_#t~ite2#1=|v_thread1Thread1of1ForFork1_#t~ite2#1_1|, thread1Thread1of1ForFork1_#t~ret1#1=|v_thread1Thread1of1ForFork1_#t~ret1#1_1|, thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_1|, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_3|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|, ~result_9~0=v_~result_9~0_4, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~ite2#1, thread1Thread1of1ForFork1_#t~ret1#1, thread1Thread1of1ForFork1_#t~ite3#1, thread1Thread1of1ForFork1_#t~ite4#1, thread1Thread1of1ForFork1_#t~ite5#1, thread1Thread1of1ForFork1_#res#1.offset, ~result_9~0, thread1Thread1of1ForFork1_#res#1.base][84], [130#true, 24#thread2EXITtrue, Black: 60#(<= ~result_9~0 0), Black: 94#true, Black: 62#(and (not (= (mod ~isNull_3~0 256) 0)) (<= ~result_9~0 0)), Black: 56#true, Black: 101#(not (= (mod ~isNull_0~0 256) 0)), 117#(= (mod ~isNull_6~0 256) 0), Black: 136#(and (<= ~result_10~0 0) (or (and (not (= (mod ~isNull_6~0 256) 0)) (= 0 |thread2Thread1of1ForFork0_#t~ite10#1|)) (and (= (mod ~isNull_6~0 256) 0) (= 1 |thread2Thread1of1ForFork0_#t~ite10#1|)))), Black: 134#(<= ~result_10~0 0), 81#true, Black: 73#(or (and (not (= (mod ~isNull_3~0 256) 0)) (= ~result_9~0 0)) (and (= ~result_9~0 1) (= (mod ~isNull_3~0 256) 0))), Black: 106#(<= (+ |thread2Thread1of1ForFork0_#t~ite9#1| 1) 0), 38#thread3EXITtrue, Black: 110#(and (<= (+ |thread2Thread1of1ForFork0_#t~ite9#1| 1) 0) (<= (+ 1 |thread2Thread1of1ForFork0_#t~ite10#1|) 0)), 34#L77-1true, 17#thread1EXITtrue, Black: 108#(<= (+ ~result_10~0 1) 0), 143#true, 96#(= (mod ~isNull_0~0 256) 0), 58#(not (= (mod ~isNull_3~0 256) 0)), Black: 85#(<= ~result_9~0 0), Black: 87#(and (<= ~result_9~0 0) (or (= |thread1Thread1of1ForFork1_#t~ite5#1| 0) (= (mod ~isNull_3~0 256) 0))), Black: 115#true]) [2025-02-08 01:12:50,212 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-02-08 01:12:50,212 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 01:12:50,212 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 01:12:50,212 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:12:50,221 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([487] L44-5-->thread1EXIT: Formula: (and (= v_~result_9~0_4 |v_thread1Thread1of1ForFork1_#t~ite5#1_3|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {thread1Thread1of1ForFork1_#t~ite5#1=|v_thread1Thread1of1ForFork1_#t~ite5#1_3|} OutVars{thread1Thread1of1ForFork1_#t~ite2#1=|v_thread1Thread1of1ForFork1_#t~ite2#1_1|, thread1Thread1of1ForFork1_#t~ret1#1=|v_thread1Thread1of1ForFork1_#t~ret1#1_1|, thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_1|, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_3|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|, ~result_9~0=v_~result_9~0_4, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~ite2#1, thread1Thread1of1ForFork1_#t~ret1#1, thread1Thread1of1ForFork1_#t~ite3#1, thread1Thread1of1ForFork1_#t~ite4#1, thread1Thread1of1ForFork1_#t~ite5#1, thread1Thread1of1ForFork1_#res#1.offset, ~result_9~0, thread1Thread1of1ForFork1_#res#1.base][84], [130#true, 24#thread2EXITtrue, Black: 60#(<= ~result_9~0 0), Black: 94#true, Black: 62#(and (not (= (mod ~isNull_3~0 256) 0)) (<= ~result_9~0 0)), Black: 56#true, Black: 101#(not (= (mod ~isNull_0~0 256) 0)), 117#(= (mod ~isNull_6~0 256) 0), Black: 136#(and (<= ~result_10~0 0) (or (and (not (= (mod ~isNull_6~0 256) 0)) (= 0 |thread2Thread1of1ForFork0_#t~ite10#1|)) (and (= (mod ~isNull_6~0 256) 0) (= 1 |thread2Thread1of1ForFork0_#t~ite10#1|)))), Black: 134#(<= ~result_10~0 0), 81#true, Black: 73#(or (and (not (= (mod ~isNull_3~0 256) 0)) (= ~result_9~0 0)) (and (= ~result_9~0 1) (= (mod ~isNull_3~0 256) 0))), Black: 106#(<= (+ |thread2Thread1of1ForFork0_#t~ite9#1| 1) 0), 38#thread3EXITtrue, Black: 110#(and (<= (+ |thread2Thread1of1ForFork0_#t~ite9#1| 1) 0) (<= (+ 1 |thread2Thread1of1ForFork0_#t~ite10#1|) 0)), 17#thread1EXITtrue, Black: 108#(<= (+ ~result_10~0 1) 0), 143#true, 39#L78true, 96#(= (mod ~isNull_0~0 256) 0), 58#(not (= (mod ~isNull_3~0 256) 0)), Black: 85#(<= ~result_9~0 0), Black: 87#(and (<= ~result_9~0 0) (or (= |thread1Thread1of1ForFork1_#t~ite5#1| 0) (= (mod ~isNull_3~0 256) 0))), Black: 115#true]) [2025-02-08 01:12:50,221 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-02-08 01:12:50,221 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-02-08 01:12:50,221 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:12:50,221 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-02-08 01:12:50,232 INFO L124 PetriNetUnfolderBase]: 3615/6039 cut-off events. [2025-02-08 01:12:50,232 INFO L125 PetriNetUnfolderBase]: For 13777/14616 co-relation queries the response was YES. [2025-02-08 01:12:50,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18830 conditions, 6039 events. 3615/6039 cut-off events. For 13777/14616 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 44056 event pairs, 1439 based on Foata normal form. 223/5453 useless extension candidates. Maximal degree in co-relation 17273. Up to 2969 conditions per place. [2025-02-08 01:12:50,254 INFO L140 encePairwiseOnDemand]: 44/52 looper letters, 82 selfloop transitions, 11 changer transitions 40/156 dead transitions. [2025-02-08 01:12:50,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 156 transitions, 1153 flow [2025-02-08 01:12:50,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:12:50,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:12:50,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 211 transitions. [2025-02-08 01:12:50,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6762820512820513 [2025-02-08 01:12:50,259 INFO L175 Difference]: Start difference. First operand has 83 places, 74 transitions, 408 flow. Second operand 6 states and 211 transitions. [2025-02-08 01:12:50,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 156 transitions, 1153 flow [2025-02-08 01:12:50,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 156 transitions, 1142 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-02-08 01:12:50,297 INFO L231 Difference]: Finished difference. Result has 91 places, 78 transitions, 496 flow [2025-02-08 01:12:50,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=496, PETRI_PLACES=91, PETRI_TRANSITIONS=78} [2025-02-08 01:12:50,298 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 42 predicate places. [2025-02-08 01:12:50,298 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 78 transitions, 496 flow [2025-02-08 01:12:50,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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) [2025-02-08 01:12:50,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:12:50,299 INFO L206 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] [2025-02-08 01:12:50,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 01:12:50,299 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:12:50,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:12:50,300 INFO L85 PathProgramCache]: Analyzing trace with hash 964677466, now seen corresponding path program 3 times [2025-02-08 01:12:50,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:12:50,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242036446] [2025-02-08 01:12:50,300 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:12:50,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:12:50,308 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 1 equivalence classes. [2025-02-08 01:12:50,314 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:12:50,314 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:12:50,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:12:50,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:12:50,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:12:50,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242036446] [2025-02-08 01:12:50,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242036446] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:12:50,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:12:50,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:12:50,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215164082] [2025-02-08 01:12:50,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:12:50,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:12:50,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:12:50,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:12:50,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:12:50,431 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 52 [2025-02-08 01:12:50,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 78 transitions, 496 flow. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:12:50,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:12:50,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 52 [2025-02-08 01:12:50,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:12:50,921 INFO L124 PetriNetUnfolderBase]: 2734/4586 cut-off events. [2025-02-08 01:12:50,922 INFO L125 PetriNetUnfolderBase]: For 15529/16277 co-relation queries the response was YES. [2025-02-08 01:12:50,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15489 conditions, 4586 events. 2734/4586 cut-off events. For 15529/16277 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 33071 event pairs, 1205 based on Foata normal form. 108/3919 useless extension candidates. Maximal degree in co-relation 13851. Up to 2561 conditions per place. [2025-02-08 01:12:50,940 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 84 selfloop transitions, 12 changer transitions 14/137 dead transitions. [2025-02-08 01:12:50,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 137 transitions, 980 flow [2025-02-08 01:12:50,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:12:50,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:12:50,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 212 transitions. [2025-02-08 01:12:50,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6794871794871795 [2025-02-08 01:12:50,942 INFO L175 Difference]: Start difference. First operand has 91 places, 78 transitions, 496 flow. Second operand 6 states and 212 transitions. [2025-02-08 01:12:50,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 137 transitions, 980 flow [2025-02-08 01:12:50,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 137 transitions, 974 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-08 01:12:50,980 INFO L231 Difference]: Finished difference. Result has 95 places, 78 transitions, 517 flow [2025-02-08 01:12:50,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=517, PETRI_PLACES=95, PETRI_TRANSITIONS=78} [2025-02-08 01:12:50,981 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 46 predicate places. [2025-02-08 01:12:50,981 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 78 transitions, 517 flow [2025-02-08 01:12:50,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:12:50,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:12:50,982 INFO L206 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] [2025-02-08 01:12:50,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 01:12:50,982 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:12:50,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:12:50,982 INFO L85 PathProgramCache]: Analyzing trace with hash 233185486, now seen corresponding path program 2 times [2025-02-08 01:12:50,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:12:50,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850039899] [2025-02-08 01:12:50,983 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:12:50,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:12:50,989 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-02-08 01:12:50,993 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:12:50,993 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:12:50,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:12:51,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:12:51,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:12:51,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850039899] [2025-02-08 01:12:51,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850039899] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:12:51,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:12:51,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:12:51,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839129554] [2025-02-08 01:12:51,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:12:51,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:12:51,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:12:51,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:12:51,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:12:51,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 52 [2025-02-08 01:12:51,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 78 transitions, 517 flow. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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) [2025-02-08 01:12:51,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:12:51,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 52 [2025-02-08 01:12:51,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:12:51,564 INFO L124 PetriNetUnfolderBase]: 3496/6039 cut-off events. [2025-02-08 01:12:51,565 INFO L125 PetriNetUnfolderBase]: For 24544/25585 co-relation queries the response was YES. [2025-02-08 01:12:51,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20798 conditions, 6039 events. 3496/6039 cut-off events. For 24544/25585 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 45343 event pairs, 1849 based on Foata normal form. 136/5483 useless extension candidates. Maximal degree in co-relation 20403. Up to 4243 conditions per place. [2025-02-08 01:12:51,580 INFO L140 encePairwiseOnDemand]: 44/52 looper letters, 60 selfloop transitions, 11 changer transitions 36/131 dead transitions. [2025-02-08 01:12:51,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 131 transitions, 1093 flow [2025-02-08 01:12:51,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:12:51,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:12:51,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2025-02-08 01:12:51,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6384615384615384 [2025-02-08 01:12:51,582 INFO L175 Difference]: Start difference. First operand has 95 places, 78 transitions, 517 flow. Second operand 5 states and 166 transitions. [2025-02-08 01:12:51,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 131 transitions, 1093 flow [2025-02-08 01:12:51,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 131 transitions, 1057 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 01:12:51,653 INFO L231 Difference]: Finished difference. Result has 100 places, 83 transitions, 582 flow [2025-02-08 01:12:51,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=582, PETRI_PLACES=100, PETRI_TRANSITIONS=83} [2025-02-08 01:12:51,654 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 51 predicate places. [2025-02-08 01:12:51,654 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 83 transitions, 582 flow [2025-02-08 01:12:51,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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) [2025-02-08 01:12:51,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:12:51,654 INFO L206 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] [2025-02-08 01:12:51,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 01:12:51,654 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:12:51,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:12:51,655 INFO L85 PathProgramCache]: Analyzing trace with hash -27652446, now seen corresponding path program 3 times [2025-02-08 01:12:51,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:12:51,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781445993] [2025-02-08 01:12:51,655 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:12:51,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:12:51,667 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 1 equivalence classes. [2025-02-08 01:12:51,675 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:12:51,675 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:12:51,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:12:51,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:12:51,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:12:51,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781445993] [2025-02-08 01:12:51,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781445993] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:12:51,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:12:51,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:12:51,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726077356] [2025-02-08 01:12:51,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:12:51,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:12:51,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:12:51,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:12:51,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:12:51,816 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 52 [2025-02-08 01:12:51,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 83 transitions, 582 flow. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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) [2025-02-08 01:12:51,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:12:51,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 52 [2025-02-08 01:12:51,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:12:52,203 INFO L124 PetriNetUnfolderBase]: 3401/5874 cut-off events. [2025-02-08 01:12:52,203 INFO L125 PetriNetUnfolderBase]: For 23895/24989 co-relation queries the response was YES. [2025-02-08 01:12:52,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21746 conditions, 5874 events. 3401/5874 cut-off events. For 23895/24989 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 44001 event pairs, 1625 based on Foata normal form. 146/5367 useless extension candidates. Maximal degree in co-relation 21688. Up to 3561 conditions per place. [2025-02-08 01:12:52,224 INFO L140 encePairwiseOnDemand]: 44/52 looper letters, 54 selfloop transitions, 11 changer transitions 60/149 dead transitions. [2025-02-08 01:12:52,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 149 transitions, 1344 flow [2025-02-08 01:12:52,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:12:52,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:12:52,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2025-02-08 01:12:52,227 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6282051282051282 [2025-02-08 01:12:52,227 INFO L175 Difference]: Start difference. First operand has 100 places, 83 transitions, 582 flow. Second operand 6 states and 196 transitions. [2025-02-08 01:12:52,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 149 transitions, 1344 flow [2025-02-08 01:12:52,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 149 transitions, 1302 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-08 01:12:52,281 INFO L231 Difference]: Finished difference. Result has 101 places, 78 transitions, 519 flow [2025-02-08 01:12:52,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=519, PETRI_PLACES=101, PETRI_TRANSITIONS=78} [2025-02-08 01:12:52,282 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 52 predicate places. [2025-02-08 01:12:52,283 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 78 transitions, 519 flow [2025-02-08 01:12:52,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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) [2025-02-08 01:12:52,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:12:52,283 INFO L206 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] [2025-02-08 01:12:52,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 01:12:52,283 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:12:52,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:12:52,283 INFO L85 PathProgramCache]: Analyzing trace with hash 104128315, now seen corresponding path program 1 times [2025-02-08 01:12:52,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:12:52,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466634991] [2025-02-08 01:12:52,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:12:52,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:12:52,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 01:12:52,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 01:12:52,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:12:52,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:12:52,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:12:52,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:12:52,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466634991] [2025-02-08 01:12:52,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466634991] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:12:52,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:12:52,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:12:52,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907889587] [2025-02-08 01:12:52,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:12:52,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:12:52,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:12:52,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:12:52,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:12:52,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 52 [2025-02-08 01:12:52,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 78 transitions, 519 flow. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 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) [2025-02-08 01:12:52,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:12:52,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 52 [2025-02-08 01:12:52,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:12:52,713 INFO L124 PetriNetUnfolderBase]: 3069/5114 cut-off events. [2025-02-08 01:12:52,713 INFO L125 PetriNetUnfolderBase]: For 17662/18581 co-relation queries the response was YES. [2025-02-08 01:12:52,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18506 conditions, 5114 events. 3069/5114 cut-off events. For 17662/18581 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 37306 event pairs, 1516 based on Foata normal form. 270/4585 useless extension candidates. Maximal degree in co-relation 18456. Up to 3185 conditions per place. [2025-02-08 01:12:52,728 INFO L140 encePairwiseOnDemand]: 48/52 looper letters, 66 selfloop transitions, 3 changer transitions 77/172 dead transitions. [2025-02-08 01:12:52,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 172 transitions, 1504 flow [2025-02-08 01:12:52,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:12:52,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:12:52,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2025-02-08 01:12:52,730 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2025-02-08 01:12:52,730 INFO L175 Difference]: Start difference. First operand has 101 places, 78 transitions, 519 flow. Second operand 5 states and 182 transitions. [2025-02-08 01:12:52,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 172 transitions, 1504 flow [2025-02-08 01:12:52,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 172 transitions, 1369 flow, removed 40 selfloop flow, removed 6 redundant places. [2025-02-08 01:12:52,772 INFO L231 Difference]: Finished difference. Result has 96 places, 73 transitions, 442 flow [2025-02-08 01:12:52,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=442, PETRI_PLACES=96, PETRI_TRANSITIONS=73} [2025-02-08 01:12:52,774 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 47 predicate places. [2025-02-08 01:12:52,774 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 73 transitions, 442 flow [2025-02-08 01:12:52,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 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) [2025-02-08 01:12:52,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:12:52,774 INFO L206 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] [2025-02-08 01:12:52,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 01:12:52,774 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:12:52,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:12:52,775 INFO L85 PathProgramCache]: Analyzing trace with hash -543849930, now seen corresponding path program 1 times [2025-02-08 01:12:52,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:12:52,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736357986] [2025-02-08 01:12:52,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:12:52,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:12:52,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 01:12:52,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 01:12:52,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:12:52,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:12:52,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:12:52,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:12:52,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736357986] [2025-02-08 01:12:52,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736357986] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:12:52,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:12:52,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:12:52,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105122263] [2025-02-08 01:12:52,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:12:52,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:12:52,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:12:52,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:12:52,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:12:52,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 52 [2025-02-08 01:12:52,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 73 transitions, 442 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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) [2025-02-08 01:12:52,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:12:52,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 52 [2025-02-08 01:12:52,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:12:52,948 INFO L124 PetriNetUnfolderBase]: 1502/2715 cut-off events. [2025-02-08 01:12:52,948 INFO L125 PetriNetUnfolderBase]: For 8355/8734 co-relation queries the response was YES. [2025-02-08 01:12:52,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8723 conditions, 2715 events. 1502/2715 cut-off events. For 8355/8734 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 18494 event pairs, 506 based on Foata normal form. 273/2629 useless extension candidates. Maximal degree in co-relation 8696. Up to 2061 conditions per place. [2025-02-08 01:12:52,958 INFO L140 encePairwiseOnDemand]: 48/52 looper letters, 53 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2025-02-08 01:12:52,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 78 transitions, 525 flow [2025-02-08 01:12:52,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:12:52,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:12:52,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2025-02-08 01:12:52,959 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6538461538461539 [2025-02-08 01:12:52,959 INFO L175 Difference]: Start difference. First operand has 96 places, 73 transitions, 442 flow. Second operand 3 states and 102 transitions. [2025-02-08 01:12:52,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 78 transitions, 525 flow [2025-02-08 01:12:52,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 78 transitions, 496 flow, removed 5 selfloop flow, removed 8 redundant places. [2025-02-08 01:12:52,969 INFO L231 Difference]: Finished difference. Result has 85 places, 67 transitions, 356 flow [2025-02-08 01:12:52,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=356, PETRI_PLACES=85, PETRI_TRANSITIONS=67} [2025-02-08 01:12:52,970 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 36 predicate places. [2025-02-08 01:12:52,971 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 67 transitions, 356 flow [2025-02-08 01:12:52,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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) [2025-02-08 01:12:52,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:12:52,971 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:12:52,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 01:12:52,972 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:12:52,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:12:52,972 INFO L85 PathProgramCache]: Analyzing trace with hash 36993828, now seen corresponding path program 1 times [2025-02-08 01:12:52,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:12:52,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288244756] [2025-02-08 01:12:52,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:12:52,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:12:52,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 01:12:52,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:12:52,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:12:52,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:12:53,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:12:53,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:12:53,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288244756] [2025-02-08 01:12:53,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288244756] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:12:53,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:12:53,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:12:53,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60132779] [2025-02-08 01:12:53,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:12:53,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:12:53,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:12:53,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:12:53,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:12:53,092 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 52 [2025-02-08 01:12:53,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 67 transitions, 356 flow. Second operand has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:12:53,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:12:53,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 52 [2025-02-08 01:12:53,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:12:53,636 INFO L124 PetriNetUnfolderBase]: 3033/5251 cut-off events. [2025-02-08 01:12:53,637 INFO L125 PetriNetUnfolderBase]: For 9777/10166 co-relation queries the response was YES. [2025-02-08 01:12:53,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15054 conditions, 5251 events. 3033/5251 cut-off events. For 9777/10166 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 39889 event pairs, 817 based on Foata normal form. 107/4452 useless extension candidates. Maximal degree in co-relation 15032. Up to 1508 conditions per place. [2025-02-08 01:12:53,654 INFO L140 encePairwiseOnDemand]: 43/52 looper letters, 113 selfloop transitions, 15 changer transitions 66/220 dead transitions. [2025-02-08 01:12:53,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 220 transitions, 1454 flow [2025-02-08 01:12:53,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 01:12:53,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 01:12:53,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 334 transitions. [2025-02-08 01:12:53,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6423076923076924 [2025-02-08 01:12:53,656 INFO L175 Difference]: Start difference. First operand has 85 places, 67 transitions, 356 flow. Second operand 10 states and 334 transitions. [2025-02-08 01:12:53,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 220 transitions, 1454 flow [2025-02-08 01:12:53,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 220 transitions, 1448 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-08 01:12:53,690 INFO L231 Difference]: Finished difference. Result has 99 places, 79 transitions, 461 flow [2025-02-08 01:12:53,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=461, PETRI_PLACES=99, PETRI_TRANSITIONS=79} [2025-02-08 01:12:53,691 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 50 predicate places. [2025-02-08 01:12:53,691 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 79 transitions, 461 flow [2025-02-08 01:12:53,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:12:53,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:12:53,691 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:12:53,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 01:12:53,691 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:12:53,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:12:53,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1864972764, now seen corresponding path program 2 times [2025-02-08 01:12:53,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:12:53,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262176917] [2025-02-08 01:12:53,692 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:12:53,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:12:53,699 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 1 equivalence classes. [2025-02-08 01:12:53,702 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:12:53,704 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:12:53,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:12:53,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:12:53,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:12:53,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262176917] [2025-02-08 01:12:53,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262176917] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:12:53,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:12:53,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:12:53,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815545860] [2025-02-08 01:12:53,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:12:53,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:12:53,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:12:53,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:12:53,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:12:53,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 52 [2025-02-08 01:12:53,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 79 transitions, 461 flow. Second operand has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:12:53,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:12:53,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 52 [2025-02-08 01:12:53,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:12:54,250 INFO L124 PetriNetUnfolderBase]: 3341/6011 cut-off events. [2025-02-08 01:12:54,250 INFO L125 PetriNetUnfolderBase]: For 14866/15399 co-relation queries the response was YES. [2025-02-08 01:12:54,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19696 conditions, 6011 events. 3341/6011 cut-off events. For 14866/15399 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 48692 event pairs, 967 based on Foata normal form. 207/5384 useless extension candidates. Maximal degree in co-relation 19668. Up to 1695 conditions per place. [2025-02-08 01:12:54,271 INFO L140 encePairwiseOnDemand]: 43/52 looper letters, 103 selfloop transitions, 11 changer transitions 84/224 dead transitions. [2025-02-08 01:12:54,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 224 transitions, 1643 flow [2025-02-08 01:12:54,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:12:54,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:12:54,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 284 transitions. [2025-02-08 01:12:54,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6826923076923077 [2025-02-08 01:12:54,272 INFO L175 Difference]: Start difference. First operand has 99 places, 79 transitions, 461 flow. Second operand 8 states and 284 transitions. [2025-02-08 01:12:54,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 224 transitions, 1643 flow [2025-02-08 01:12:54,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 224 transitions, 1628 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-08 01:12:54,323 INFO L231 Difference]: Finished difference. Result has 108 places, 80 transitions, 511 flow [2025-02-08 01:12:54,323 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=511, PETRI_PLACES=108, PETRI_TRANSITIONS=80} [2025-02-08 01:12:54,323 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 59 predicate places. [2025-02-08 01:12:54,323 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 80 transitions, 511 flow [2025-02-08 01:12:54,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:12:54,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:12:54,324 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:12:54,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 01:12:54,324 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:12:54,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:12:54,324 INFO L85 PathProgramCache]: Analyzing trace with hash -810208944, now seen corresponding path program 3 times [2025-02-08 01:12:54,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:12:54,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398650023] [2025-02-08 01:12:54,325 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:12:54,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:12:54,329 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 1 equivalence classes. [2025-02-08 01:12:54,331 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:12:54,331 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:12:54,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:12:54,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:12:54,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:12:54,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398650023] [2025-02-08 01:12:54,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398650023] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:12:54,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:12:54,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:12:54,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423487848] [2025-02-08 01:12:54,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:12:54,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:12:54,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:12:54,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:12:54,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:12:54,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 52 [2025-02-08 01:12:54,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 80 transitions, 511 flow. Second operand has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:12:54,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:12:54,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 52 [2025-02-08 01:12:54,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:12:54,923 INFO L124 PetriNetUnfolderBase]: 2630/4862 cut-off events. [2025-02-08 01:12:54,923 INFO L125 PetriNetUnfolderBase]: For 16949/17449 co-relation queries the response was YES. [2025-02-08 01:12:54,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17107 conditions, 4862 events. 2630/4862 cut-off events. For 16949/17449 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 39434 event pairs, 654 based on Foata normal form. 146/4329 useless extension candidates. Maximal degree in co-relation 17075. Up to 1223 conditions per place. [2025-02-08 01:12:54,937 INFO L140 encePairwiseOnDemand]: 44/52 looper letters, 92 selfloop transitions, 12 changer transitions 78/208 dead transitions. [2025-02-08 01:12:54,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 208 transitions, 1571 flow [2025-02-08 01:12:54,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:12:54,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:12:54,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 276 transitions. [2025-02-08 01:12:54,938 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6634615384615384 [2025-02-08 01:12:54,938 INFO L175 Difference]: Start difference. First operand has 108 places, 80 transitions, 511 flow. Second operand 8 states and 276 transitions. [2025-02-08 01:12:54,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 208 transitions, 1571 flow [2025-02-08 01:12:54,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 208 transitions, 1553 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-02-08 01:12:54,982 INFO L231 Difference]: Finished difference. Result has 113 places, 76 transitions, 491 flow [2025-02-08 01:12:54,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=491, PETRI_PLACES=113, PETRI_TRANSITIONS=76} [2025-02-08 01:12:54,983 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 64 predicate places. [2025-02-08 01:12:54,983 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 76 transitions, 491 flow [2025-02-08 01:12:54,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:12:54,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:12:54,983 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:12:54,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 01:12:54,983 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:12:54,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:12:54,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1463141040, now seen corresponding path program 4 times [2025-02-08 01:12:54,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:12:54,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609681480] [2025-02-08 01:12:54,984 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:12:54,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:12:54,989 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:12:54,991 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:12:54,991 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:12:54,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:12:55,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:12:55,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:12:55,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609681480] [2025-02-08 01:12:55,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609681480] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:12:55,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:12:55,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:12:55,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641860576] [2025-02-08 01:12:55,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:12:55,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:12:55,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:12:55,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:12:55,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:12:55,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 52 [2025-02-08 01:12:55,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 76 transitions, 491 flow. Second operand has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 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) [2025-02-08 01:12:55,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:12:55,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 52 [2025-02-08 01:12:55,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:12:55,448 INFO L124 PetriNetUnfolderBase]: 1979/3680 cut-off events. [2025-02-08 01:12:55,448 INFO L125 PetriNetUnfolderBase]: For 12637/13041 co-relation queries the response was YES. [2025-02-08 01:12:55,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12712 conditions, 3680 events. 1979/3680 cut-off events. For 12637/13041 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 28815 event pairs, 469 based on Foata normal form. 108/3247 useless extension candidates. Maximal degree in co-relation 12679. Up to 987 conditions per place. [2025-02-08 01:12:55,462 INFO L140 encePairwiseOnDemand]: 44/52 looper letters, 77 selfloop transitions, 8 changer transitions 58/174 dead transitions. [2025-02-08 01:12:55,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 174 transitions, 1291 flow [2025-02-08 01:12:55,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:12:55,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:12:55,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 261 transitions. [2025-02-08 01:12:55,467 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6274038461538461 [2025-02-08 01:12:55,467 INFO L175 Difference]: Start difference. First operand has 113 places, 76 transitions, 491 flow. Second operand 8 states and 261 transitions. [2025-02-08 01:12:55,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 174 transitions, 1291 flow [2025-02-08 01:12:55,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 174 transitions, 1241 flow, removed 7 selfloop flow, removed 10 redundant places. [2025-02-08 01:12:55,508 INFO L231 Difference]: Finished difference. Result has 112 places, 77 transitions, 491 flow [2025-02-08 01:12:55,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=491, PETRI_PLACES=112, PETRI_TRANSITIONS=77} [2025-02-08 01:12:55,509 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 63 predicate places. [2025-02-08 01:12:55,509 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 77 transitions, 491 flow [2025-02-08 01:12:55,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 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) [2025-02-08 01:12:55,509 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:12:55,509 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:12:55,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 01:12:55,510 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:12:55,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:12:55,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1083368872, now seen corresponding path program 5 times [2025-02-08 01:12:55,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:12:55,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407474664] [2025-02-08 01:12:55,510 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:12:55,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:12:55,515 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 1 equivalence classes. [2025-02-08 01:12:55,517 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:12:55,517 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:12:55,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:12:55,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:12:55,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:12:55,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407474664] [2025-02-08 01:12:55,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407474664] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:12:55,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:12:55,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:12:55,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18173418] [2025-02-08 01:12:55,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:12:55,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:12:55,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:12:55,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:12:55,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:12:55,607 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 52 [2025-02-08 01:12:55,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 77 transitions, 491 flow. Second operand has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 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) [2025-02-08 01:12:55,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:12:55,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 52 [2025-02-08 01:12:55,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:12:55,969 INFO L124 PetriNetUnfolderBase]: 1851/3507 cut-off events. [2025-02-08 01:12:55,969 INFO L125 PetriNetUnfolderBase]: For 13408/13771 co-relation queries the response was YES. [2025-02-08 01:12:55,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12212 conditions, 3507 events. 1851/3507 cut-off events. For 13408/13771 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 27577 event pairs, 541 based on Foata normal form. 98/3086 useless extension candidates. Maximal degree in co-relation 12180. Up to 935 conditions per place. [2025-02-08 01:12:55,982 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 70 selfloop transitions, 7 changer transitions 59/167 dead transitions. [2025-02-08 01:12:55,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 167 transitions, 1230 flow [2025-02-08 01:12:55,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:12:55,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:12:55,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 233 transitions. [2025-02-08 01:12:55,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6401098901098901 [2025-02-08 01:12:55,983 INFO L175 Difference]: Start difference. First operand has 112 places, 77 transitions, 491 flow. Second operand 7 states and 233 transitions. [2025-02-08 01:12:55,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 167 transitions, 1230 flow [2025-02-08 01:12:56,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 167 transitions, 1208 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-02-08 01:12:56,008 INFO L231 Difference]: Finished difference. Result has 113 places, 75 transitions, 469 flow [2025-02-08 01:12:56,009 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=469, PETRI_PLACES=113, PETRI_TRANSITIONS=75} [2025-02-08 01:12:56,009 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 64 predicate places. [2025-02-08 01:12:56,009 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 75 transitions, 469 flow [2025-02-08 01:12:56,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 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) [2025-02-08 01:12:56,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:12:56,009 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:12:56,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 01:12:56,009 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:12:56,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:12:56,010 INFO L85 PathProgramCache]: Analyzing trace with hash 426761610, now seen corresponding path program 1 times [2025-02-08 01:12:56,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:12:56,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678284937] [2025-02-08 01:12:56,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:12:56,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:12:56,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 01:12:56,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 01:12:56,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:12:56,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:12:56,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:12:56,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:12:56,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678284937] [2025-02-08 01:12:56,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678284937] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:12:56,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:12:56,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:12:56,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850289502] [2025-02-08 01:12:56,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:12:56,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:12:56,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:12:56,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:12:56,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:12:56,067 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 52 [2025-02-08 01:12:56,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 75 transitions, 469 flow. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:12:56,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:12:56,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 52 [2025-02-08 01:12:56,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:12:56,531 INFO L124 PetriNetUnfolderBase]: 2121/3695 cut-off events. [2025-02-08 01:12:56,531 INFO L125 PetriNetUnfolderBase]: For 15414/15931 co-relation queries the response was YES. [2025-02-08 01:12:56,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12662 conditions, 3695 events. 2121/3695 cut-off events. For 15414/15931 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 27378 event pairs, 540 based on Foata normal form. 135/3155 useless extension candidates. Maximal degree in co-relation 12630. Up to 1159 conditions per place. [2025-02-08 01:12:56,545 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 0 selfloop transitions, 0 changer transitions 146/146 dead transitions. [2025-02-08 01:12:56,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 146 transitions, 1145 flow [2025-02-08 01:12:56,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:12:56,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:12:56,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 252 transitions. [2025-02-08 01:12:56,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6057692307692307 [2025-02-08 01:12:56,547 INFO L175 Difference]: Start difference. First operand has 113 places, 75 transitions, 469 flow. Second operand 8 states and 252 transitions. [2025-02-08 01:12:56,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 146 transitions, 1145 flow [2025-02-08 01:12:56,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 146 transitions, 1034 flow, removed 3 selfloop flow, removed 10 redundant places. [2025-02-08 01:12:56,570 INFO L231 Difference]: Finished difference. Result has 104 places, 0 transitions, 0 flow [2025-02-08 01:12:56,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=104, PETRI_TRANSITIONS=0} [2025-02-08 01:12:56,571 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 55 predicate places. [2025-02-08 01:12:56,571 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 0 transitions, 0 flow [2025-02-08 01:12:56,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:12:56,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-02-08 01:12:56,577 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-02-08 01:12:56,577 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-02-08 01:12:56,577 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-02-08 01:12:56,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 01:12:56,577 INFO L422 BasicCegarLoop]: Path program histogram: [5, 3, 3, 3, 2, 1, 1, 1, 1] [2025-02-08 01:12:56,582 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 01:12:56,585 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 01:12:56,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 01:12:56 BasicIcfg [2025-02-08 01:12:56,594 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 01:12:56,595 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 01:12:56,595 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 01:12:56,595 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 01:12:56,595 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:12:44" (3/4) ... [2025-02-08 01:12:56,597 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 01:12:56,603 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 01:12:56,603 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 01:12:56,603 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 01:12:56,611 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 56 nodes and edges [2025-02-08 01:12:56,611 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2025-02-08 01:12:56,611 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-02-08 01:12:56,611 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 01:12:56,663 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 01:12:56,663 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 01:12:56,663 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 01:12:56,664 INFO L158 Benchmark]: Toolchain (without parser) took 12875.85ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 133.4MB in the beginning and 1.0GB in the end (delta: -895.1MB). Peak memory consumption was 219.4MB. Max. memory is 16.1GB. [2025-02-08 01:12:56,664 INFO L158 Benchmark]: CDTParser took 3.69ms. Allocated memory is still 226.5MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:12:56,664 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.52ms. Allocated memory is still 167.8MB. Free memory was 133.4MB in the beginning and 121.4MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 01:12:56,664 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.68ms. Allocated memory is still 167.8MB. Free memory was 121.4MB in the beginning and 119.5MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 01:12:56,664 INFO L158 Benchmark]: Boogie Preprocessor took 33.40ms. Allocated memory is still 167.8MB. Free memory was 119.5MB in the beginning and 117.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:12:56,664 INFO L158 Benchmark]: IcfgBuilder took 569.13ms. Allocated memory is still 167.8MB. Free memory was 117.6MB in the beginning and 67.3MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-08 01:12:56,665 INFO L158 Benchmark]: TraceAbstraction took 12004.06ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 66.8MB in the beginning and 1.0GB in the end (delta: -966.2MB). Peak memory consumption was 143.9MB. Max. memory is 16.1GB. [2025-02-08 01:12:56,665 INFO L158 Benchmark]: Witness Printer took 68.54ms. Allocated memory is still 1.3GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 01:12:56,666 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.69ms. Allocated memory is still 226.5MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 167.52ms. Allocated memory is still 167.8MB. Free memory was 133.4MB in the beginning and 121.4MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.68ms. Allocated memory is still 167.8MB. Free memory was 121.4MB in the beginning and 119.5MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.40ms. Allocated memory is still 167.8MB. Free memory was 119.5MB in the beginning and 117.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 569.13ms. Allocated memory is still 167.8MB. Free memory was 117.6MB in the beginning and 67.3MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 12004.06ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 66.8MB in the beginning and 1.0GB in the end (delta: -966.2MB). Peak memory consumption was 143.9MB. Max. memory is 16.1GB. * Witness Printer took 68.54ms. Allocated memory is still 1.3GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 83]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 77 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.9s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1361 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1308 mSDsluCounter, 140 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 101 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4314 IncrementalHoareTripleChecker+Invalid, 4384 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 39 mSDtfsCounter, 4314 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 191 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=582occurred in iteration=11, InterpolantAutomatonStates: 119, 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.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 537 NumberOfCodeBlocks, 537 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 517 ConstructedInterpolants, 0 QuantifiedInterpolants, 1945 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 01:12:56,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE