./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-word-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc 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-word-subst.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c6ecf58df9dd6f4f380af0d7ef563f293bde5430d47e04b9ba5ac44168fc198 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:49:42,232 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:49:42,282 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 18:49:42,289 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:49:42,293 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:49:42,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:49:42,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:49:42,321 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:49:42,321 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:49:42,321 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:49:42,321 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:49:42,321 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:49:42,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:49:42,322 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:49:42,322 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:49:42,322 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:49:42,322 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:49:42,322 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 18:49:42,322 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:49:42,322 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 18:49:42,322 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:49:42,322 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:49:42,322 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:49:42,322 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:49:42,322 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:49:42,322 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:49:42,322 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 18:49:42,322 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:49:42,322 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:49:42,322 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:49:42,322 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:49:42,323 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:49:42,323 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:49:42,323 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:49:42,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:49:42,323 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:49:42,323 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:49:42,323 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:49:42,323 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:49:42,323 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:49:42,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:49:42,323 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:49:42,323 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:49:42,323 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:49:42,323 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:49:42,323 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 ! overflow) ) 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 -> 1c6ecf58df9dd6f4f380af0d7ef563f293bde5430d47e04b9ba5ac44168fc198 [2025-02-06 18:49:42,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:49:42,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:49:42,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:49:42,529 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:49:42,529 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:49:42,530 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-word-subst.wvr.c [2025-02-06 18:49:43,595 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bc3be7fac/8d208f8247004463a3d1cb6fc53d61d6/FLAG9448936e9 [2025-02-06 18:49:43,831 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:49:43,831 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-subst.wvr.c [2025-02-06 18:49:43,842 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bc3be7fac/8d208f8247004463a3d1cb6fc53d61d6/FLAG9448936e9 [2025-02-06 18:49:44,155 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bc3be7fac/8d208f8247004463a3d1cb6fc53d61d6 [2025-02-06 18:49:44,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:49:44,157 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:49:44,158 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:49:44,160 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:49:44,163 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:49:44,164 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:49:44" (1/1) ... [2025-02-06 18:49:44,171 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48dace18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:44, skipping insertion in model container [2025-02-06 18:49:44,172 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:49:44" (1/1) ... [2025-02-06 18:49:44,191 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:49:44,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:49:44,330 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:49:44,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:49:44,373 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:49:44,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:44 WrapperNode [2025-02-06 18:49:44,374 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:49:44,374 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:49:44,375 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:49:44,375 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:49:44,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:44" (1/1) ... [2025-02-06 18:49:44,385 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:44" (1/1) ... [2025-02-06 18:49:44,402 INFO L138 Inliner]: procedures = 24, calls = 31, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 168 [2025-02-06 18:49:44,402 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:49:44,402 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:49:44,402 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:49:44,405 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:49:44,411 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:44" (1/1) ... [2025-02-06 18:49:44,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:44" (1/1) ... [2025-02-06 18:49:44,413 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:44" (1/1) ... [2025-02-06 18:49:44,429 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-02-06 18:49:44,429 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:44" (1/1) ... [2025-02-06 18:49:44,429 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:44" (1/1) ... [2025-02-06 18:49:44,438 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:44" (1/1) ... [2025-02-06 18:49:44,439 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:44" (1/1) ... [2025-02-06 18:49:44,440 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:44" (1/1) ... [2025-02-06 18:49:44,441 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:44" (1/1) ... [2025-02-06 18:49:44,444 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:49:44,445 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:49:44,445 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:49:44,446 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:49:44,446 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:44" (1/1) ... [2025-02-06 18:49:44,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:49:44,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:49:44,483 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-06 18:49:44,493 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-06 18:49:44,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:49:44,515 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 18:49:44,515 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 18:49:44,515 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 18:49:44,515 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 18:49:44,515 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 18:49:44,516 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 18:49:44,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 18:49:44,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 18:49:44,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 18:49:44,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 18:49:44,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 18:49:44,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:49:44,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:49:44,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 18:49:44,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 18:49:44,517 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 18:49:44,602 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:49:44,603 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:49:44,888 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 18:49:44,889 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:49:45,060 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:49:45,061 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 18:49:45,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:49:45 BoogieIcfgContainer [2025-02-06 18:49:45,061 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:49:45,063 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:49:45,063 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:49:45,066 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:49:45,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:49:44" (1/3) ... [2025-02-06 18:49:45,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c93547 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:49:45, skipping insertion in model container [2025-02-06 18:49:45,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:44" (2/3) ... [2025-02-06 18:49:45,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c93547 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:49:45, skipping insertion in model container [2025-02-06 18:49:45,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:49:45" (3/3) ... [2025-02-06 18:49:45,068 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-word-subst.wvr.c [2025-02-06 18:49:45,078 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:49:45,079 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-word-subst.wvr.c that has 4 procedures, 75 locations, 1 initial locations, 6 loop locations, and 18 error locations. [2025-02-06 18:49:45,079 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 18:49:45,123 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 18:49:45,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 89 transitions, 199 flow [2025-02-06 18:49:45,167 INFO L124 PetriNetUnfolderBase]: 15/86 cut-off events. [2025-02-06 18:49:45,169 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 18:49:45,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 86 events. 15/86 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 260 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 66. Up to 3 conditions per place. [2025-02-06 18:49:45,172 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 89 transitions, 199 flow [2025-02-06 18:49:45,174 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 84 transitions, 183 flow [2025-02-06 18:49:45,179 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:49:45,186 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;@69a007f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:49:45,186 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2025-02-06 18:49:45,189 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:49:45,189 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-02-06 18:49:45,189 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:49:45,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:45,190 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 18:49:45,190 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-02-06 18:49:45,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:45,194 INFO L85 PathProgramCache]: Analyzing trace with hash 694817, now seen corresponding path program 1 times [2025-02-06 18:49:45,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:45,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804061885] [2025-02-06 18:49:45,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:45,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:45,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 18:49:45,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 18:49:45,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:45,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:45,357 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-06 18:49:45,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:45,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804061885] [2025-02-06 18:49:45,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804061885] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:45,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:45,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:49:45,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573800168] [2025-02-06 18:49:45,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:45,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:49:45,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:45,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:49:45,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:49:45,405 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 89 [2025-02-06 18:49:45,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 84 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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-06 18:49:45,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:45,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 89 [2025-02-06 18:49:45,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:46,010 INFO L124 PetriNetUnfolderBase]: 3605/6366 cut-off events. [2025-02-06 18:49:46,010 INFO L125 PetriNetUnfolderBase]: For 215/215 co-relation queries the response was YES. [2025-02-06 18:49:46,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11091 conditions, 6366 events. 3605/6366 cut-off events. For 215/215 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 43736 event pairs, 2206 based on Foata normal form. 3/4760 useless extension candidates. Maximal degree in co-relation 10446. Up to 4521 conditions per place. [2025-02-06 18:49:46,056 INFO L140 encePairwiseOnDemand]: 73/89 looper letters, 50 selfloop transitions, 10 changer transitions 0/93 dead transitions. [2025-02-06 18:49:46,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 93 transitions, 321 flow [2025-02-06 18:49:46,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:49:46,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:49:46,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2025-02-06 18:49:46,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5898876404494382 [2025-02-06 18:49:46,066 INFO L175 Difference]: Start difference. First operand has 79 places, 84 transitions, 183 flow. Second operand 4 states and 210 transitions. [2025-02-06 18:49:46,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 93 transitions, 321 flow [2025-02-06 18:49:46,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 93 transitions, 312 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 18:49:46,072 INFO L231 Difference]: Finished difference. Result has 80 places, 93 transitions, 262 flow [2025-02-06 18:49:46,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=262, PETRI_PLACES=80, PETRI_TRANSITIONS=93} [2025-02-06 18:49:46,076 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 1 predicate places. [2025-02-06 18:49:46,076 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 93 transitions, 262 flow [2025-02-06 18:49:46,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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-06 18:49:46,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:46,077 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-06 18:49:46,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:49:46,077 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-02-06 18:49:46,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:46,077 INFO L85 PathProgramCache]: Analyzing trace with hash -774973346, now seen corresponding path program 1 times [2025-02-06 18:49:46,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:46,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510398535] [2025-02-06 18:49:46,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:46,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:46,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 18:49:46,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 18:49:46,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:46,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:46,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:49:46,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:46,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510398535] [2025-02-06 18:49:46,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510398535] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:49:46,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64905397] [2025-02-06 18:49:46,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:46,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:49:46,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:49:46,212 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:49:46,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 18:49:46,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 18:49:46,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 18:49:46,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:46,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:46,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 18:49:46,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:49:46,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:49:46,308 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:49:46,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64905397] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:46,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:49:46,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-06 18:49:46,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540965812] [2025-02-06 18:49:46,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:46,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:49:46,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:46,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:49:46,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:49:46,335 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 89 [2025-02-06 18:49:46,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 93 transitions, 262 flow. Second operand has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 6 states have internal predecessors, (221), 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-06 18:49:46,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:46,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 89 [2025-02-06 18:49:46,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:46,996 INFO L124 PetriNetUnfolderBase]: 3605/6363 cut-off events. [2025-02-06 18:49:46,996 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-02-06 18:49:47,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11045 conditions, 6363 events. 3605/6363 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 43725 event pairs, 2206 based on Foata normal form. 3/4762 useless extension candidates. Maximal degree in co-relation 10972. Up to 4506 conditions per place. [2025-02-06 18:49:47,073 INFO L140 encePairwiseOnDemand]: 76/89 looper letters, 40 selfloop transitions, 17 changer transitions 0/90 dead transitions. [2025-02-06 18:49:47,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 90 transitions, 364 flow [2025-02-06 18:49:47,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:49:47,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:49:47,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 276 transitions. [2025-02-06 18:49:47,079 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5168539325842697 [2025-02-06 18:49:47,080 INFO L175 Difference]: Start difference. First operand has 80 places, 93 transitions, 262 flow. Second operand 6 states and 276 transitions. [2025-02-06 18:49:47,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 90 transitions, 364 flow [2025-02-06 18:49:47,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 90 transitions, 364 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:49:47,083 INFO L231 Difference]: Finished difference. Result has 82 places, 90 transitions, 284 flow [2025-02-06 18:49:47,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=284, PETRI_PLACES=82, PETRI_TRANSITIONS=90} [2025-02-06 18:49:47,084 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 3 predicate places. [2025-02-06 18:49:47,084 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 90 transitions, 284 flow [2025-02-06 18:49:47,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 6 states have internal predecessors, (221), 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-06 18:49:47,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:47,084 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-02-06 18:49:47,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 18:49:47,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:49:47,285 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-02-06 18:49:47,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:47,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1745630621, now seen corresponding path program 1 times [2025-02-06 18:49:47,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:47,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917822864] [2025-02-06 18:49:47,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:47,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:47,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:49:47,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:49:47,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:47,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:47,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:49:47,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:47,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917822864] [2025-02-06 18:49:47,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917822864] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:49:47,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861045098] [2025-02-06 18:49:47,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:47,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:49:47,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:49:47,382 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:49:47,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 18:49:47,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:49:47,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:49:47,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:47,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:47,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 18:49:47,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:49:47,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:49:47,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:49:47,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:49:47,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861045098] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:49:47,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:49:47,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-02-06 18:49:47,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879998943] [2025-02-06 18:49:47,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:49:47,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 18:49:47,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:47,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 18:49:47,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 18:49:47,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 89 [2025-02-06 18:49:47,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 90 transitions, 284 flow. Second operand has 12 states, 12 states have (on average 37.083333333333336) internal successors, (445), 12 states have internal predecessors, (445), 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-06 18:49:47,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:47,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 89 [2025-02-06 18:49:47,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:47,973 INFO L124 PetriNetUnfolderBase]: 3614/6399 cut-off events. [2025-02-06 18:49:47,974 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-02-06 18:49:47,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11186 conditions, 6399 events. 3614/6399 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 44131 event pairs, 2206 based on Foata normal form. 9/4804 useless extension candidates. Maximal degree in co-relation 10974. Up to 4521 conditions per place. [2025-02-06 18:49:48,001 INFO L140 encePairwiseOnDemand]: 76/89 looper letters, 47 selfloop transitions, 37 changer transitions 0/117 dead transitions. [2025-02-06 18:49:48,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 117 transitions, 626 flow [2025-02-06 18:49:48,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 18:49:48,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 18:49:48,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 453 transitions. [2025-02-06 18:49:48,004 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5089887640449439 [2025-02-06 18:49:48,004 INFO L175 Difference]: Start difference. First operand has 82 places, 90 transitions, 284 flow. Second operand 10 states and 453 transitions. [2025-02-06 18:49:48,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 117 transitions, 626 flow [2025-02-06 18:49:48,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 117 transitions, 543 flow, removed 16 selfloop flow, removed 5 redundant places. [2025-02-06 18:49:48,007 INFO L231 Difference]: Finished difference. Result has 89 places, 117 transitions, 499 flow [2025-02-06 18:49:48,007 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=499, PETRI_PLACES=89, PETRI_TRANSITIONS=117} [2025-02-06 18:49:48,008 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 10 predicate places. [2025-02-06 18:49:48,008 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 117 transitions, 499 flow [2025-02-06 18:49:48,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 37.083333333333336) internal successors, (445), 12 states have internal predecessors, (445), 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-06 18:49:48,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:48,008 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:49:48,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 18:49:48,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:49:48,209 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-02-06 18:49:48,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:48,210 INFO L85 PathProgramCache]: Analyzing trace with hash 2097636390, now seen corresponding path program 1 times [2025-02-06 18:49:48,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:48,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729913422] [2025-02-06 18:49:48,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:48,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:48,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 18:49:48,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 18:49:48,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:48,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:48,284 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-06 18:49:48,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:48,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729913422] [2025-02-06 18:49:48,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729913422] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:48,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:48,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:49:48,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449234450] [2025-02-06 18:49:48,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:48,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:49:48,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:48,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:49:48,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:49:48,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 89 [2025-02-06 18:49:48,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 117 transitions, 499 flow. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 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-06 18:49:48,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:48,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 89 [2025-02-06 18:49:48,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:48,911 INFO L124 PetriNetUnfolderBase]: 6654/11031 cut-off events. [2025-02-06 18:49:48,912 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2025-02-06 18:49:48,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19861 conditions, 11031 events. 6654/11031 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 73480 event pairs, 3250 based on Foata normal form. 146/8571 useless extension candidates. Maximal degree in co-relation 19763. Up to 6586 conditions per place. [2025-02-06 18:49:48,968 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 131 selfloop transitions, 4 changer transitions 0/168 dead transitions. [2025-02-06 18:49:48,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 168 transitions, 877 flow [2025-02-06 18:49:48,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:49:48,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:49:48,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 257 transitions. [2025-02-06 18:49:48,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7219101123595506 [2025-02-06 18:49:48,970 INFO L175 Difference]: Start difference. First operand has 89 places, 117 transitions, 499 flow. Second operand 4 states and 257 transitions. [2025-02-06 18:49:48,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 168 transitions, 877 flow [2025-02-06 18:49:48,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 168 transitions, 840 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-02-06 18:49:48,974 INFO L231 Difference]: Finished difference. Result has 92 places, 120 transitions, 491 flow [2025-02-06 18:49:48,974 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=491, PETRI_PLACES=92, PETRI_TRANSITIONS=120} [2025-02-06 18:49:48,974 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 13 predicate places. [2025-02-06 18:49:48,975 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 120 transitions, 491 flow [2025-02-06 18:49:48,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 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-06 18:49:48,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:48,975 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:49:48,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 18:49:48,975 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-02-06 18:49:48,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:48,976 INFO L85 PathProgramCache]: Analyzing trace with hash 602187544, now seen corresponding path program 1 times [2025-02-06 18:49:48,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:48,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743042484] [2025-02-06 18:49:48,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:48,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:48,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 18:49:48,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 18:49:48,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:48,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:49,130 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-06 18:49:49,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:49,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743042484] [2025-02-06 18:49:49,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743042484] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:49,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:49,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:49:49,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827620500] [2025-02-06 18:49:49,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:49,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:49:49,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:49,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:49:49,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:49:49,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 89 [2025-02-06 18:49:49,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 120 transitions, 491 flow. Second operand has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 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-06 18:49:49,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:49,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 89 [2025-02-06 18:49:49,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:50,184 INFO L124 PetriNetUnfolderBase]: 12407/21749 cut-off events. [2025-02-06 18:49:50,184 INFO L125 PetriNetUnfolderBase]: For 2512/2544 co-relation queries the response was YES. [2025-02-06 18:49:50,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39942 conditions, 21749 events. 12407/21749 cut-off events. For 2512/2544 co-relation queries the response was YES. Maximal size of possible extension queue 1094. Compared 178276 event pairs, 7220 based on Foata normal form. 349/17187 useless extension candidates. Maximal degree in co-relation 39818. Up to 7837 conditions per place. [2025-02-06 18:49:50,285 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 127 selfloop transitions, 11 changer transitions 0/173 dead transitions. [2025-02-06 18:49:50,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 173 transitions, 956 flow [2025-02-06 18:49:50,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:49:50,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:49:50,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 333 transitions. [2025-02-06 18:49:50,288 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6235955056179775 [2025-02-06 18:49:50,288 INFO L175 Difference]: Start difference. First operand has 92 places, 120 transitions, 491 flow. Second operand 6 states and 333 transitions. [2025-02-06 18:49:50,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 173 transitions, 956 flow [2025-02-06 18:49:50,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 173 transitions, 951 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:49:50,300 INFO L231 Difference]: Finished difference. Result has 99 places, 123 transitions, 541 flow [2025-02-06 18:49:50,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=541, PETRI_PLACES=99, PETRI_TRANSITIONS=123} [2025-02-06 18:49:50,301 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 20 predicate places. [2025-02-06 18:49:50,301 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 123 transitions, 541 flow [2025-02-06 18:49:50,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 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-06 18:49:50,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:50,303 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:49:50,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 18:49:50,303 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-02-06 18:49:50,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:50,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1487945352, now seen corresponding path program 1 times [2025-02-06 18:49:50,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:50,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936969354] [2025-02-06 18:49:50,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:50,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:50,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 18:49:50,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 18:49:50,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:50,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:50,420 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-06 18:49:50,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:50,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936969354] [2025-02-06 18:49:50,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936969354] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:50,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:50,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:49:50,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824674077] [2025-02-06 18:49:50,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:50,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:49:50,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:50,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:49:50,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:49:50,448 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 89 [2025-02-06 18:49:50,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 123 transitions, 541 flow. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 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-06 18:49:50,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:50,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 89 [2025-02-06 18:49:50,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:52,542 INFO L124 PetriNetUnfolderBase]: 23516/41540 cut-off events. [2025-02-06 18:49:52,543 INFO L125 PetriNetUnfolderBase]: For 7795/7863 co-relation queries the response was YES. [2025-02-06 18:49:52,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77706 conditions, 41540 events. 23516/41540 cut-off events. For 7795/7863 co-relation queries the response was YES. Maximal size of possible extension queue 1815. Compared 370078 event pairs, 13884 based on Foata normal form. 620/34040 useless extension candidates. Maximal degree in co-relation 77494. Up to 14575 conditions per place. [2025-02-06 18:49:52,812 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 154 selfloop transitions, 4 changer transitions 0/193 dead transitions. [2025-02-06 18:49:52,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 193 transitions, 1172 flow [2025-02-06 18:49:52,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:49:52,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:49:52,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2025-02-06 18:49:52,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7106741573033708 [2025-02-06 18:49:52,814 INFO L175 Difference]: Start difference. First operand has 99 places, 123 transitions, 541 flow. Second operand 4 states and 253 transitions. [2025-02-06 18:49:52,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 193 transitions, 1172 flow [2025-02-06 18:49:52,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 193 transitions, 1162 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-06 18:49:52,825 INFO L231 Difference]: Finished difference. Result has 103 places, 124 transitions, 556 flow [2025-02-06 18:49:52,825 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=556, PETRI_PLACES=103, PETRI_TRANSITIONS=124} [2025-02-06 18:49:52,827 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 24 predicate places. [2025-02-06 18:49:52,828 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 124 transitions, 556 flow [2025-02-06 18:49:52,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 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-06 18:49:52,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:52,828 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:49:52,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:49:52,828 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-02-06 18:49:52,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:52,829 INFO L85 PathProgramCache]: Analyzing trace with hash 72555531, now seen corresponding path program 1 times [2025-02-06 18:49:52,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:52,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930161607] [2025-02-06 18:49:52,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:52,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:52,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 18:49:52,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 18:49:52,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:52,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:52,878 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-06 18:49:52,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:52,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930161607] [2025-02-06 18:49:52,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930161607] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:52,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:52,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:49:52,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166557519] [2025-02-06 18:49:52,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:52,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:49:52,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:52,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:49:52,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:49:52,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 89 [2025-02-06 18:49:52,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 124 transitions, 556 flow. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 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-06 18:49:52,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:52,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 89 [2025-02-06 18:49:52,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:55,870 INFO L124 PetriNetUnfolderBase]: 39592/62744 cut-off events. [2025-02-06 18:49:55,871 INFO L125 PetriNetUnfolderBase]: For 7542/8454 co-relation queries the response was YES. [2025-02-06 18:49:56,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121865 conditions, 62744 events. 39592/62744 cut-off events. For 7542/8454 co-relation queries the response was YES. Maximal size of possible extension queue 1973. Compared 497559 event pairs, 19788 based on Foata normal form. 896/52981 useless extension candidates. Maximal degree in co-relation 121651. Up to 39191 conditions per place. [2025-02-06 18:49:56,438 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 137 selfloop transitions, 4 changer transitions 0/177 dead transitions. [2025-02-06 18:49:56,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 177 transitions, 974 flow [2025-02-06 18:49:56,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:49:56,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:49:56,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 255 transitions. [2025-02-06 18:49:56,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7162921348314607 [2025-02-06 18:49:56,440 INFO L175 Difference]: Start difference. First operand has 103 places, 124 transitions, 556 flow. Second operand 4 states and 255 transitions. [2025-02-06 18:49:56,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 177 transitions, 974 flow [2025-02-06 18:49:56,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 177 transitions, 972 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-06 18:49:56,456 INFO L231 Difference]: Finished difference. Result has 108 places, 127 transitions, 583 flow [2025-02-06 18:49:56,457 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=583, PETRI_PLACES=108, PETRI_TRANSITIONS=127} [2025-02-06 18:49:56,457 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 29 predicate places. [2025-02-06 18:49:56,457 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 127 transitions, 583 flow [2025-02-06 18:49:56,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 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-06 18:49:56,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:56,458 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:49:56,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 18:49:56,458 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-02-06 18:49:56,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:56,458 INFO L85 PathProgramCache]: Analyzing trace with hash -2045776922, now seen corresponding path program 1 times [2025-02-06 18:49:56,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:56,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424548873] [2025-02-06 18:49:56,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:56,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:56,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:49:56,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:49:56,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:56,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:56,608 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-06 18:49:56,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:56,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424548873] [2025-02-06 18:49:56,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424548873] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:56,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:56,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:49:56,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384393050] [2025-02-06 18:49:56,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:56,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:49:56,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:56,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:49:56,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:49:56,701 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 89 [2025-02-06 18:49:56,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 127 transitions, 583 flow. Second operand has 6 states, 6 states have (on average 41.666666666666664) internal successors, (250), 6 states have internal predecessors, (250), 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-06 18:49:56,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:56,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 89 [2025-02-06 18:49:56,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:50:04,788 INFO L124 PetriNetUnfolderBase]: 74212/130172 cut-off events. [2025-02-06 18:50:04,788 INFO L125 PetriNetUnfolderBase]: For 26314/26682 co-relation queries the response was YES. [2025-02-06 18:50:05,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253451 conditions, 130172 events. 74212/130172 cut-off events. For 26314/26682 co-relation queries the response was YES. Maximal size of possible extension queue 4911. Compared 1316799 event pairs, 43576 based on Foata normal form. 1476/109421 useless extension candidates. Maximal degree in co-relation 253234. Up to 46472 conditions per place. [2025-02-06 18:50:05,868 INFO L140 encePairwiseOnDemand]: 82/89 looper letters, 113 selfloop transitions, 16 changer transitions 0/167 dead transitions. [2025-02-06 18:50:05,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 167 transitions, 953 flow [2025-02-06 18:50:05,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:50:05,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:50:05,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 327 transitions. [2025-02-06 18:50:05,870 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6123595505617978 [2025-02-06 18:50:05,870 INFO L175 Difference]: Start difference. First operand has 108 places, 127 transitions, 583 flow. Second operand 6 states and 327 transitions. [2025-02-06 18:50:05,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 167 transitions, 953 flow [2025-02-06 18:50:05,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 167 transitions, 933 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 18:50:05,957 INFO L231 Difference]: Finished difference. Result has 113 places, 128 transitions, 619 flow [2025-02-06 18:50:05,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=619, PETRI_PLACES=113, PETRI_TRANSITIONS=128} [2025-02-06 18:50:05,958 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 34 predicate places. [2025-02-06 18:50:05,958 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 128 transitions, 619 flow [2025-02-06 18:50:05,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.666666666666664) internal successors, (250), 6 states have internal predecessors, (250), 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-06 18:50:05,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:50:05,959 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:50:05,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 18:50:05,959 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-02-06 18:50:05,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:50:05,959 INFO L85 PathProgramCache]: Analyzing trace with hash 638082782, now seen corresponding path program 1 times [2025-02-06 18:50:05,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:50:05,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972811850] [2025-02-06 18:50:05,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:50:05,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:50:05,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 18:50:05,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 18:50:05,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:50:05,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:50:06,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:50:06,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:50:06,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972811850] [2025-02-06 18:50:06,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972811850] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:50:06,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:50:06,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:50:06,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501219073] [2025-02-06 18:50:06,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:50:06,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:50:06,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:50:06,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:50:06,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:50:06,096 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 89 [2025-02-06 18:50:06,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 128 transitions, 619 flow. Second operand has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 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-06 18:50:06,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:50:06,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 89 [2025-02-06 18:50:06,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:50:11,632 INFO L124 PetriNetUnfolderBase]: 51228/92560 cut-off events. [2025-02-06 18:50:11,632 INFO L125 PetriNetUnfolderBase]: For 19587/19683 co-relation queries the response was YES. [2025-02-06 18:50:11,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181378 conditions, 92560 events. 51228/92560 cut-off events. For 19587/19683 co-relation queries the response was YES. Maximal size of possible extension queue 3374. Compared 927343 event pairs, 29904 based on Foata normal form. 872/81092 useless extension candidates. Maximal degree in co-relation 181157. Up to 43607 conditions per place. [2025-02-06 18:50:12,199 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 175 selfloop transitions, 5 changer transitions 0/219 dead transitions. [2025-02-06 18:50:12,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 219 transitions, 1369 flow [2025-02-06 18:50:12,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:50:12,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 18:50:12,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 316 transitions. [2025-02-06 18:50:12,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7101123595505618 [2025-02-06 18:50:12,203 INFO L175 Difference]: Start difference. First operand has 113 places, 128 transitions, 619 flow. Second operand 5 states and 316 transitions. [2025-02-06 18:50:12,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 219 transitions, 1369 flow [2025-02-06 18:50:12,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 219 transitions, 1362 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 18:50:12,261 INFO L231 Difference]: Finished difference. Result has 117 places, 130 transitions, 641 flow [2025-02-06 18:50:12,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=641, PETRI_PLACES=117, PETRI_TRANSITIONS=130} [2025-02-06 18:50:12,262 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 38 predicate places. [2025-02-06 18:50:12,262 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 130 transitions, 641 flow [2025-02-06 18:50:12,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 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-06 18:50:12,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:50:12,266 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:50:12,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 18:50:12,267 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-02-06 18:50:12,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:50:12,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1005425549, now seen corresponding path program 1 times [2025-02-06 18:50:12,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:50:12,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73064787] [2025-02-06 18:50:12,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:50:12,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:50:12,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 18:50:12,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 18:50:12,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:50:12,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:50:12,390 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-06 18:50:12,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:50:12,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73064787] [2025-02-06 18:50:12,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73064787] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:50:12,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:50:12,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:50:12,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833253570] [2025-02-06 18:50:12,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:50:12,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:50:12,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:50:12,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:50:12,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:50:12,437 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 89 [2025-02-06 18:50:12,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 130 transitions, 641 flow. Second operand has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 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-06 18:50:12,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:50:12,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 89 [2025-02-06 18:50:12,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:50:17,595 INFO L124 PetriNetUnfolderBase]: 50898/89590 cut-off events. [2025-02-06 18:50:17,596 INFO L125 PetriNetUnfolderBase]: For 30183/32019 co-relation queries the response was YES. [2025-02-06 18:50:17,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181080 conditions, 89590 events. 50898/89590 cut-off events. For 30183/32019 co-relation queries the response was YES. Maximal size of possible extension queue 3253. Compared 863160 event pairs, 29496 based on Foata normal form. 1148/77148 useless extension candidates. Maximal degree in co-relation 180857. Up to 43195 conditions per place. [2025-02-06 18:50:18,255 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 171 selfloop transitions, 9 changer transitions 0/219 dead transitions. [2025-02-06 18:50:18,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 219 transitions, 1389 flow [2025-02-06 18:50:18,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:50:18,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:50:18,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 351 transitions. [2025-02-06 18:50:18,257 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6573033707865169 [2025-02-06 18:50:18,257 INFO L175 Difference]: Start difference. First operand has 117 places, 130 transitions, 641 flow. Second operand 6 states and 351 transitions. [2025-02-06 18:50:18,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 219 transitions, 1389 flow [2025-02-06 18:50:18,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 219 transitions, 1384 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 18:50:18,302 INFO L231 Difference]: Finished difference. Result has 123 places, 136 transitions, 728 flow [2025-02-06 18:50:18,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=728, PETRI_PLACES=123, PETRI_TRANSITIONS=136} [2025-02-06 18:50:18,302 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 44 predicate places. [2025-02-06 18:50:18,303 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 136 transitions, 728 flow [2025-02-06 18:50:18,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 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-06 18:50:18,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:50:18,303 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:50:18,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 18:50:18,303 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-02-06 18:50:18,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:50:18,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1091977853, now seen corresponding path program 1 times [2025-02-06 18:50:18,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:50:18,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625427004] [2025-02-06 18:50:18,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:50:18,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:50:18,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 18:50:18,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 18:50:18,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:50:18,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:50:18,360 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-06 18:50:18,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:50:18,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625427004] [2025-02-06 18:50:18,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625427004] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:50:18,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:50:18,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:50:18,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61517522] [2025-02-06 18:50:18,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:50:18,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:50:18,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:50:18,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:50:18,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:50:18,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 89 [2025-02-06 18:50:18,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 136 transitions, 728 flow. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 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-06 18:50:18,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:50:18,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 89 [2025-02-06 18:50:18,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:50:25,443 INFO L124 PetriNetUnfolderBase]: 80120/126936 cut-off events. [2025-02-06 18:50:25,444 INFO L125 PetriNetUnfolderBase]: For 41507/46391 co-relation queries the response was YES. [2025-02-06 18:50:26,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270397 conditions, 126936 events. 80120/126936 cut-off events. For 41507/46391 co-relation queries the response was YES. Maximal size of possible extension queue 3452. Compared 1080252 event pairs, 40032 based on Foata normal form. 3060/116668 useless extension candidates. Maximal degree in co-relation 270169. Up to 78427 conditions per place. [2025-02-06 18:50:26,724 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 149 selfloop transitions, 4 changer transitions 0/193 dead transitions. [2025-02-06 18:50:26,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 193 transitions, 1220 flow [2025-02-06 18:50:26,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:50:26,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:50:26,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2025-02-06 18:50:26,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7106741573033708 [2025-02-06 18:50:26,725 INFO L175 Difference]: Start difference. First operand has 123 places, 136 transitions, 728 flow. Second operand 4 states and 253 transitions. [2025-02-06 18:50:26,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 193 transitions, 1220 flow [2025-02-06 18:50:26,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 193 transitions, 1217 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:50:26,933 INFO L231 Difference]: Finished difference. Result has 127 places, 139 transitions, 754 flow [2025-02-06 18:50:26,933 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=754, PETRI_PLACES=127, PETRI_TRANSITIONS=139} [2025-02-06 18:50:26,933 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 48 predicate places. [2025-02-06 18:50:26,934 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 139 transitions, 754 flow [2025-02-06 18:50:26,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 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-06 18:50:26,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:50:26,934 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:50:26,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 18:50:26,934 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-02-06 18:50:26,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:50:26,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1292324620, now seen corresponding path program 1 times [2025-02-06 18:50:26,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:50:26,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071892848] [2025-02-06 18:50:26,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:50:26,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:50:26,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 18:50:26,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 18:50:26,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:50:26,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:50:27,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:50:27,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:50:27,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071892848] [2025-02-06 18:50:27,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071892848] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:50:27,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000921248] [2025-02-06 18:50:27,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:50:27,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:50:27,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:50:27,046 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:50:27,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 18:50:27,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 18:50:27,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 18:50:27,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:50:27,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:50:27,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 18:50:27,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:50:27,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:50:27,157 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:50:27,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000921248] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:50:27,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:50:27,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2025-02-06 18:50:27,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129396808] [2025-02-06 18:50:27,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:50:27,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:50:27,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:50:27,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:50:27,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:50:27,171 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 89 [2025-02-06 18:50:27,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 139 transitions, 754 flow. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:50:27,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:50:27,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 89 [2025-02-06 18:50:27,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand