./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 83c7202603a0719c5812e4d7043f4665de4d954c89c656bd6312ac9e8fdcb494 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:27:26,987 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:27:27,032 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:27:27,036 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:27:27,037 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:27:27,059 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:27:27,060 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:27:27,061 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:27:27,061 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:27:27,061 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:27:27,062 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:27:27,062 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:27:27,062 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:27:27,062 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:27:27,063 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:27:27,063 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:27:27,063 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:27:27,063 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:27:27,063 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:27:27,063 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:27:27,063 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:27:27,063 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:27:27,064 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:27:27,064 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:27:27,064 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:27:27,064 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:27:27,064 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:27:27,064 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:27:27,064 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:27:27,064 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:27:27,064 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:27:27,064 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:27:27,065 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:27:27,065 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:27:27,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:27:27,065 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:27:27,065 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:27:27,065 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:27:27,065 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:27:27,065 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:27:27,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:27:27,065 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:27:27,065 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:27:27,065 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:27:27,066 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:27:27,066 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/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 -> 83c7202603a0719c5812e4d7043f4665de4d954c89c656bd6312ac9e8fdcb494 [2025-03-04 15:27:27,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:27:27,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:27:27,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:27:27,278 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:27:27,278 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:27:27,279 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c [2025-03-04 15:27:28,384 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bc400ddb/cf4f40ef39a44a718856cfb1b17c5071/FLAG96753ae82 [2025-03-04 15:27:28,694 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:27:28,695 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c [2025-03-04 15:27:28,712 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bc400ddb/cf4f40ef39a44a718856cfb1b17c5071/FLAG96753ae82 [2025-03-04 15:27:28,981 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bc400ddb/cf4f40ef39a44a718856cfb1b17c5071 [2025-03-04 15:27:28,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:27:28,985 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:27:28,987 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:27:28,988 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:27:28,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:27:28,993 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:27:28" (1/1) ... [2025-03-04 15:27:28,995 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6626b782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:28, skipping insertion in model container [2025-03-04 15:27:28,995 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:27:28" (1/1) ... [2025-03-04 15:27:29,014 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:27:29,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:27:29,182 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:27:29,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:27:29,231 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:27:29,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:29 WrapperNode [2025-03-04 15:27:29,232 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:27:29,233 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:27:29,234 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:27:29,234 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:27:29,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:29" (1/1) ... [2025-03-04 15:27:29,246 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:29" (1/1) ... [2025-03-04 15:27:29,278 INFO L138 Inliner]: procedures = 24, calls = 54, calls flagged for inlining = 21, calls inlined = 25, statements flattened = 349 [2025-03-04 15:27:29,280 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:27:29,281 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:27:29,281 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:27:29,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:27:29,289 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:29" (1/1) ... [2025-03-04 15:27:29,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:29" (1/1) ... [2025-03-04 15:27:29,296 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:29" (1/1) ... [2025-03-04 15:27:29,320 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 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-03-04 15:27:29,323 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:29" (1/1) ... [2025-03-04 15:27:29,323 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:29" (1/1) ... [2025-03-04 15:27:29,334 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:29" (1/1) ... [2025-03-04 15:27:29,338 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:29" (1/1) ... [2025-03-04 15:27:29,341 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:29" (1/1) ... [2025-03-04 15:27:29,342 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:29" (1/1) ... [2025-03-04 15:27:29,349 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:27:29,350 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:27:29,350 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:27:29,350 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:27:29,350 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:29" (1/1) ... [2025-03-04 15:27:29,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:27:29,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:27:29,381 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:27:29,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:27:29,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:27:29,402 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:27:29,402 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:27:29,402 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:27:29,402 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:27:29,402 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 15:27:29,402 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 15:27:29,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:27:29,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:27:29,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:27:29,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:27:29,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 15:27:29,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 15:27:29,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:27:29,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:27:29,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:27:29,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:27:29,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:27:29,403 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:27:29,485 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:27:29,487 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:27:29,903 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:27:29,903 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:27:30,179 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:27:30,180 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:27:30,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:27:30 BoogieIcfgContainer [2025-03-04 15:27:30,180 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:27:30,182 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:27:30,183 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:27:30,187 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:27:30,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:27:28" (1/3) ... [2025-03-04 15:27:30,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a8ce45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:27:30, skipping insertion in model container [2025-03-04 15:27:30,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:29" (2/3) ... [2025-03-04 15:27:30,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a8ce45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:27:30, skipping insertion in model container [2025-03-04 15:27:30,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:27:30" (3/3) ... [2025-03-04 15:27:30,189 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-1.wvr-bad.c [2025-03-04 15:27:30,203 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:27:30,204 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-commit-1.wvr-bad.c that has 4 procedures, 71 locations, 1 initial locations, 6 loop locations, and 22 error locations. [2025-03-04 15:27:30,205 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:27:30,264 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:27:30,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 87 transitions, 195 flow [2025-03-04 15:27:30,324 INFO L124 PetriNetUnfolderBase]: 17/84 cut-off events. [2025-03-04 15:27:30,326 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 15:27:30,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 84 events. 17/84 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 253 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 67. Up to 6 conditions per place. [2025-03-04 15:27:30,331 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 87 transitions, 195 flow [2025-03-04 15:27:30,335 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 82 transitions, 179 flow [2025-03-04 15:27:30,346 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:27:30,357 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;@19dff191, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:27:30,357 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2025-03-04 15:27:30,360 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:27:30,360 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:27:30,360 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:27:30,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:30,361 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:27:30,361 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-04 15:27:30,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:30,366 INFO L85 PathProgramCache]: Analyzing trace with hash 950510, now seen corresponding path program 1 times [2025-03-04 15:27:30,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:30,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095813900] [2025-03-04 15:27:30,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:30,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:30,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:27:30,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:27:30,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:30,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:30,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:30,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:30,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095813900] [2025-03-04 15:27:30,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095813900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:30,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:30,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:27:30,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062181559] [2025-03-04 15:27:30,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:30,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:27:30,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:30,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:27:30,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:27:30,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 87 [2025-03-04 15:27:30,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 82 transitions, 179 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-03-04 15:27:30,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:30,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 87 [2025-03-04 15:27:30,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:31,290 INFO L124 PetriNetUnfolderBase]: 3369/4949 cut-off events. [2025-03-04 15:27:31,290 INFO L125 PetriNetUnfolderBase]: For 191/191 co-relation queries the response was YES. [2025-03-04 15:27:31,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9471 conditions, 4949 events. 3369/4949 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 27895 event pairs, 2182 based on Foata normal form. 3/3109 useless extension candidates. Maximal degree in co-relation 8998. Up to 4308 conditions per place. [2025-03-04 15:27:31,333 INFO L140 encePairwiseOnDemand]: 60/87 looper letters, 51 selfloop transitions, 10 changer transitions 0/80 dead transitions. [2025-03-04 15:27:31,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 80 transitions, 297 flow [2025-03-04 15:27:31,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:27:31,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:27:31,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2025-03-04 15:27:31,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47701149425287354 [2025-03-04 15:27:31,347 INFO L175 Difference]: Start difference. First operand has 75 places, 82 transitions, 179 flow. Second operand 4 states and 166 transitions. [2025-03-04 15:27:31,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 80 transitions, 297 flow [2025-03-04 15:27:31,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 80 transitions, 288 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 15:27:31,360 INFO L231 Difference]: Finished difference. Result has 68 places, 80 transitions, 236 flow [2025-03-04 15:27:31,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=236, PETRI_PLACES=68, PETRI_TRANSITIONS=80} [2025-03-04 15:27:31,366 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -7 predicate places. [2025-03-04 15:27:31,366 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 80 transitions, 236 flow [2025-03-04 15:27:31,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-03-04 15:27:31,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:31,366 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:27:31,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:27:31,367 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-04 15:27:31,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:31,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1747263642, now seen corresponding path program 1 times [2025-03-04 15:27:31,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:31,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426734663] [2025-03-04 15:27:31,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:31,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:31,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:27:31,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:27:31,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:31,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:31,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:31,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:31,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426734663] [2025-03-04 15:27:31,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426734663] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:27:31,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605936155] [2025-03-04 15:27:31,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:31,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:31,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:27:31,532 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:27:31,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 15:27:31,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:27:31,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:27:31,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:31,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:31,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:27:31,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:27:31,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:31,648 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:27:31,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605936155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:31,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:27:31,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:27:31,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662980914] [2025-03-04 15:27:31,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:31,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:27:31,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:31,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:27:31,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:27:31,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 87 [2025-03-04 15:27:31,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 80 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 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-03-04 15:27:31,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:31,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 87 [2025-03-04 15:27:31,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:32,162 INFO L124 PetriNetUnfolderBase]: 3369/4946 cut-off events. [2025-03-04 15:27:32,162 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-03-04 15:27:32,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9431 conditions, 4946 events. 3369/4946 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 27821 event pairs, 2182 based on Foata normal form. 3/3111 useless extension candidates. Maximal degree in co-relation 9358. Up to 4293 conditions per place. [2025-03-04 15:27:32,202 INFO L140 encePairwiseOnDemand]: 74/87 looper letters, 41 selfloop transitions, 17 changer transitions 0/77 dead transitions. [2025-03-04 15:27:32,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 77 transitions, 340 flow [2025-03-04 15:27:32,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:27:32,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:27:32,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 193 transitions. [2025-03-04 15:27:32,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36973180076628354 [2025-03-04 15:27:32,205 INFO L175 Difference]: Start difference. First operand has 68 places, 80 transitions, 236 flow. Second operand 6 states and 193 transitions. [2025-03-04 15:27:32,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 77 transitions, 340 flow [2025-03-04 15:27:32,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 77 transitions, 340 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:27:32,209 INFO L231 Difference]: Finished difference. Result has 70 places, 77 transitions, 258 flow [2025-03-04 15:27:32,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=258, PETRI_PLACES=70, PETRI_TRANSITIONS=77} [2025-03-04 15:27:32,209 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -5 predicate places. [2025-03-04 15:27:32,209 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 77 transitions, 258 flow [2025-03-04 15:27:32,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 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-03-04 15:27:32,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:32,210 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:27:32,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 15:27:32,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:32,414 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-04 15:27:32,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:32,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1669402813, now seen corresponding path program 1 times [2025-03-04 15:27:32,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:32,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055259319] [2025-03-04 15:27:32,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:32,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:32,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:27:32,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:27:32,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:32,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:32,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:32,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:32,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055259319] [2025-03-04 15:27:32,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055259319] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:27:32,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221803913] [2025-03-04 15:27:32,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:32,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:32,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:27:32,523 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:27:32,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 15:27:32,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:27:32,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:27:32,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:32,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:32,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:27:32,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:27:32,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:32,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:27:32,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:32,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221803913] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:27:32,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:27:32,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 15:27:32,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164028426] [2025-03-04 15:27:32,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:27:32,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:27:32,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:32,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:27:32,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:27:32,682 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 87 [2025-03-04 15:27:32,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 77 transitions, 258 flow. Second operand has 12 states, 12 states have (on average 23.083333333333332) internal successors, (277), 12 states have internal predecessors, (277), 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-03-04 15:27:32,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:32,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 87 [2025-03-04 15:27:32,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:33,167 INFO L124 PetriNetUnfolderBase]: 3378/4982 cut-off events. [2025-03-04 15:27:33,167 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2025-03-04 15:27:33,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9572 conditions, 4982 events. 3378/4982 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 28229 event pairs, 2182 based on Foata normal form. 9/3153 useless extension candidates. Maximal degree in co-relation 9360. Up to 4308 conditions per place. [2025-03-04 15:27:33,199 INFO L140 encePairwiseOnDemand]: 74/87 looper letters, 48 selfloop transitions, 37 changer transitions 0/104 dead transitions. [2025-03-04 15:27:33,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 104 transitions, 602 flow [2025-03-04 15:27:33,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:27:33,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:27:33,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 314 transitions. [2025-03-04 15:27:33,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36091954022988504 [2025-03-04 15:27:33,201 INFO L175 Difference]: Start difference. First operand has 70 places, 77 transitions, 258 flow. Second operand 10 states and 314 transitions. [2025-03-04 15:27:33,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 104 transitions, 602 flow [2025-03-04 15:27:33,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 104 transitions, 519 flow, removed 16 selfloop flow, removed 5 redundant places. [2025-03-04 15:27:33,204 INFO L231 Difference]: Finished difference. Result has 77 places, 104 transitions, 473 flow [2025-03-04 15:27:33,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=473, PETRI_PLACES=77, PETRI_TRANSITIONS=104} [2025-03-04 15:27:33,205 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 2 predicate places. [2025-03-04 15:27:33,205 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 104 transitions, 473 flow [2025-03-04 15:27:33,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 23.083333333333332) internal successors, (277), 12 states have internal predecessors, (277), 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-03-04 15:27:33,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:33,205 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:33,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:27:33,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-04 15:27:33,406 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-04 15:27:33,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:33,407 INFO L85 PathProgramCache]: Analyzing trace with hash -439046064, now seen corresponding path program 1 times [2025-03-04 15:27:33,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:33,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365488274] [2025-03-04 15:27:33,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:33,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:33,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:27:33,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:27:33,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:33,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:33,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:33,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:33,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365488274] [2025-03-04 15:27:33,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365488274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:33,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:33,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:27:33,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950756697] [2025-03-04 15:27:33,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:33,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:27:33,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:33,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:27:33,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:27:33,503 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 87 [2025-03-04 15:27:33,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 104 transitions, 473 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:33,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:33,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 87 [2025-03-04 15:27:33,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:34,032 INFO L124 PetriNetUnfolderBase]: 5837/8619 cut-off events. [2025-03-04 15:27:34,033 INFO L125 PetriNetUnfolderBase]: For 208/208 co-relation queries the response was YES. [2025-03-04 15:27:34,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16505 conditions, 8619 events. 5837/8619 cut-off events. For 208/208 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 51776 event pairs, 1884 based on Foata normal form. 220/5787 useless extension candidates. Maximal degree in co-relation 16407. Up to 4473 conditions per place. [2025-03-04 15:27:34,065 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 108 selfloop transitions, 3 changer transitions 0/133 dead transitions. [2025-03-04 15:27:34,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 133 transitions, 757 flow [2025-03-04 15:27:34,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:27:34,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:27:34,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 163 transitions. [2025-03-04 15:27:34,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6245210727969349 [2025-03-04 15:27:34,067 INFO L175 Difference]: Start difference. First operand has 77 places, 104 transitions, 473 flow. Second operand 3 states and 163 transitions. [2025-03-04 15:27:34,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 133 transitions, 757 flow [2025-03-04 15:27:34,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 133 transitions, 720 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-03-04 15:27:34,071 INFO L231 Difference]: Finished difference. Result has 78 places, 106 transitions, 461 flow [2025-03-04 15:27:34,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=461, PETRI_PLACES=78, PETRI_TRANSITIONS=106} [2025-03-04 15:27:34,073 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 3 predicate places. [2025-03-04 15:27:34,073 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 106 transitions, 461 flow [2025-03-04 15:27:34,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:34,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:34,076 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:34,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:27:34,076 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-04 15:27:34,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:34,077 INFO L85 PathProgramCache]: Analyzing trace with hash -725524110, now seen corresponding path program 1 times [2025-03-04 15:27:34,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:34,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061487854] [2025-03-04 15:27:34,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:34,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:34,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:27:34,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:27:34,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:34,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:34,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:34,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:34,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061487854] [2025-03-04 15:27:34,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061487854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:34,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:34,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:27:34,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011597085] [2025-03-04 15:27:34,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:34,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:27:34,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:34,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:27:34,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:27:34,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 87 [2025-03-04 15:27:34,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 106 transitions, 461 flow. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-03-04 15:27:34,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:34,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 87 [2025-03-04 15:27:34,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:34,878 INFO L124 PetriNetUnfolderBase]: 8495/12342 cut-off events. [2025-03-04 15:27:34,879 INFO L125 PetriNetUnfolderBase]: For 953/965 co-relation queries the response was YES. [2025-03-04 15:27:34,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25452 conditions, 12342 events. 8495/12342 cut-off events. For 953/965 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 70391 event pairs, 3181 based on Foata normal form. 0/9349 useless extension candidates. Maximal degree in co-relation 25357. Up to 5816 conditions per place. [2025-03-04 15:27:34,948 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 111 selfloop transitions, 4 changer transitions 0/132 dead transitions. [2025-03-04 15:27:34,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 132 transitions, 751 flow [2025-03-04 15:27:34,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:27:34,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:27:34,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2025-03-04 15:27:34,949 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5632183908045977 [2025-03-04 15:27:34,950 INFO L175 Difference]: Start difference. First operand has 78 places, 106 transitions, 461 flow. Second operand 3 states and 147 transitions. [2025-03-04 15:27:34,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 132 transitions, 751 flow [2025-03-04 15:27:34,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 132 transitions, 748 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:27:34,955 INFO L231 Difference]: Finished difference. Result has 81 places, 107 transitions, 480 flow [2025-03-04 15:27:34,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=81, PETRI_TRANSITIONS=107} [2025-03-04 15:27:34,957 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 6 predicate places. [2025-03-04 15:27:34,957 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 107 transitions, 480 flow [2025-03-04 15:27:34,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-03-04 15:27:34,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:34,958 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:34,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:27:34,958 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-04 15:27:34,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:34,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1682578464, now seen corresponding path program 1 times [2025-03-04 15:27:34,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:34,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113651294] [2025-03-04 15:27:34,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:34,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:34,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:27:34,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:27:34,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:34,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:35,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:35,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:35,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113651294] [2025-03-04 15:27:35,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113651294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:35,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:35,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:27:35,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74250658] [2025-03-04 15:27:35,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:35,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:27:35,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:35,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:27:35,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:27:35,035 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 87 [2025-03-04 15:27:35,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 107 transitions, 480 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-03-04 15:27:35,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:35,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 87 [2025-03-04 15:27:35,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:35,819 INFO L124 PetriNetUnfolderBase]: 10419/15910 cut-off events. [2025-03-04 15:27:35,819 INFO L125 PetriNetUnfolderBase]: For 3354/3462 co-relation queries the response was YES. [2025-03-04 15:27:35,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33886 conditions, 15910 events. 10419/15910 cut-off events. For 3354/3462 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 99331 event pairs, 4177 based on Foata normal form. 315/12543 useless extension candidates. Maximal degree in co-relation 33790. Up to 7196 conditions per place. [2025-03-04 15:27:35,885 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 113 selfloop transitions, 2 changer transitions 0/138 dead transitions. [2025-03-04 15:27:35,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 138 transitions, 796 flow [2025-03-04 15:27:35,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:27:35,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:27:35,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 163 transitions. [2025-03-04 15:27:35,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6245210727969349 [2025-03-04 15:27:35,887 INFO L175 Difference]: Start difference. First operand has 81 places, 107 transitions, 480 flow. Second operand 3 states and 163 transitions. [2025-03-04 15:27:35,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 138 transitions, 796 flow [2025-03-04 15:27:35,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 138 transitions, 784 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:27:35,893 INFO L231 Difference]: Finished difference. Result has 82 places, 108 transitions, 486 flow [2025-03-04 15:27:35,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=486, PETRI_PLACES=82, PETRI_TRANSITIONS=108} [2025-03-04 15:27:35,894 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 7 predicate places. [2025-03-04 15:27:35,894 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 108 transitions, 486 flow [2025-03-04 15:27:35,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-03-04 15:27:35,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:35,894 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:35,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:27:35,894 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-04 15:27:35,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:35,895 INFO L85 PathProgramCache]: Analyzing trace with hash -620322821, now seen corresponding path program 1 times [2025-03-04 15:27:35,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:35,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613126615] [2025-03-04 15:27:35,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:35,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:35,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:27:35,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:27:35,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:35,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:35,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:35,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:35,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613126615] [2025-03-04 15:27:35,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613126615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:35,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:35,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:27:35,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578332747] [2025-03-04 15:27:35,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:35,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:27:35,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:35,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:27:35,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:27:35,940 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 87 [2025-03-04 15:27:35,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 108 transitions, 486 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-03-04 15:27:35,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:35,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 87 [2025-03-04 15:27:35,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:37,072 INFO L124 PetriNetUnfolderBase]: 14063/20641 cut-off events. [2025-03-04 15:27:37,072 INFO L125 PetriNetUnfolderBase]: For 3137/3361 co-relation queries the response was YES. [2025-03-04 15:27:37,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43482 conditions, 20641 events. 14063/20641 cut-off events. For 3137/3361 co-relation queries the response was YES. Maximal size of possible extension queue 679. Compared 124236 event pairs, 6937 based on Foata normal form. 0/15999 useless extension candidates. Maximal degree in co-relation 43385. Up to 12185 conditions per place. [2025-03-04 15:27:37,190 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 111 selfloop transitions, 4 changer transitions 0/135 dead transitions. [2025-03-04 15:27:37,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 135 transitions, 786 flow [2025-03-04 15:27:37,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:27:37,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:27:37,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2025-03-04 15:27:37,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5862068965517241 [2025-03-04 15:27:37,192 INFO L175 Difference]: Start difference. First operand has 82 places, 108 transitions, 486 flow. Second operand 3 states and 153 transitions. [2025-03-04 15:27:37,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 135 transitions, 786 flow [2025-03-04 15:27:37,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 135 transitions, 784 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:27:37,197 INFO L231 Difference]: Finished difference. Result has 85 places, 108 transitions, 502 flow [2025-03-04 15:27:37,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=85, PETRI_TRANSITIONS=108} [2025-03-04 15:27:37,197 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 10 predicate places. [2025-03-04 15:27:37,197 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 108 transitions, 502 flow [2025-03-04 15:27:37,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-03-04 15:27:37,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:37,198 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:37,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:27:37,198 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-04 15:27:37,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:37,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1072264172, now seen corresponding path program 1 times [2025-03-04 15:27:37,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:37,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571207836] [2025-03-04 15:27:37,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:37,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:37,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:27:37,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:27:37,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:37,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:37,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:37,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:37,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571207836] [2025-03-04 15:27:37,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571207836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:37,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:37,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:27:37,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218774696] [2025-03-04 15:27:37,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:37,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:27:37,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:37,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:27:37,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:27:37,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 87 [2025-03-04 15:27:37,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 108 transitions, 502 flow. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 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-03-04 15:27:37,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:37,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 87 [2025-03-04 15:27:37,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:38,571 INFO L124 PetriNetUnfolderBase]: 12513/19149 cut-off events. [2025-03-04 15:27:38,571 INFO L125 PetriNetUnfolderBase]: For 6019/6411 co-relation queries the response was YES. [2025-03-04 15:27:38,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41684 conditions, 19149 events. 12513/19149 cut-off events. For 6019/6411 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 120296 event pairs, 9361 based on Foata normal form. 112/14996 useless extension candidates. Maximal degree in co-relation 41529. Up to 15248 conditions per place. [2025-03-04 15:27:38,639 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 131 selfloop transitions, 3 changer transitions 2/160 dead transitions. [2025-03-04 15:27:38,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 160 transitions, 1013 flow [2025-03-04 15:27:38,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:27:38,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:27:38,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 191 transitions. [2025-03-04 15:27:38,640 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5488505747126436 [2025-03-04 15:27:38,640 INFO L175 Difference]: Start difference. First operand has 85 places, 108 transitions, 502 flow. Second operand 4 states and 191 transitions. [2025-03-04 15:27:38,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 160 transitions, 1013 flow [2025-03-04 15:27:38,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 160 transitions, 1005 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:27:38,648 INFO L231 Difference]: Finished difference. Result has 87 places, 108 transitions, 505 flow [2025-03-04 15:27:38,648 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=505, PETRI_PLACES=87, PETRI_TRANSITIONS=108} [2025-03-04 15:27:38,649 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 12 predicate places. [2025-03-04 15:27:38,649 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 108 transitions, 505 flow [2025-03-04 15:27:38,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 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-03-04 15:27:38,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:38,649 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:38,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:27:38,649 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-04 15:27:38,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:38,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1119547010, now seen corresponding path program 1 times [2025-03-04 15:27:38,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:38,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677496617] [2025-03-04 15:27:38,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:38,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:38,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:27:38,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:27:38,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:38,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:38,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:38,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:38,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677496617] [2025-03-04 15:27:38,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677496617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:38,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:38,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:27:38,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528394140] [2025-03-04 15:27:38,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:38,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:27:38,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:38,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:27:38,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:27:38,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 87 [2025-03-04 15:27:38,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 108 transitions, 505 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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-03-04 15:27:38,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:38,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 87 [2025-03-04 15:27:38,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:40,379 INFO L124 PetriNetUnfolderBase]: 23803/34697 cut-off events. [2025-03-04 15:27:40,380 INFO L125 PetriNetUnfolderBase]: For 9699/10513 co-relation queries the response was YES. [2025-03-04 15:27:40,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76589 conditions, 34697 events. 23803/34697 cut-off events. For 9699/10513 co-relation queries the response was YES. Maximal size of possible extension queue 1113. Compared 216488 event pairs, 13589 based on Foata normal form. 0/26667 useless extension candidates. Maximal degree in co-relation 76433. Up to 16287 conditions per place. [2025-03-04 15:27:40,571 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 111 selfloop transitions, 5 changer transitions 0/137 dead transitions. [2025-03-04 15:27:40,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 137 transitions, 823 flow [2025-03-04 15:27:40,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:27:40,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:27:40,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2025-03-04 15:27:40,573 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5862068965517241 [2025-03-04 15:27:40,573 INFO L175 Difference]: Start difference. First operand has 87 places, 108 transitions, 505 flow. Second operand 3 states and 153 transitions. [2025-03-04 15:27:40,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 137 transitions, 823 flow [2025-03-04 15:27:40,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 137 transitions, 819 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 15:27:40,581 INFO L231 Difference]: Finished difference. Result has 90 places, 109 transitions, 527 flow [2025-03-04 15:27:40,581 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=527, PETRI_PLACES=90, PETRI_TRANSITIONS=109} [2025-03-04 15:27:40,581 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 15 predicate places. [2025-03-04 15:27:40,581 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 109 transitions, 527 flow [2025-03-04 15:27:40,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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-03-04 15:27:40,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:40,581 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-03-04 15:27:40,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:27:40,582 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-04 15:27:40,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:40,582 INFO L85 PathProgramCache]: Analyzing trace with hash 552011317, now seen corresponding path program 2 times [2025-03-04 15:27:40,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:40,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429963816] [2025-03-04 15:27:40,582 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:27:40,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:40,588 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:27:40,591 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 15:27:40,591 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:27:40,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:40,615 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:27:40,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:40,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429963816] [2025-03-04 15:27:40,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429963816] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:27:40,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267856634] [2025-03-04 15:27:40,615 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:27:40,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:40,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:27:40,621 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:27:40,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 15:27:40,662 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:27:40,672 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 15:27:40,672 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:27:40,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:40,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:27:40,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:27:40,698 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:27:40,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:27:40,725 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:27:40,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267856634] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:27:40,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:27:40,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-03-04 15:27:40,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856478288] [2025-03-04 15:27:40,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:27:40,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:27:40,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:40,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:27:40,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:27:40,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 87 [2025-03-04 15:27:40,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 109 transitions, 527 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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-03-04 15:27:40,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:40,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 87 [2025-03-04 15:27:40,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:42,710 INFO L124 PetriNetUnfolderBase]: 18815/28864 cut-off events. [2025-03-04 15:27:42,710 INFO L125 PetriNetUnfolderBase]: For 12408/13526 co-relation queries the response was YES. [2025-03-04 15:27:42,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65257 conditions, 28864 events. 18815/28864 cut-off events. For 12408/13526 co-relation queries the response was YES. Maximal size of possible extension queue 928. Compared 196409 event pairs, 15031 based on Foata normal form. 5/22941 useless extension candidates. Maximal degree in co-relation 65125. Up to 24910 conditions per place. [2025-03-04 15:27:42,864 INFO L140 encePairwiseOnDemand]: 76/87 looper letters, 47 selfloop transitions, 36 changer transitions 1/106 dead transitions. [2025-03-04 15:27:42,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 106 transitions, 665 flow [2025-03-04 15:27:42,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:27:42,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:27:42,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2025-03-04 15:27:42,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3936781609195402 [2025-03-04 15:27:42,865 INFO L175 Difference]: Start difference. First operand has 90 places, 109 transitions, 527 flow. Second operand 4 states and 137 transitions. [2025-03-04 15:27:42,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 106 transitions, 665 flow [2025-03-04 15:27:42,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 106 transitions, 625 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-04 15:27:42,875 INFO L231 Difference]: Finished difference. Result has 84 places, 105 transitions, 524 flow [2025-03-04 15:27:42,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=524, PETRI_PLACES=84, PETRI_TRANSITIONS=105} [2025-03-04 15:27:42,876 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 9 predicate places. [2025-03-04 15:27:42,876 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 105 transitions, 524 flow [2025-03-04 15:27:42,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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-03-04 15:27:42,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:42,876 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:42,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:27:43,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:43,077 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-04 15:27:43,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:43,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1301027940, now seen corresponding path program 1 times [2025-03-04 15:27:43,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:43,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153447029] [2025-03-04 15:27:43,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:43,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:43,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:27:43,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:27:43,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:43,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:43,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:43,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:43,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153447029] [2025-03-04 15:27:43,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153447029] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:27:43,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438235071] [2025-03-04 15:27:43,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:43,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:43,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:27:43,223 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:27:43,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 15:27:43,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:27:43,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:27:43,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:43,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:43,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:27:43,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:27:43,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:27:43,314 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:27:43,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438235071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:43,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:27:43,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2025-03-04 15:27:43,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841870572] [2025-03-04 15:27:43,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:43,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:27:43,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:43,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:27:43,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:27:43,318 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 87 [2025-03-04 15:27:43,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 105 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-03-04 15:27:43,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:43,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 87 [2025-03-04 15:27:43,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:44,610 INFO L124 PetriNetUnfolderBase]: 13824/21467 cut-off events. [2025-03-04 15:27:44,610 INFO L125 PetriNetUnfolderBase]: For 7734/8646 co-relation queries the response was YES. [2025-03-04 15:27:44,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46818 conditions, 21467 events. 13824/21467 cut-off events. For 7734/8646 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 142979 event pairs, 10758 based on Foata normal form. 1221/18132 useless extension candidates. Maximal degree in co-relation 46580. Up to 18121 conditions per place. [2025-03-04 15:27:44,682 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 78 selfloop transitions, 1 changer transitions 0/101 dead transitions. [2025-03-04 15:27:44,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 101 transitions, 668 flow [2025-03-04 15:27:44,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:27:44,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:27:44,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2025-03-04 15:27:44,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49808429118773945 [2025-03-04 15:27:44,683 INFO L175 Difference]: Start difference. First operand has 84 places, 105 transitions, 524 flow. Second operand 3 states and 130 transitions. [2025-03-04 15:27:44,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 101 transitions, 668 flow [2025-03-04 15:27:44,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 101 transitions, 594 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 15:27:44,688 INFO L231 Difference]: Finished difference. Result has 77 places, 101 transitions, 438 flow [2025-03-04 15:27:44,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=438, PETRI_PLACES=77, PETRI_TRANSITIONS=101} [2025-03-04 15:27:44,688 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 2 predicate places. [2025-03-04 15:27:44,688 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 101 transitions, 438 flow [2025-03-04 15:27:44,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-03-04 15:27:44,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:44,689 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:44,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 15:27:44,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:44,889 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-04 15:27:44,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:44,890 INFO L85 PathProgramCache]: Analyzing trace with hash -161590400, now seen corresponding path program 1 times [2025-03-04 15:27:44,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:44,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924394248] [2025-03-04 15:27:44,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:44,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:44,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:27:44,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:27:44,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:44,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:44,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:27:44,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:44,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924394248] [2025-03-04 15:27:44,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924394248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:44,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:44,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:27:44,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23185437] [2025-03-04 15:27:44,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:44,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:27:44,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:44,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:27:44,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:27:44,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 87 [2025-03-04 15:27:44,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 101 transitions, 438 flow. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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-03-04 15:27:44,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:44,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 87 [2025-03-04 15:27:44,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:46,534 INFO L124 PetriNetUnfolderBase]: 18120/27225 cut-off events. [2025-03-04 15:27:46,535 INFO L125 PetriNetUnfolderBase]: For 10308/12126 co-relation queries the response was YES. [2025-03-04 15:27:46,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61146 conditions, 27225 events. 18120/27225 cut-off events. For 10308/12126 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 171006 event pairs, 6045 based on Foata normal form. 566/22680 useless extension candidates. Maximal degree in co-relation 61126. Up to 17545 conditions per place. [2025-03-04 15:27:46,684 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 103 selfloop transitions, 2 changer transitions 0/127 dead transitions. [2025-03-04 15:27:46,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 127 transitions, 728 flow [2025-03-04 15:27:46,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:27:46,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:27:46,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2025-03-04 15:27:46,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5862068965517241 [2025-03-04 15:27:46,685 INFO L175 Difference]: Start difference. First operand has 77 places, 101 transitions, 438 flow. Second operand 3 states and 153 transitions. [2025-03-04 15:27:46,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 127 transitions, 728 flow [2025-03-04 15:27:46,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 127 transitions, 727 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:27:46,693 INFO L231 Difference]: Finished difference. Result has 79 places, 102 transitions, 453 flow [2025-03-04 15:27:46,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=453, PETRI_PLACES=79, PETRI_TRANSITIONS=102} [2025-03-04 15:27:46,694 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 4 predicate places. [2025-03-04 15:27:46,694 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 102 transitions, 453 flow [2025-03-04 15:27:46,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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-03-04 15:27:46,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:46,694 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:46,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:27:46,695 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-04 15:27:46,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:46,695 INFO L85 PathProgramCache]: Analyzing trace with hash 294995368, now seen corresponding path program 1 times [2025-03-04 15:27:46,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:46,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758736812] [2025-03-04 15:27:46,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:46,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:46,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 15:27:46,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:27:46,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:46,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:46,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:27:46,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:46,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758736812] [2025-03-04 15:27:46,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758736812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:46,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:46,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:27:46,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024945763] [2025-03-04 15:27:46,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:46,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:27:46,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:46,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:27:46,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:27:46,807 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 87 [2025-03-04 15:27:46,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 102 transitions, 453 flow. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 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-03-04 15:27:46,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:46,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 87 [2025-03-04 15:27:46,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:48,795 INFO L124 PetriNetUnfolderBase]: 23693/36202 cut-off events. [2025-03-04 15:27:48,795 INFO L125 PetriNetUnfolderBase]: For 15425/17472 co-relation queries the response was YES. [2025-03-04 15:27:48,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82234 conditions, 36202 events. 23693/36202 cut-off events. For 15425/17472 co-relation queries the response was YES. Maximal size of possible extension queue 814. Compared 242331 event pairs, 18637 based on Foata normal form. 320/29484 useless extension candidates. Maximal degree in co-relation 82212. Up to 24052 conditions per place. [2025-03-04 15:27:49,014 INFO L140 encePairwiseOnDemand]: 78/87 looper letters, 95 selfloop transitions, 14 changer transitions 0/131 dead transitions. [2025-03-04 15:27:49,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 131 transitions, 764 flow [2025-03-04 15:27:49,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:27:49,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:27:49,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 219 transitions. [2025-03-04 15:27:49,016 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.503448275862069 [2025-03-04 15:27:49,016 INFO L175 Difference]: Start difference. First operand has 79 places, 102 transitions, 453 flow. Second operand 5 states and 219 transitions. [2025-03-04 15:27:49,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 131 transitions, 764 flow [2025-03-04 15:27:49,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 131 transitions, 761 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:27:49,025 INFO L231 Difference]: Finished difference. Result has 83 places, 102 transitions, 494 flow [2025-03-04 15:27:49,025 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=494, PETRI_PLACES=83, PETRI_TRANSITIONS=102} [2025-03-04 15:27:49,025 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 8 predicate places. [2025-03-04 15:27:49,025 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 102 transitions, 494 flow [2025-03-04 15:27:49,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 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-03-04 15:27:49,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:49,026 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:49,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 15:27:49,026 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-04 15:27:49,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:49,026 INFO L85 PathProgramCache]: Analyzing trace with hash 22770829, now seen corresponding path program 1 times [2025-03-04 15:27:49,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:49,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977620529] [2025-03-04 15:27:49,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:49,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:49,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 15:27:49,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 15:27:49,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:49,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:49,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:27:49,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:49,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977620529] [2025-03-04 15:27:49,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977620529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:49,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:49,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:27:49,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636927588] [2025-03-04 15:27:49,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:49,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:27:49,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:49,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:27:49,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:27:49,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 87 [2025-03-04 15:27:49,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 102 transitions, 494 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:49,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:49,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 87 [2025-03-04 15:27:49,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:50,874 INFO L124 PetriNetUnfolderBase]: 26991/38864 cut-off events. [2025-03-04 15:27:50,874 INFO L125 PetriNetUnfolderBase]: For 17207/19370 co-relation queries the response was YES. [2025-03-04 15:27:51,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91720 conditions, 38864 events. 26991/38864 cut-off events. For 17207/19370 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 225872 event pairs, 14081 based on Foata normal form. 452/33490 useless extension candidates. Maximal degree in co-relation 91696. Up to 24066 conditions per place. [2025-03-04 15:27:51,130 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 103 selfloop transitions, 4 changer transitions 1/124 dead transitions. [2025-03-04 15:27:51,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 124 transitions, 776 flow [2025-03-04 15:27:51,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:27:51,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:27:51,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2025-03-04 15:27:51,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5363984674329502 [2025-03-04 15:27:51,132 INFO L175 Difference]: Start difference. First operand has 83 places, 102 transitions, 494 flow. Second operand 3 states and 140 transitions. [2025-03-04 15:27:51,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 124 transitions, 776 flow [2025-03-04 15:27:51,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 124 transitions, 759 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 15:27:51,140 INFO L231 Difference]: Finished difference. Result has 85 places, 102 transitions, 494 flow [2025-03-04 15:27:51,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=494, PETRI_PLACES=85, PETRI_TRANSITIONS=102} [2025-03-04 15:27:51,140 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 10 predicate places. [2025-03-04 15:27:51,140 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 102 transitions, 494 flow [2025-03-04 15:27:51,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:51,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:51,142 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:51,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 15:27:51,142 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-04 15:27:51,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:51,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1354226498, now seen corresponding path program 1 times [2025-03-04 15:27:51,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:51,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536229279] [2025-03-04 15:27:51,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:51,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:51,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 15:27:51,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 15:27:51,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:51,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:51,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:27:51,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:51,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536229279] [2025-03-04 15:27:51,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536229279] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:27:51,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041347968] [2025-03-04 15:27:51,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:51,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:51,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:27:51,268 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:27:51,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 15:27:51,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 15:27:51,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 15:27:51,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:51,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:51,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:27:51,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:27:51,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:27:51,376 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:27:51,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041347968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:51,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:27:51,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-04 15:27:51,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163583479] [2025-03-04 15:27:51,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:51,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:27:51,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:51,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:27:51,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:27:51,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 87 [2025-03-04 15:27:51,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 102 transitions, 494 flow. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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-03-04 15:27:51,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:51,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 87 [2025-03-04 15:27:51,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:53,101 INFO L124 PetriNetUnfolderBase]: 16299/24739 cut-off events. [2025-03-04 15:27:53,101 INFO L125 PetriNetUnfolderBase]: For 17408/19201 co-relation queries the response was YES. [2025-03-04 15:27:53,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58685 conditions, 24739 events. 16299/24739 cut-off events. For 17408/19201 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 155001 event pairs, 12973 based on Foata normal form. 1360/21569 useless extension candidates. Maximal degree in co-relation 58661. Up to 21771 conditions per place. [2025-03-04 15:27:53,256 INFO L140 encePairwiseOnDemand]: 84/87 looper letters, 76 selfloop transitions, 1 changer transitions 0/100 dead transitions. [2025-03-04 15:27:53,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 100 transitions, 640 flow [2025-03-04 15:27:53,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:27:53,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:27:53,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2025-03-04 15:27:53,257 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4827586206896552 [2025-03-04 15:27:53,257 INFO L175 Difference]: Start difference. First operand has 85 places, 102 transitions, 494 flow. Second operand 3 states and 126 transitions. [2025-03-04 15:27:53,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 100 transitions, 640 flow [2025-03-04 15:27:53,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 100 transitions, 620 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-04 15:27:53,268 INFO L231 Difference]: Finished difference. Result has 82 places, 100 transitions, 468 flow [2025-03-04 15:27:53,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=82, PETRI_TRANSITIONS=100} [2025-03-04 15:27:53,269 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 7 predicate places. [2025-03-04 15:27:53,269 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 100 transitions, 468 flow [2025-03-04 15:27:53,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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-03-04 15:27:53,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:53,269 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:53,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 15:27:53,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 15:27:53,470 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-04 15:27:53,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:53,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1264785369, now seen corresponding path program 1 times [2025-03-04 15:27:53,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:53,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496200865] [2025-03-04 15:27:53,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:53,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:53,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 15:27:53,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 15:27:53,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:53,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:53,506 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:27:53,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:53,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496200865] [2025-03-04 15:27:53,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496200865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:53,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:53,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:27:53,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484279832] [2025-03-04 15:27:53,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:53,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:27:53,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:53,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:27:53,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:27:53,515 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 87 [2025-03-04 15:27:53,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 100 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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-03-04 15:27:53,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:53,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 87 [2025-03-04 15:27:53,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:55,830 INFO L124 PetriNetUnfolderBase]: 25849/37649 cut-off events. [2025-03-04 15:27:55,830 INFO L125 PetriNetUnfolderBase]: For 19530/22318 co-relation queries the response was YES. [2025-03-04 15:27:55,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89734 conditions, 37649 events. 25849/37649 cut-off events. For 19530/22318 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 221480 event pairs, 16025 based on Foata normal form. 640/32464 useless extension candidates. Maximal degree in co-relation 89710. Up to 27157 conditions per place. [2025-03-04 15:27:56,029 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 101 selfloop transitions, 4 changer transitions 0/121 dead transitions. [2025-03-04 15:27:56,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 121 transitions, 740 flow [2025-03-04 15:27:56,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:27:56,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:27:56,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2025-03-04 15:27:56,030 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5287356321839081 [2025-03-04 15:27:56,030 INFO L175 Difference]: Start difference. First operand has 82 places, 100 transitions, 468 flow. Second operand 3 states and 138 transitions. [2025-03-04 15:27:56,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 121 transitions, 740 flow [2025-03-04 15:27:56,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 121 transitions, 739 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:27:56,038 INFO L231 Difference]: Finished difference. Result has 85 places, 101 transitions, 493 flow [2025-03-04 15:27:56,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=493, PETRI_PLACES=85, PETRI_TRANSITIONS=101} [2025-03-04 15:27:56,039 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 10 predicate places. [2025-03-04 15:27:56,039 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 101 transitions, 493 flow [2025-03-04 15:27:56,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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-03-04 15:27:56,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:56,039 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:56,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 15:27:56,039 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-04 15:27:56,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:56,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1859662156, now seen corresponding path program 1 times [2025-03-04 15:27:56,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:56,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253107391] [2025-03-04 15:27:56,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:56,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:56,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 15:27:56,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 15:27:56,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:56,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:56,151 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 15:27:56,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:56,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253107391] [2025-03-04 15:27:56,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253107391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:56,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:56,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:27:56,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056640750] [2025-03-04 15:27:56,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:56,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:27:56,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:56,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:27:56,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:27:56,153 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 87 [2025-03-04 15:27:56,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 101 transitions, 493 flow. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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-03-04 15:27:56,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:56,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 87 [2025-03-04 15:27:56,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:58,211 INFO L124 PetriNetUnfolderBase]: 27356/42138 cut-off events. [2025-03-04 15:27:58,211 INFO L125 PetriNetUnfolderBase]: For 26581/29479 co-relation queries the response was YES. [2025-03-04 15:27:58,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99402 conditions, 42138 events. 27356/42138 cut-off events. For 26581/29479 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 276460 event pairs, 22206 based on Foata normal form. 120/34615 useless extension candidates. Maximal degree in co-relation 99377. Up to 27867 conditions per place. [2025-03-04 15:27:58,442 INFO L140 encePairwiseOnDemand]: 79/87 looper letters, 69 selfloop transitions, 7 changer transitions 43/143 dead transitions. [2025-03-04 15:27:58,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 143 transitions, 915 flow [2025-03-04 15:27:58,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:27:58,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:27:58,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 218 transitions. [2025-03-04 15:27:58,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5011494252873563 [2025-03-04 15:27:58,443 INFO L175 Difference]: Start difference. First operand has 85 places, 101 transitions, 493 flow. Second operand 5 states and 218 transitions. [2025-03-04 15:27:58,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 143 transitions, 915 flow [2025-03-04 15:27:58,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 143 transitions, 901 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:27:58,461 INFO L231 Difference]: Finished difference. Result has 89 places, 100 transitions, 508 flow [2025-03-04 15:27:58,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=508, PETRI_PLACES=89, PETRI_TRANSITIONS=100} [2025-03-04 15:27:58,461 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 14 predicate places. [2025-03-04 15:27:58,461 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 100 transitions, 508 flow [2025-03-04 15:27:58,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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-03-04 15:27:58,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:58,462 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:58,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 15:27:58,462 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-04 15:27:58,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:58,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1821719210, now seen corresponding path program 1 times [2025-03-04 15:27:58,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:58,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269030379] [2025-03-04 15:27:58,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:58,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:58,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 15:27:58,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 15:27:58,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:58,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:58,598 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 15:27:58,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:58,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269030379] [2025-03-04 15:27:58,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269030379] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:27:58,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263896957] [2025-03-04 15:27:58,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:58,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:58,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:27:58,601 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:27:58,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 15:27:58,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 15:27:58,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 15:27:58,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:58,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:58,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:27:58,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:27:58,740 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 15:27:58,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:27:58,905 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 15:27:58,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263896957] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:27:58,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:27:58,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 4] total 11 [2025-03-04 15:27:58,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923507808] [2025-03-04 15:27:58,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:27:58,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 15:27:58,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:58,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 15:27:58,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:27:58,949 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 87 [2025-03-04 15:27:58,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 100 transitions, 508 flow. Second operand has 11 states, 11 states have (on average 28.818181818181817) internal successors, (317), 11 states have internal predecessors, (317), 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-03-04 15:27:58,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:58,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 87 [2025-03-04 15:27:58,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:08,716 INFO L124 PetriNetUnfolderBase]: 95901/148589 cut-off events. [2025-03-04 15:28:08,716 INFO L125 PetriNetUnfolderBase]: For 90972/103082 co-relation queries the response was YES. [2025-03-04 15:28:09,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339799 conditions, 148589 events. 95901/148589 cut-off events. For 90972/103082 co-relation queries the response was YES. Maximal size of possible extension queue 1909. Compared 1146746 event pairs, 39746 based on Foata normal form. 3792/121265 useless extension candidates. Maximal degree in co-relation 339771. Up to 28453 conditions per place. [2025-03-04 15:28:09,582 INFO L140 encePairwiseOnDemand]: 71/87 looper letters, 103 selfloop transitions, 24 changer transitions 91/242 dead transitions. [2025-03-04 15:28:09,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 242 transitions, 1514 flow [2025-03-04 15:28:09,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:28:09,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:28:09,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 469 transitions. [2025-03-04 15:28:09,584 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4146772767462423 [2025-03-04 15:28:09,584 INFO L175 Difference]: Start difference. First operand has 89 places, 100 transitions, 508 flow. Second operand 13 states and 469 transitions. [2025-03-04 15:28:09,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 242 transitions, 1514 flow [2025-03-04 15:28:09,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 242 transitions, 1474 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-03-04 15:28:09,651 INFO L231 Difference]: Finished difference. Result has 102 places, 105 transitions, 651 flow [2025-03-04 15:28:09,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=651, PETRI_PLACES=102, PETRI_TRANSITIONS=105} [2025-03-04 15:28:09,652 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 27 predicate places. [2025-03-04 15:28:09,652 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 105 transitions, 651 flow [2025-03-04 15:28:09,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 28.818181818181817) internal successors, (317), 11 states have internal predecessors, (317), 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-03-04 15:28:09,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:09,652 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:09,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 15:28:09,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 15:28:09,853 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-04 15:28:09,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:09,855 INFO L85 PathProgramCache]: Analyzing trace with hash -25861166, now seen corresponding path program 2 times [2025-03-04 15:28:09,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:09,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826662706] [2025-03-04 15:28:09,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:28:09,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:09,866 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-04 15:28:09,870 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 51 statements. [2025-03-04 15:28:09,871 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:28:09,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:10,049 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-04 15:28:10,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:10,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826662706] [2025-03-04 15:28:10,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826662706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:10,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:28:10,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:28:10,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870872070] [2025-03-04 15:28:10,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:10,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:28:10,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:10,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:28:10,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:28:10,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 87 [2025-03-04 15:28:10,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 105 transitions, 651 flow. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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-03-04 15:28:10,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:10,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 87 [2025-03-04 15:28:10,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand