./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-node-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 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/chl-node-symm.wvr.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 9db11e263e78e3a6bd75c2a0c3dda64920ec857df2fbb1d0b7b1072a48f36a31 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:41:38,889 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:41:38,944 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 19:41:38,949 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:41:38,949 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:41:38,966 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:41:38,967 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:41:38,967 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:41:38,967 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:41:38,967 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:41:38,967 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 19:41:38,967 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 19:41:38,967 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:41:38,967 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:41:38,967 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:41:38,968 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:41:38,968 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 19:41:38,968 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 19:41:38,968 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:41:38,968 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 19:41:38,968 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:41:38,969 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 19:41:38,969 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 19:41:38,969 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 19:41:38,969 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 19:41:38,969 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:41:38,969 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 19:41:38,970 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:41:38,970 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:41:38,970 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:41:38,970 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:41:38,970 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:41:38,970 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 19:41:38,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 19:41:38,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:41:38,970 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:41:38,970 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 19:41:38,970 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 19:41:38,970 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 19:41:38,970 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:41:38,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 19:41:38,970 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 19:41:38,970 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 19:41:38,970 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 19:41:38,970 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 19:41:38,971 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 -> 9db11e263e78e3a6bd75c2a0c3dda64920ec857df2fbb1d0b7b1072a48f36a31 [2025-03-17 19:41:39,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:41:39,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:41:39,180 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:41:39,181 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:41:39,181 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:41:39,183 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-symm.wvr.c [2025-03-17 19:41:40,342 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0cb4cf15/09ccf72db7154950b9dad852f4a34b45/FLAG499d8cda1 [2025-03-17 19:41:40,577 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:41:40,578 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-symm.wvr.c [2025-03-17 19:41:40,591 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0cb4cf15/09ccf72db7154950b9dad852f4a34b45/FLAG499d8cda1 [2025-03-17 19:41:40,921 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0cb4cf15/09ccf72db7154950b9dad852f4a34b45 [2025-03-17 19:41:40,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:41:40,923 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:41:40,924 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:41:40,924 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:41:40,927 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:41:40,927 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:41:40" (1/1) ... [2025-03-17 19:41:40,928 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69135a90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:41:40, skipping insertion in model container [2025-03-17 19:41:40,928 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:41:40" (1/1) ... [2025-03-17 19:41:40,939 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:41:41,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:41:41,099 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:41:41,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:41:41,141 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:41:41,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:41:41 WrapperNode [2025-03-17 19:41:41,141 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:41:41,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:41:41,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:41:41,142 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:41:41,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:41:41" (1/1) ... [2025-03-17 19:41:41,157 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:41:41" (1/1) ... [2025-03-17 19:41:41,176 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 19, calls inlined = 25, statements flattened = 325 [2025-03-17 19:41:41,176 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:41:41,177 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:41:41,177 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:41:41,177 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:41:41,184 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:41:41" (1/1) ... [2025-03-17 19:41:41,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:41:41" (1/1) ... [2025-03-17 19:41:41,186 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:41:41" (1/1) ... [2025-03-17 19:41:41,198 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 10, 6]. 56 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 4 writes are split as follows [0, 2, 2]. [2025-03-17 19:41:41,198 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:41:41" (1/1) ... [2025-03-17 19:41:41,198 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:41:41" (1/1) ... [2025-03-17 19:41:41,206 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:41:41" (1/1) ... [2025-03-17 19:41:41,207 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:41:41" (1/1) ... [2025-03-17 19:41:41,208 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:41:41" (1/1) ... [2025-03-17 19:41:41,209 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:41:41" (1/1) ... [2025-03-17 19:41:41,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:41:41,212 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:41:41,212 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:41:41,213 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:41:41,213 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:41:41" (1/1) ... [2025-03-17 19:41:41,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:41:41,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:41:41,242 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-17 19:41:41,244 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-17 19:41:41,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 19:41:41,264 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 19:41:41,264 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 19:41:41,264 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 19:41:41,264 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 19:41:41,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 19:41:41,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 19:41:41,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 19:41:41,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 19:41:41,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 19:41:41,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 19:41:41,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 19:41:41,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:41:41,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:41:41,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 19:41:41,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 19:41:41,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 19:41:41,266 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 19:41:41,368 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:41:41,370 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:41:41,812 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 19:41:41,813 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:41:42,088 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:41:42,089 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:41:42,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:41:42 BoogieIcfgContainer [2025-03-17 19:41:42,089 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:41:42,091 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 19:41:42,091 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 19:41:42,094 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 19:41:42,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:41:40" (1/3) ... [2025-03-17 19:41:42,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@563554a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:41:42, skipping insertion in model container [2025-03-17 19:41:42,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:41:41" (2/3) ... [2025-03-17 19:41:42,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@563554a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:41:42, skipping insertion in model container [2025-03-17 19:41:42,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:41:42" (3/3) ... [2025-03-17 19:41:42,096 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-symm.wvr.c [2025-03-17 19:41:42,107 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 19:41:42,109 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-symm.wvr.c that has 3 procedures, 88 locations, 1 initial locations, 4 loop locations, and 30 error locations. [2025-03-17 19:41:42,109 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 19:41:42,155 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 19:41:42,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 97 transitions, 208 flow [2025-03-17 19:41:42,217 INFO L124 PetriNetUnfolderBase]: 10/95 cut-off events. [2025-03-17 19:41:42,220 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 19:41:42,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 95 events. 10/95 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 254 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2025-03-17 19:41:42,224 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 97 transitions, 208 flow [2025-03-17 19:41:42,227 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 94 transitions, 200 flow [2025-03-17 19:41:42,235 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 19:41:42,246 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;@224adc79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 19:41:42,246 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2025-03-17 19:41:42,248 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 19:41:42,248 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-03-17 19:41:42,248 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 19:41:42,248 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:42,251 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-17 19:41:42,251 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:41:42,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:42,255 INFO L85 PathProgramCache]: Analyzing trace with hash 29516, now seen corresponding path program 1 times [2025-03-17 19:41:42,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:42,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747380742] [2025-03-17 19:41:42,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:42,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:42,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:41:42,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:41:42,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:42,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:42,415 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-17 19:41:42,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:42,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747380742] [2025-03-17 19:41:42,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747380742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:41:42,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:41:42,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:41:42,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087223898] [2025-03-17 19:41:42,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:41:42,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:41:42,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:42,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:41:42,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:41:42,457 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-03-17 19:41:42,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 94 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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-17 19:41:42,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:42,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-03-17 19:41:42,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:42,676 INFO L124 PetriNetUnfolderBase]: 281/738 cut-off events. [2025-03-17 19:41:42,677 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-17 19:41:42,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1210 conditions, 738 events. 281/738 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4452 event pairs, 172 based on Foata normal form. 4/570 useless extension candidates. Maximal degree in co-relation 1097. Up to 444 conditions per place. [2025-03-17 19:41:42,686 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 41 selfloop transitions, 1 changer transitions 2/90 dead transitions. [2025-03-17 19:41:42,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 90 transitions, 278 flow [2025-03-17 19:41:42,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:41:42,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:41:42,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2025-03-17 19:41:42,697 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-17 19:41:42,698 INFO L175 Difference]: Start difference. First operand has 91 places, 94 transitions, 200 flow. Second operand 3 states and 194 transitions. [2025-03-17 19:41:42,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 90 transitions, 278 flow [2025-03-17 19:41:42,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 90 transitions, 270 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 19:41:42,704 INFO L231 Difference]: Finished difference. Result has 85 places, 88 transitions, 181 flow [2025-03-17 19:41:42,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=85, PETRI_TRANSITIONS=88} [2025-03-17 19:41:42,711 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -6 predicate places. [2025-03-17 19:41:42,711 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 88 transitions, 181 flow [2025-03-17 19:41:42,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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-17 19:41:42,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:42,712 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 19:41:42,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 19:41:42,712 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:41:42,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:42,713 INFO L85 PathProgramCache]: Analyzing trace with hash 915875, now seen corresponding path program 1 times [2025-03-17 19:41:42,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:42,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415620975] [2025-03-17 19:41:42,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:42,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:42,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:41:42,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:41:42,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:42,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:42,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:41:42,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:42,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415620975] [2025-03-17 19:41:42,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415620975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:41:42,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:41:42,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:41:42,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521717106] [2025-03-17 19:41:42,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:41:42,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:41:42,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:42,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:41:42,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:41:42,789 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-03-17 19:41:42,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 88 transitions, 181 flow. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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-17 19:41:42,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:42,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-03-17 19:41:42,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:42,921 INFO L124 PetriNetUnfolderBase]: 281/734 cut-off events. [2025-03-17 19:41:42,922 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-17 19:41:42,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1187 conditions, 734 events. 281/734 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4419 event pairs, 172 based on Foata normal form. 0/564 useless extension candidates. Maximal degree in co-relation 1181. Up to 441 conditions per place. [2025-03-17 19:41:42,930 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 39 selfloop transitions, 1 changer transitions 0/86 dead transitions. [2025-03-17 19:41:42,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 86 transitions, 257 flow [2025-03-17 19:41:42,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:41:42,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:41:42,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2025-03-17 19:41:42,933 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6494845360824743 [2025-03-17 19:41:42,933 INFO L175 Difference]: Start difference. First operand has 85 places, 88 transitions, 181 flow. Second operand 3 states and 189 transitions. [2025-03-17 19:41:42,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 86 transitions, 257 flow [2025-03-17 19:41:42,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 86 transitions, 256 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:41:42,936 INFO L231 Difference]: Finished difference. Result has 82 places, 86 transitions, 178 flow [2025-03-17 19:41:42,937 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=82, PETRI_TRANSITIONS=86} [2025-03-17 19:41:42,937 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -9 predicate places. [2025-03-17 19:41:42,937 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 86 transitions, 178 flow [2025-03-17 19:41:42,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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-17 19:41:42,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:42,939 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 19:41:42,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 19:41:42,939 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:41:42,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:42,940 INFO L85 PathProgramCache]: Analyzing trace with hash 880183374, now seen corresponding path program 1 times [2025-03-17 19:41:42,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:42,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384690685] [2025-03-17 19:41:42,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:42,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:42,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:41:42,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:41:42,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:42,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:43,037 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-17 19:41:43,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:43,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384690685] [2025-03-17 19:41:43,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384690685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:41:43,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:41:43,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:41:43,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420450556] [2025-03-17 19:41:43,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:41:43,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:41:43,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:43,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:41:43,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:41:43,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-03-17 19:41:43,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 86 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 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-17 19:41:43,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:43,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-03-17 19:41:43,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:43,199 INFO L124 PetriNetUnfolderBase]: 283/742 cut-off events. [2025-03-17 19:41:43,199 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-17 19:41:43,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1206 conditions, 742 events. 283/742 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4463 event pairs, 172 based on Foata normal form. 2/572 useless extension candidates. Maximal degree in co-relation 1199. Up to 448 conditions per place. [2025-03-17 19:41:43,203 INFO L140 encePairwiseOnDemand]: 85/97 looper letters, 42 selfloop transitions, 8 changer transitions 0/92 dead transitions. [2025-03-17 19:41:43,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 92 transitions, 290 flow [2025-03-17 19:41:43,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:41:43,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:41:43,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2025-03-17 19:41:43,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6443298969072165 [2025-03-17 19:41:43,204 INFO L175 Difference]: Start difference. First operand has 82 places, 86 transitions, 178 flow. Second operand 4 states and 250 transitions. [2025-03-17 19:41:43,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 92 transitions, 290 flow [2025-03-17 19:41:43,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 92 transitions, 289 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:41:43,206 INFO L231 Difference]: Finished difference. Result has 86 places, 92 transitions, 235 flow [2025-03-17 19:41:43,206 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=235, PETRI_PLACES=86, PETRI_TRANSITIONS=92} [2025-03-17 19:41:43,207 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -5 predicate places. [2025-03-17 19:41:43,207 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 92 transitions, 235 flow [2025-03-17 19:41:43,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 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-17 19:41:43,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:43,207 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 19:41:43,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 19:41:43,207 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:41:43,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:43,211 INFO L85 PathProgramCache]: Analyzing trace with hash 880183444, now seen corresponding path program 1 times [2025-03-17 19:41:43,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:43,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140089595] [2025-03-17 19:41:43,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:43,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:43,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:41:43,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:41:43,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:43,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:43,266 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-17 19:41:43,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:43,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140089595] [2025-03-17 19:41:43,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140089595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:41:43,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:41:43,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:41:43,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717540847] [2025-03-17 19:41:43,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:41:43,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:41:43,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:43,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:41:43,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:41:43,276 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-03-17 19:41:43,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 92 transitions, 235 flow. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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-17 19:41:43,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:43,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-03-17 19:41:43,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:43,370 INFO L124 PetriNetUnfolderBase]: 283/740 cut-off events. [2025-03-17 19:41:43,370 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-17 19:41:43,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1228 conditions, 740 events. 283/740 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4468 event pairs, 172 based on Foata normal form. 2/575 useless extension candidates. Maximal degree in co-relation 1219. Up to 449 conditions per place. [2025-03-17 19:41:43,373 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 47 selfloop transitions, 1 changer transitions 0/90 dead transitions. [2025-03-17 19:41:43,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 90 transitions, 327 flow [2025-03-17 19:41:43,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:41:43,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:41:43,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2025-03-17 19:41:43,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6563573883161512 [2025-03-17 19:41:43,375 INFO L175 Difference]: Start difference. First operand has 86 places, 92 transitions, 235 flow. Second operand 3 states and 191 transitions. [2025-03-17 19:41:43,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 90 transitions, 327 flow [2025-03-17 19:41:43,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 90 transitions, 321 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:41:43,377 INFO L231 Difference]: Finished difference. Result has 85 places, 90 transitions, 227 flow [2025-03-17 19:41:43,377 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=227, PETRI_PLACES=85, PETRI_TRANSITIONS=90} [2025-03-17 19:41:43,378 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -6 predicate places. [2025-03-17 19:41:43,378 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 90 transitions, 227 flow [2025-03-17 19:41:43,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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-17 19:41:43,378 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:43,378 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:41:43,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 19:41:43,378 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:41:43,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:43,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1515883825, now seen corresponding path program 1 times [2025-03-17 19:41:43,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:43,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790308569] [2025-03-17 19:41:43,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:43,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:43,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:41:43,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:41:43,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:43,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:43,433 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-17 19:41:43,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:43,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790308569] [2025-03-17 19:41:43,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790308569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:41:43,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:41:43,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:41:43,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084808132] [2025-03-17 19:41:43,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:41:43,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:41:43,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:43,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:41:43,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:41:43,441 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-03-17 19:41:43,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 90 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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-17 19:41:43,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:43,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-03-17 19:41:43,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:43,549 INFO L124 PetriNetUnfolderBase]: 283/738 cut-off events. [2025-03-17 19:41:43,549 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-17 19:41:43,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1221 conditions, 738 events. 283/738 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4470 event pairs, 172 based on Foata normal form. 1/573 useless extension candidates. Maximal degree in co-relation 1211. Up to 447 conditions per place. [2025-03-17 19:41:43,554 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 45 selfloop transitions, 1 changer transitions 0/88 dead transitions. [2025-03-17 19:41:43,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 88 transitions, 315 flow [2025-03-17 19:41:43,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:41:43,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:41:43,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2025-03-17 19:41:43,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6494845360824743 [2025-03-17 19:41:43,556 INFO L175 Difference]: Start difference. First operand has 85 places, 90 transitions, 227 flow. Second operand 3 states and 189 transitions. [2025-03-17 19:41:43,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 88 transitions, 315 flow [2025-03-17 19:41:43,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 88 transitions, 314 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:41:43,559 INFO L231 Difference]: Finished difference. Result has 84 places, 88 transitions, 224 flow [2025-03-17 19:41:43,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=84, PETRI_TRANSITIONS=88} [2025-03-17 19:41:43,560 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -7 predicate places. [2025-03-17 19:41:43,560 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 88 transitions, 224 flow [2025-03-17 19:41:43,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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-17 19:41:43,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:43,561 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-17 19:41:43,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 19:41:43,562 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:41:43,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:43,562 INFO L85 PathProgramCache]: Analyzing trace with hash 768389415, now seen corresponding path program 1 times [2025-03-17 19:41:43,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:43,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963387673] [2025-03-17 19:41:43,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:43,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:43,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:41:43,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:41:43,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:43,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:43,658 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-17 19:41:43,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:43,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963387673] [2025-03-17 19:41:43,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963387673] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:41:43,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268013336] [2025-03-17 19:41:43,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:43,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:41:43,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:41:43,662 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-17 19:41:43,664 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-17 19:41:43,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:41:43,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:41:43,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:43,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:43,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:41:43,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:41:43,761 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-17 19:41:43,761 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:41:43,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268013336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:41:43,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:41:43,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-17 19:41:43,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999685095] [2025-03-17 19:41:43,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:41:43,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:41:43,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:43,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:41:43,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:41:43,774 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-03-17 19:41:43,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 88 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 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-17 19:41:43,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:43,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-03-17 19:41:43,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:43,929 INFO L124 PetriNetUnfolderBase]: 283/736 cut-off events. [2025-03-17 19:41:43,929 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-17 19:41:43,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1220 conditions, 736 events. 283/736 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4453 event pairs, 172 based on Foata normal form. 2/570 useless extension candidates. Maximal degree in co-relation 1209. Up to 438 conditions per place. [2025-03-17 19:41:43,933 INFO L140 encePairwiseOnDemand]: 87/97 looper letters, 34 selfloop transitions, 14 changer transitions 0/86 dead transitions. [2025-03-17 19:41:43,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 86 transitions, 312 flow [2025-03-17 19:41:43,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:41:43,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 19:41:43,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 344 transitions. [2025-03-17 19:41:43,936 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5910652920962199 [2025-03-17 19:41:43,936 INFO L175 Difference]: Start difference. First operand has 84 places, 88 transitions, 224 flow. Second operand 6 states and 344 transitions. [2025-03-17 19:41:43,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 86 transitions, 312 flow [2025-03-17 19:41:43,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 86 transitions, 311 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:41:43,939 INFO L231 Difference]: Finished difference. Result has 86 places, 86 transitions, 243 flow [2025-03-17 19:41:43,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=243, PETRI_PLACES=86, PETRI_TRANSITIONS=86} [2025-03-17 19:41:43,940 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -5 predicate places. [2025-03-17 19:41:43,941 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 86 transitions, 243 flow [2025-03-17 19:41:43,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 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-17 19:41:43,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:43,941 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-03-17 19:41:43,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 19:41:44,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-17 19:41:44,146 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:41:44,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:44,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1949731069, now seen corresponding path program 1 times [2025-03-17 19:41:44,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:44,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595683444] [2025-03-17 19:41:44,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:44,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:44,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:41:44,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:41:44,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:44,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:44,223 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-17 19:41:44,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:44,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595683444] [2025-03-17 19:41:44,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595683444] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:41:44,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991154099] [2025-03-17 19:41:44,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:44,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:41:44,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:41:44,225 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-17 19:41:44,226 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-17 19:41:44,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:41:44,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:41:44,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:44,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:44,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:41:44,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:41:44,301 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-17 19:41:44,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:41:44,330 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-17 19:41:44,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991154099] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:41:44,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:41:44,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-17 19:41:44,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179657970] [2025-03-17 19:41:44,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:41:44,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 19:41:44,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:44,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 19:41:44,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 19:41:44,357 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-03-17 19:41:44,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 86 transitions, 243 flow. Second operand has 12 states, 12 states have (on average 50.166666666666664) internal successors, (602), 12 states have internal predecessors, (602), 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-17 19:41:44,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:44,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-03-17 19:41:44,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:44,575 INFO L124 PetriNetUnfolderBase]: 289/760 cut-off events. [2025-03-17 19:41:44,575 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-03-17 19:41:44,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1312 conditions, 760 events. 289/760 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4601 event pairs, 172 based on Foata normal form. 6/594 useless extension candidates. Maximal degree in co-relation 1301. Up to 452 conditions per place. [2025-03-17 19:41:44,582 INFO L140 encePairwiseOnDemand]: 87/97 looper letters, 40 selfloop transitions, 26 changer transitions 0/104 dead transitions. [2025-03-17 19:41:44,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 104 transitions, 483 flow [2025-03-17 19:41:44,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 19:41:44,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 19:41:44,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 562 transitions. [2025-03-17 19:41:44,586 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5793814432989691 [2025-03-17 19:41:44,586 INFO L175 Difference]: Start difference. First operand has 86 places, 86 transitions, 243 flow. Second operand 10 states and 562 transitions. [2025-03-17 19:41:44,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 104 transitions, 483 flow [2025-03-17 19:41:44,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 104 transitions, 423 flow, removed 16 selfloop flow, removed 4 redundant places. [2025-03-17 19:41:44,589 INFO L231 Difference]: Finished difference. Result has 94 places, 104 transitions, 379 flow [2025-03-17 19:41:44,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=379, PETRI_PLACES=94, PETRI_TRANSITIONS=104} [2025-03-17 19:41:44,593 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 3 predicate places. [2025-03-17 19:41:44,593 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 104 transitions, 379 flow [2025-03-17 19:41:44,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 50.166666666666664) internal successors, (602), 12 states have internal predecessors, (602), 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-17 19:41:44,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:44,594 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:41:44,600 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-17 19:41:44,798 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,SelfDestructingSolverStorable6 [2025-03-17 19:41:44,798 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:41:44,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:44,799 INFO L85 PathProgramCache]: Analyzing trace with hash 826285874, now seen corresponding path program 1 times [2025-03-17 19:41:44,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:44,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893819742] [2025-03-17 19:41:44,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:44,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:44,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:41:44,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:41:44,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:44,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:44,879 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-17 19:41:44,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:44,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893819742] [2025-03-17 19:41:44,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893819742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:41:44,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:41:44,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:41:44,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426550589] [2025-03-17 19:41:44,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:41:44,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:41:44,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:44,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:41:44,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:41:44,888 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-03-17 19:41:44,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 104 transitions, 379 flow. Second operand has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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-17 19:41:44,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:44,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-03-17 19:41:44,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:45,040 INFO L124 PetriNetUnfolderBase]: 291/768 cut-off events. [2025-03-17 19:41:45,040 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2025-03-17 19:41:45,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1340 conditions, 768 events. 291/768 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4638 event pairs, 172 based on Foata normal form. 2/602 useless extension candidates. Maximal degree in co-relation 1327. Up to 472 conditions per place. [2025-03-17 19:41:45,044 INFO L140 encePairwiseOnDemand]: 85/97 looper letters, 66 selfloop transitions, 8 changer transitions 0/110 dead transitions. [2025-03-17 19:41:45,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 110 transitions, 539 flow [2025-03-17 19:41:45,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:41:45,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:41:45,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2025-03-17 19:41:45,045 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6443298969072165 [2025-03-17 19:41:45,045 INFO L175 Difference]: Start difference. First operand has 94 places, 104 transitions, 379 flow. Second operand 4 states and 250 transitions. [2025-03-17 19:41:45,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 110 transitions, 539 flow [2025-03-17 19:41:45,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 110 transitions, 517 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-17 19:41:45,048 INFO L231 Difference]: Finished difference. Result has 97 places, 110 transitions, 415 flow [2025-03-17 19:41:45,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=415, PETRI_PLACES=97, PETRI_TRANSITIONS=110} [2025-03-17 19:41:45,049 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 6 predicate places. [2025-03-17 19:41:45,049 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 110 transitions, 415 flow [2025-03-17 19:41:45,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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-17 19:41:45,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:45,049 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:41:45,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 19:41:45,049 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:41:45,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:45,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1425767069, now seen corresponding path program 1 times [2025-03-17 19:41:45,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:45,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435955610] [2025-03-17 19:41:45,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:45,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:45,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 19:41:45,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 19:41:45,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:45,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:45,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:41:45,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:45,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435955610] [2025-03-17 19:41:45,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435955610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:41:45,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:41:45,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:41:45,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77427650] [2025-03-17 19:41:45,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:41:45,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:41:45,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:45,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:41:45,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:41:45,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-03-17 19:41:45,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 110 transitions, 415 flow. Second operand has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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-17 19:41:45,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:45,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-03-17 19:41:45,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:45,261 INFO L124 PetriNetUnfolderBase]: 290/767 cut-off events. [2025-03-17 19:41:45,261 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2025-03-17 19:41:45,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1350 conditions, 767 events. 290/767 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4609 event pairs, 172 based on Foata normal form. 1/604 useless extension candidates. Maximal degree in co-relation 1334. Up to 468 conditions per place. [2025-03-17 19:41:45,265 INFO L140 encePairwiseOnDemand]: 93/97 looper letters, 66 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2025-03-17 19:41:45,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 109 transitions, 549 flow [2025-03-17 19:41:45,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:41:45,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:41:45,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2025-03-17 19:41:45,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.615979381443299 [2025-03-17 19:41:45,266 INFO L175 Difference]: Start difference. First operand has 97 places, 110 transitions, 415 flow. Second operand 4 states and 239 transitions. [2025-03-17 19:41:45,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 109 transitions, 549 flow [2025-03-17 19:41:45,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 109 transitions, 543 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:41:45,269 INFO L231 Difference]: Finished difference. Result has 99 places, 109 transitions, 411 flow [2025-03-17 19:41:45,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=411, PETRI_PLACES=99, PETRI_TRANSITIONS=109} [2025-03-17 19:41:45,269 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 8 predicate places. [2025-03-17 19:41:45,269 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 109 transitions, 411 flow [2025-03-17 19:41:45,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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-17 19:41:45,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:45,270 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:41:45,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 19:41:45,270 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:41:45,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:45,270 INFO L85 PathProgramCache]: Analyzing trace with hash 139671012, now seen corresponding path program 1 times [2025-03-17 19:41:45,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:45,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485050044] [2025-03-17 19:41:45,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:45,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:45,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 19:41:45,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 19:41:45,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:45,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:45,363 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-17 19:41:45,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:45,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485050044] [2025-03-17 19:41:45,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485050044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:41:45,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:41:45,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:41:45,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530011121] [2025-03-17 19:41:45,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:41:45,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:41:45,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:45,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:41:45,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:41:45,376 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-03-17 19:41:45,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 109 transitions, 411 flow. Second operand has 4 states, 4 states have (on average 51.5) internal successors, (206), 4 states have internal predecessors, (206), 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-17 19:41:45,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:45,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-03-17 19:41:45,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:45,519 INFO L124 PetriNetUnfolderBase]: 289/766 cut-off events. [2025-03-17 19:41:45,519 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2025-03-17 19:41:45,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1346 conditions, 766 events. 289/766 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4558 event pairs, 172 based on Foata normal form. 1/603 useless extension candidates. Maximal degree in co-relation 1329. Up to 467 conditions per place. [2025-03-17 19:41:45,522 INFO L140 encePairwiseOnDemand]: 93/97 looper letters, 65 selfloop transitions, 3 changer transitions 0/108 dead transitions. [2025-03-17 19:41:45,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 108 transitions, 543 flow [2025-03-17 19:41:45,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:41:45,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:41:45,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2025-03-17 19:41:45,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.615979381443299 [2025-03-17 19:41:45,524 INFO L175 Difference]: Start difference. First operand has 99 places, 109 transitions, 411 flow. Second operand 4 states and 239 transitions. [2025-03-17 19:41:45,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 108 transitions, 543 flow [2025-03-17 19:41:45,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 108 transitions, 539 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:41:45,525 INFO L231 Difference]: Finished difference. Result has 100 places, 108 transitions, 409 flow [2025-03-17 19:41:45,526 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=97, 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=409, PETRI_PLACES=100, PETRI_TRANSITIONS=108} [2025-03-17 19:41:45,526 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 9 predicate places. [2025-03-17 19:41:45,526 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 108 transitions, 409 flow [2025-03-17 19:41:45,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.5) internal successors, (206), 4 states have internal predecessors, (206), 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-17 19:41:45,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:45,526 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2025-03-17 19:41:45,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 19:41:45,528 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:41:45,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:45,528 INFO L85 PathProgramCache]: Analyzing trace with hash 405346812, now seen corresponding path program 2 times [2025-03-17 19:41:45,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:45,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235506864] [2025-03-17 19:41:45,529 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:41:45,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:45,536 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-17 19:41:45,541 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-17 19:41:45,541 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:41:45,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:45,582 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-17 19:41:45,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:45,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235506864] [2025-03-17 19:41:45,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235506864] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:41:45,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139983596] [2025-03-17 19:41:45,583 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:41:45,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:41:45,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:41:45,586 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-17 19:41:45,587 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-17 19:41:45,638 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-17 19:41:45,648 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-17 19:41:45,648 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:41:45,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:45,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:41:45,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:41:45,672 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-17 19:41:45,672 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:41:45,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-17 19:41:45,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139983596] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:41:45,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:41:45,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-03-17 19:41:45,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659747540] [2025-03-17 19:41:45,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:41:45,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 19:41:45,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:45,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:41:45,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:41:45,719 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 97 [2025-03-17 19:41:45,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 108 transitions, 409 flow. Second operand has 5 states, 5 states have (on average 46.6) internal successors, (233), 5 states have internal predecessors, (233), 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-17 19:41:45,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:45,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 97 [2025-03-17 19:41:45,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:45,850 INFO L124 PetriNetUnfolderBase]: 289/764 cut-off events. [2025-03-17 19:41:45,850 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-03-17 19:41:45,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1337 conditions, 764 events. 289/764 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4562 event pairs, 172 based on Foata normal form. 2/602 useless extension candidates. Maximal degree in co-relation 1320. Up to 447 conditions per place. [2025-03-17 19:41:45,854 INFO L140 encePairwiseOnDemand]: 86/97 looper letters, 37 selfloop transitions, 31 changer transitions 0/106 dead transitions. [2025-03-17 19:41:45,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 106 transitions, 525 flow [2025-03-17 19:41:45,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:41:45,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 19:41:45,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 267 transitions. [2025-03-17 19:41:45,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5505154639175258 [2025-03-17 19:41:45,855 INFO L175 Difference]: Start difference. First operand has 100 places, 108 transitions, 409 flow. Second operand 5 states and 267 transitions. [2025-03-17 19:41:45,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 106 transitions, 525 flow [2025-03-17 19:41:45,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 106 transitions, 501 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-03-17 19:41:45,858 INFO L231 Difference]: Finished difference. Result has 96 places, 106 transitions, 427 flow [2025-03-17 19:41:45,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=427, PETRI_PLACES=96, PETRI_TRANSITIONS=106} [2025-03-17 19:41:45,859 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 5 predicate places. [2025-03-17 19:41:45,859 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 106 transitions, 427 flow [2025-03-17 19:41:45,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.6) internal successors, (233), 5 states have internal predecessors, (233), 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-17 19:41:45,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:45,859 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:41:45,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 19:41:46,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:41:46,060 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:41:46,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:46,061 INFO L85 PathProgramCache]: Analyzing trace with hash -488102011, now seen corresponding path program 1 times [2025-03-17 19:41:46,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:46,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209794162] [2025-03-17 19:41:46,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:46,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:46,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 19:41:46,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 19:41:46,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:46,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:46,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:41:46,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:46,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209794162] [2025-03-17 19:41:46,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209794162] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:41:46,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152002770] [2025-03-17 19:41:46,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:46,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:41:46,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:41:46,136 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-17 19:41:46,138 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-17 19:41:46,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 19:41:46,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 19:41:46,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:46,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:46,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 19:41:46,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:41:46,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:41:46,317 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:41:46,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:41:46,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152002770] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:41:46,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:41:46,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-17 19:41:46,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885582562] [2025-03-17 19:41:46,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:41:46,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 19:41:46,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:46,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 19:41:46,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-03-17 19:41:46,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 97 [2025-03-17 19:41:46,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 106 transitions, 427 flow. Second operand has 19 states, 19 states have (on average 42.8421052631579) internal successors, (814), 19 states have internal predecessors, (814), 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-17 19:41:46,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:46,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 97 [2025-03-17 19:41:46,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:47,106 INFO L124 PetriNetUnfolderBase]: 572/1498 cut-off events. [2025-03-17 19:41:47,107 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2025-03-17 19:41:47,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2601 conditions, 1498 events. 572/1498 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 10637 event pairs, 344 based on Foata normal form. 3/1175 useless extension candidates. Maximal degree in co-relation 2588. Up to 447 conditions per place. [2025-03-17 19:41:47,113 INFO L140 encePairwiseOnDemand]: 81/97 looper letters, 74 selfloop transitions, 47 changer transitions 0/155 dead transitions. [2025-03-17 19:41:47,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 155 transitions, 879 flow [2025-03-17 19:41:47,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 19:41:47,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-17 19:41:47,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 835 transitions. [2025-03-17 19:41:47,116 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4782359679266896 [2025-03-17 19:41:47,116 INFO L175 Difference]: Start difference. First operand has 96 places, 106 transitions, 427 flow. Second operand 18 states and 835 transitions. [2025-03-17 19:41:47,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 155 transitions, 879 flow [2025-03-17 19:41:47,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 155 transitions, 787 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 19:41:47,119 INFO L231 Difference]: Finished difference. Result has 109 places, 126 transitions, 621 flow [2025-03-17 19:41:47,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=621, PETRI_PLACES=109, PETRI_TRANSITIONS=126} [2025-03-17 19:41:47,120 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 18 predicate places. [2025-03-17 19:41:47,120 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 126 transitions, 621 flow [2025-03-17 19:41:47,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 42.8421052631579) internal successors, (814), 19 states have internal predecessors, (814), 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-17 19:41:47,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:47,120 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:41:47,128 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-17 19:41:47,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:41:47,321 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:41:47,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:47,321 INFO L85 PathProgramCache]: Analyzing trace with hash -232774820, now seen corresponding path program 1 times [2025-03-17 19:41:47,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:47,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903935260] [2025-03-17 19:41:47,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:47,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:47,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 19:41:47,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 19:41:47,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:47,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:47,394 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 19:41:47,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:47,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903935260] [2025-03-17 19:41:47,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903935260] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:41:47,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819531020] [2025-03-17 19:41:47,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:47,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:41:47,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:41:47,396 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-17 19:41:47,398 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-17 19:41:47,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 19:41:47,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 19:41:47,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:47,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:47,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:41:47,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:41:47,488 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 19:41:47,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:41:47,513 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 19:41:47,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819531020] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:41:47,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:41:47,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-17 19:41:47,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588786534] [2025-03-17 19:41:47,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:41:47,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 19:41:47,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:47,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 19:41:47,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 19:41:47,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-03-17 19:41:47,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 126 transitions, 621 flow. Second operand has 12 states, 12 states have (on average 50.833333333333336) internal successors, (610), 12 states have internal predecessors, (610), 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-17 19:41:47,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:47,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-03-17 19:41:47,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:47,764 INFO L124 PetriNetUnfolderBase]: 581/1534 cut-off events. [2025-03-17 19:41:47,765 INFO L125 PetriNetUnfolderBase]: For 222/222 co-relation queries the response was YES. [2025-03-17 19:41:47,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2749 conditions, 1534 events. 581/1534 cut-off events. For 222/222 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 11021 event pairs, 344 based on Foata normal form. 9/1219 useless extension candidates. Maximal degree in co-relation 2736. Up to 924 conditions per place. [2025-03-17 19:41:47,772 INFO L140 encePairwiseOnDemand]: 87/97 looper letters, 75 selfloop transitions, 44 changer transitions 0/153 dead transitions. [2025-03-17 19:41:47,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 153 transitions, 1027 flow [2025-03-17 19:41:47,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 19:41:47,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 19:41:47,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 562 transitions. [2025-03-17 19:41:47,774 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5793814432989691 [2025-03-17 19:41:47,774 INFO L175 Difference]: Start difference. First operand has 109 places, 126 transitions, 621 flow. Second operand 10 states and 562 transitions. [2025-03-17 19:41:47,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 153 transitions, 1027 flow [2025-03-17 19:41:47,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 153 transitions, 943 flow, removed 25 selfloop flow, removed 4 redundant places. [2025-03-17 19:41:47,779 INFO L231 Difference]: Finished difference. Result has 117 places, 153 transitions, 841 flow [2025-03-17 19:41:47,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=841, PETRI_PLACES=117, PETRI_TRANSITIONS=153} [2025-03-17 19:41:47,780 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 26 predicate places. [2025-03-17 19:41:47,780 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 153 transitions, 841 flow [2025-03-17 19:41:47,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 50.833333333333336) internal successors, (610), 12 states have internal predecessors, (610), 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-17 19:41:47,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:47,780 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:41:47,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 19:41:47,981 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,SelfDestructingSolverStorable12 [2025-03-17 19:41:47,981 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:41:47,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:47,981 INFO L85 PathProgramCache]: Analyzing trace with hash -71699098, now seen corresponding path program 1 times [2025-03-17 19:41:47,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:47,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466156432] [2025-03-17 19:41:47,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:47,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:47,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 19:41:47,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 19:41:47,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:47,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:48,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:41:48,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:48,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466156432] [2025-03-17 19:41:48,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466156432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:41:48,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:41:48,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:41:48,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786966710] [2025-03-17 19:41:48,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:41:48,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:41:48,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:48,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:41:48,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:41:48,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 97 [2025-03-17 19:41:48,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 153 transitions, 841 flow. Second operand has 4 states, 4 states have (on average 51.5) internal successors, (206), 4 states have internal predecessors, (206), 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-17 19:41:48,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:48,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 97 [2025-03-17 19:41:48,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:48,279 INFO L124 PetriNetUnfolderBase]: 1103/2536 cut-off events. [2025-03-17 19:41:48,279 INFO L125 PetriNetUnfolderBase]: For 253/253 co-relation queries the response was YES. [2025-03-17 19:41:48,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4612 conditions, 2536 events. 1103/2536 cut-off events. For 253/253 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 19002 event pairs, 318 based on Foata normal form. 80/2115 useless extension candidates. Maximal degree in co-relation 4596. Up to 892 conditions per place. [2025-03-17 19:41:48,293 INFO L140 encePairwiseOnDemand]: 89/97 looper letters, 145 selfloop transitions, 5 changer transitions 0/180 dead transitions. [2025-03-17 19:41:48,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 180 transitions, 1197 flow [2025-03-17 19:41:48,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:41:48,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:41:48,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2025-03-17 19:41:48,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6804123711340206 [2025-03-17 19:41:48,294 INFO L175 Difference]: Start difference. First operand has 117 places, 153 transitions, 841 flow. Second operand 4 states and 264 transitions. [2025-03-17 19:41:48,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 180 transitions, 1197 flow [2025-03-17 19:41:48,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 180 transitions, 1159 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-03-17 19:41:48,297 INFO L231 Difference]: Finished difference. Result has 120 places, 155 transitions, 837 flow [2025-03-17 19:41:48,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=837, PETRI_PLACES=120, PETRI_TRANSITIONS=155} [2025-03-17 19:41:48,298 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 29 predicate places. [2025-03-17 19:41:48,298 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 155 transitions, 837 flow [2025-03-17 19:41:48,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.5) internal successors, (206), 4 states have internal predecessors, (206), 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-17 19:41:48,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:48,298 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:41:48,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 19:41:48,298 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:41:48,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:48,299 INFO L85 PathProgramCache]: Analyzing trace with hash 2072296154, now seen corresponding path program 1 times [2025-03-17 19:41:48,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:48,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033126146] [2025-03-17 19:41:48,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:48,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:48,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 19:41:48,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 19:41:48,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:48,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:48,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:41:48,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:48,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033126146] [2025-03-17 19:41:48,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033126146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:41:48,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:41:48,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:41:48,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045828637] [2025-03-17 19:41:48,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:41:48,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:41:48,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:48,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:41:48,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:41:48,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-03-17 19:41:48,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 155 transitions, 837 flow. Second operand has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 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-17 19:41:48,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:48,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-03-17 19:41:48,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:48,546 INFO L124 PetriNetUnfolderBase]: 725/1976 cut-off events. [2025-03-17 19:41:48,547 INFO L125 PetriNetUnfolderBase]: For 618/656 co-relation queries the response was YES. [2025-03-17 19:41:48,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3798 conditions, 1976 events. 725/1976 cut-off events. For 618/656 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 15323 event pairs, 452 based on Foata normal form. 24/1641 useless extension candidates. Maximal degree in co-relation 3779. Up to 1167 conditions per place. [2025-03-17 19:41:48,576 INFO L140 encePairwiseOnDemand]: 93/97 looper letters, 112 selfloop transitions, 5 changer transitions 0/153 dead transitions. [2025-03-17 19:41:48,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 153 transitions, 1060 flow [2025-03-17 19:41:48,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:41:48,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:41:48,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2025-03-17 19:41:48,578 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.615979381443299 [2025-03-17 19:41:48,578 INFO L175 Difference]: Start difference. First operand has 120 places, 155 transitions, 837 flow. Second operand 4 states and 239 transitions. [2025-03-17 19:41:48,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 153 transitions, 1060 flow [2025-03-17 19:41:48,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 153 transitions, 1060 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 19:41:48,582 INFO L231 Difference]: Finished difference. Result has 123 places, 153 transitions, 836 flow [2025-03-17 19:41:48,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=836, PETRI_PLACES=123, PETRI_TRANSITIONS=153} [2025-03-17 19:41:48,583 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 32 predicate places. [2025-03-17 19:41:48,583 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 153 transitions, 836 flow [2025-03-17 19:41:48,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 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-17 19:41:48,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:48,583 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:41:48,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 19:41:48,583 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:41:48,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:48,584 INFO L85 PathProgramCache]: Analyzing trace with hash -405693419, now seen corresponding path program 1 times [2025-03-17 19:41:48,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:48,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365152829] [2025-03-17 19:41:48,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:48,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:48,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 19:41:48,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 19:41:48,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:48,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:48,756 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-17 19:41:48,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:48,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365152829] [2025-03-17 19:41:48,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365152829] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:41:48,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661797700] [2025-03-17 19:41:48,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:48,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:41:48,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:41:48,759 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-17 19:41:48,760 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-17 19:41:48,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 19:41:48,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 19:41:48,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:48,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:48,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:41:48,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:41:48,864 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-17 19:41:48,864 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:41:48,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661797700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:41:48,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:41:48,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-17 19:41:48,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204055612] [2025-03-17 19:41:48,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:41:48,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:41:48,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:48,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:41:48,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:41:48,872 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-03-17 19:41:48,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 153 transitions, 836 flow. Second operand has 4 states, 4 states have (on average 53.5) internal successors, (214), 4 states have internal predecessors, (214), 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-17 19:41:48,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:48,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-03-17 19:41:48,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:49,035 INFO L124 PetriNetUnfolderBase]: 723/1974 cut-off events. [2025-03-17 19:41:49,035 INFO L125 PetriNetUnfolderBase]: For 628/666 co-relation queries the response was YES. [2025-03-17 19:41:49,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3796 conditions, 1974 events. 723/1974 cut-off events. For 628/666 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 15178 event pairs, 452 based on Foata normal form. 24/1639 useless extension candidates. Maximal degree in co-relation 3775. Up to 1165 conditions per place. [2025-03-17 19:41:49,045 INFO L140 encePairwiseOnDemand]: 93/97 looper letters, 110 selfloop transitions, 5 changer transitions 0/151 dead transitions. [2025-03-17 19:41:49,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 151 transitions, 1055 flow [2025-03-17 19:41:49,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:41:49,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:41:49,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2025-03-17 19:41:49,047 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.615979381443299 [2025-03-17 19:41:49,047 INFO L175 Difference]: Start difference. First operand has 123 places, 153 transitions, 836 flow. Second operand 4 states and 239 transitions. [2025-03-17 19:41:49,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 151 transitions, 1055 flow [2025-03-17 19:41:49,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 151 transitions, 1049 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:41:49,052 INFO L231 Difference]: Finished difference. Result has 124 places, 151 transitions, 829 flow [2025-03-17 19:41:49,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=819, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=829, PETRI_PLACES=124, PETRI_TRANSITIONS=151} [2025-03-17 19:41:49,053 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 33 predicate places. [2025-03-17 19:41:49,053 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 151 transitions, 829 flow [2025-03-17 19:41:49,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.5) internal successors, (214), 4 states have internal predecessors, (214), 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-17 19:41:49,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:49,053 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:41:49,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 19:41:49,254 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,SelfDestructingSolverStorable15 [2025-03-17 19:41:49,254 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:41:49,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:49,254 INFO L85 PathProgramCache]: Analyzing trace with hash -2024564630, now seen corresponding path program 1 times [2025-03-17 19:41:49,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:49,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950644641] [2025-03-17 19:41:49,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:49,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:49,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 19:41:49,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 19:41:49,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:49,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:49,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:41:49,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:49,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950644641] [2025-03-17 19:41:49,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950644641] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:41:49,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709315575] [2025-03-17 19:41:49,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:49,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:41:49,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:41:49,734 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:41:49,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 19:41:49,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 19:41:49,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 19:41:49,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:49,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:49,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 19:41:49,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:41:49,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 19:41:49,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 19:41:49,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:41:49,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:41:50,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-17 19:41:50,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2025-03-17 19:41:50,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:41:50,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709315575] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:41:50,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:41:50,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-17 19:41:50,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476955430] [2025-03-17 19:41:50,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:41:50,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 19:41:50,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:50,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 19:41:50,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-17 19:41:50,261 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 97 [2025-03-17 19:41:50,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 151 transitions, 829 flow. Second operand has 16 states, 16 states have (on average 44.625) internal successors, (714), 16 states have internal predecessors, (714), 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-17 19:41:50,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:50,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 97 [2025-03-17 19:41:50,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:51,190 INFO L124 PetriNetUnfolderBase]: 2711/6838 cut-off events. [2025-03-17 19:41:51,190 INFO L125 PetriNetUnfolderBase]: For 1908/1950 co-relation queries the response was YES. [2025-03-17 19:41:51,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13266 conditions, 6838 events. 2711/6838 cut-off events. For 1908/1950 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 63935 event pairs, 730 based on Foata normal form. 42/5915 useless extension candidates. Maximal degree in co-relation 13245. Up to 876 conditions per place. [2025-03-17 19:41:51,228 INFO L140 encePairwiseOnDemand]: 84/97 looper letters, 286 selfloop transitions, 46 changer transitions 0/366 dead transitions. [2025-03-17 19:41:51,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 366 transitions, 2446 flow [2025-03-17 19:41:51,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 19:41:51,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-17 19:41:51,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 812 transitions. [2025-03-17 19:41:51,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5580756013745705 [2025-03-17 19:41:51,230 INFO L175 Difference]: Start difference. First operand has 124 places, 151 transitions, 829 flow. Second operand 15 states and 812 transitions. [2025-03-17 19:41:51,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 366 transitions, 2446 flow [2025-03-17 19:41:51,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 366 transitions, 2432 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:41:51,243 INFO L231 Difference]: Finished difference. Result has 139 places, 164 transitions, 1022 flow [2025-03-17 19:41:51,243 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1022, PETRI_PLACES=139, PETRI_TRANSITIONS=164} [2025-03-17 19:41:51,244 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 48 predicate places. [2025-03-17 19:41:51,244 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 164 transitions, 1022 flow [2025-03-17 19:41:51,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 44.625) internal successors, (714), 16 states have internal predecessors, (714), 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-17 19:41:51,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:51,244 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:41:51,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 19:41:51,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:41:51,449 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:41:51,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:51,449 INFO L85 PathProgramCache]: Analyzing trace with hash -902011202, now seen corresponding path program 1 times [2025-03-17 19:41:51,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:51,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049628822] [2025-03-17 19:41:51,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:51,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:51,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 19:41:51,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 19:41:51,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:51,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:51,503 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-17 19:41:51,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:51,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049628822] [2025-03-17 19:41:51,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049628822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:41:51,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:41:51,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:41:51,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493400992] [2025-03-17 19:41:51,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:41:51,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:41:51,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:51,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:41:51,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:41:51,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 97 [2025-03-17 19:41:51,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 164 transitions, 1022 flow. Second operand has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 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-17 19:41:51,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:51,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 97 [2025-03-17 19:41:51,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:52,164 INFO L124 PetriNetUnfolderBase]: 4401/10058 cut-off events. [2025-03-17 19:41:52,164 INFO L125 PetriNetUnfolderBase]: For 6627/6901 co-relation queries the response was YES. [2025-03-17 19:41:52,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21760 conditions, 10058 events. 4401/10058 cut-off events. For 6627/6901 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 94838 event pairs, 1504 based on Foata normal form. 422/8961 useless extension candidates. Maximal degree in co-relation 21736. Up to 3686 conditions per place. [2025-03-17 19:41:52,214 INFO L140 encePairwiseOnDemand]: 89/97 looper letters, 178 selfloop transitions, 5 changer transitions 0/215 dead transitions. [2025-03-17 19:41:52,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 215 transitions, 1670 flow [2025-03-17 19:41:52,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:41:52,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:41:52,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2025-03-17 19:41:52,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6752577319587629 [2025-03-17 19:41:52,216 INFO L175 Difference]: Start difference. First operand has 139 places, 164 transitions, 1022 flow. Second operand 4 states and 262 transitions. [2025-03-17 19:41:52,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 215 transitions, 1670 flow [2025-03-17 19:41:52,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 215 transitions, 1643 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-17 19:41:52,231 INFO L231 Difference]: Finished difference. Result has 140 places, 166 transitions, 1037 flow [2025-03-17 19:41:52,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=1001, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1037, PETRI_PLACES=140, PETRI_TRANSITIONS=166} [2025-03-17 19:41:52,232 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 49 predicate places. [2025-03-17 19:41:52,232 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 166 transitions, 1037 flow [2025-03-17 19:41:52,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 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-17 19:41:52,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:52,232 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:41:52,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 19:41:52,232 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:41:52,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:52,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1662976058, now seen corresponding path program 1 times [2025-03-17 19:41:52,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:52,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426673784] [2025-03-17 19:41:52,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:52,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:52,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 19:41:52,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 19:41:52,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:52,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:52,643 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:41:52,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:52,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426673784] [2025-03-17 19:41:52,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426673784] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:41:52,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341378964] [2025-03-17 19:41:52,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:52,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:41:52,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:41:52,645 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:41:52,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 19:41:52,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 19:41:52,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 19:41:52,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:52,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:52,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 19:41:52,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:41:52,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 19:41:52,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 19:41:52,890 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:41:52,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:41:52,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-17 19:41:52,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2025-03-17 19:41:52,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:41:52,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341378964] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:41:52,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:41:52,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-17 19:41:52,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866713790] [2025-03-17 19:41:52,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:41:52,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 19:41:52,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:52,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 19:41:52,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-17 19:41:53,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 97 [2025-03-17 19:41:53,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 166 transitions, 1037 flow. Second operand has 16 states, 16 states have (on average 42.6875) internal successors, (683), 16 states have internal predecessors, (683), 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-17 19:41:53,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:53,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 97 [2025-03-17 19:41:53,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:54,342 INFO L124 PetriNetUnfolderBase]: 4053/9470 cut-off events. [2025-03-17 19:41:54,342 INFO L125 PetriNetUnfolderBase]: For 7045/7305 co-relation queries the response was YES. [2025-03-17 19:41:54,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21824 conditions, 9470 events. 4053/9470 cut-off events. For 7045/7305 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 89236 event pairs, 1152 based on Foata normal form. 256/8863 useless extension candidates. Maximal degree in co-relation 21798. Up to 1506 conditions per place. [2025-03-17 19:41:54,408 INFO L140 encePairwiseOnDemand]: 84/97 looper letters, 307 selfloop transitions, 46 changer transitions 0/384 dead transitions. [2025-03-17 19:41:54,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 384 transitions, 2793 flow [2025-03-17 19:41:54,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 19:41:54,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-17 19:41:54,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 781 transitions. [2025-03-17 19:41:54,410 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5367697594501718 [2025-03-17 19:41:54,410 INFO L175 Difference]: Start difference. First operand has 140 places, 166 transitions, 1037 flow. Second operand 15 states and 781 transitions. [2025-03-17 19:41:54,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 384 transitions, 2793 flow [2025-03-17 19:41:54,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 384 transitions, 2793 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 19:41:54,446 INFO L231 Difference]: Finished difference. Result has 155 places, 169 transitions, 1169 flow [2025-03-17 19:41:54,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=1024, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1169, PETRI_PLACES=155, PETRI_TRANSITIONS=169} [2025-03-17 19:41:54,446 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 64 predicate places. [2025-03-17 19:41:54,446 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 169 transitions, 1169 flow [2025-03-17 19:41:54,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 42.6875) internal successors, (683), 16 states have internal predecessors, (683), 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-17 19:41:54,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:54,447 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:41:54,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 19:41:54,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:41:54,648 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:41:54,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:54,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1612326299, now seen corresponding path program 2 times [2025-03-17 19:41:54,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:54,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000586623] [2025-03-17 19:41:54,648 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:41:54,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:54,658 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-17 19:41:54,662 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 33 statements. [2025-03-17 19:41:54,662 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:41:54,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:54,703 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 19:41:54,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:54,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000586623] [2025-03-17 19:41:54,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000586623] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:41:54,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392384152] [2025-03-17 19:41:54,704 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:41:54,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:41:54,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:41:54,706 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:41:54,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 19:41:54,767 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-17 19:41:54,780 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 33 statements. [2025-03-17 19:41:54,780 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:41:54,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:54,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:41:54,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:41:54,801 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 19:41:54,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:41:54,823 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 19:41:54,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392384152] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:41:54,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:41:54,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-03-17 19:41:54,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43265651] [2025-03-17 19:41:54,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:41:54,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 19:41:54,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:54,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:41:54,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:41:54,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 97 [2025-03-17 19:41:54,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 169 transitions, 1169 flow. Second operand has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 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-17 19:41:54,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:54,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 97 [2025-03-17 19:41:54,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:55,354 INFO L124 PetriNetUnfolderBase]: 3127/8543 cut-off events. [2025-03-17 19:41:55,355 INFO L125 PetriNetUnfolderBase]: For 8169/8373 co-relation queries the response was YES. [2025-03-17 19:41:55,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19667 conditions, 8543 events. 3127/8543 cut-off events. For 8169/8373 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 87130 event pairs, 2116 based on Foata normal form. 145/7685 useless extension candidates. Maximal degree in co-relation 19638. Up to 4735 conditions per place. [2025-03-17 19:41:55,400 INFO L140 encePairwiseOnDemand]: 86/97 looper letters, 78 selfloop transitions, 50 changer transitions 0/167 dead transitions. [2025-03-17 19:41:55,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 167 transitions, 1405 flow [2025-03-17 19:41:55,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:41:55,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 19:41:55,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 267 transitions. [2025-03-17 19:41:55,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5505154639175258 [2025-03-17 19:41:55,401 INFO L175 Difference]: Start difference. First operand has 155 places, 169 transitions, 1169 flow. Second operand 5 states and 267 transitions. [2025-03-17 19:41:55,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 167 transitions, 1405 flow [2025-03-17 19:41:55,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 167 transitions, 1313 flow, removed 5 selfloop flow, removed 14 redundant places. [2025-03-17 19:41:55,427 INFO L231 Difference]: Finished difference. Result has 143 places, 167 transitions, 1157 flow [2025-03-17 19:41:55,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=1057, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1157, PETRI_PLACES=143, PETRI_TRANSITIONS=167} [2025-03-17 19:41:55,429 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 52 predicate places. [2025-03-17 19:41:55,429 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 167 transitions, 1157 flow [2025-03-17 19:41:55,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 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-17 19:41:55,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:41:55,429 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:41:55,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 19:41:55,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:41:55,630 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:41:55,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:41:55,630 INFO L85 PathProgramCache]: Analyzing trace with hash 2102424728, now seen corresponding path program 1 times [2025-03-17 19:41:55,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:41:55,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542953508] [2025-03-17 19:41:55,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:55,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:41:55,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 19:41:55,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 19:41:55,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:55,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:55,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:41:55,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:41:55,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542953508] [2025-03-17 19:41:55,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542953508] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:41:55,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059079324] [2025-03-17 19:41:55,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:41:55,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:41:55,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:41:55,994 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:41:55,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 19:41:56,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 19:41:56,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 19:41:56,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:41:56,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:41:56,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 19:41:56,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:41:56,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 19:41:56,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-17 19:41:56,275 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 19:41:56,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 19:41:56,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-17 19:41:56,468 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 19:41:56,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2025-03-17 19:41:56,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:41:56,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:41:56,532 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_361 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_361) c_~get_2~0.base) (+ (* c_~id_0~0 4) c_~get_2~0.offset)) 9223372039002259456)) is different from false [2025-03-17 19:41:56,646 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:41:56,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-03-17 19:41:56,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:41:56,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 33 [2025-03-17 19:41:56,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-03-17 19:41:56,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2025-03-17 19:41:56,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059079324] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:41:56,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:41:56,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-03-17 19:41:56,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027305500] [2025-03-17 19:41:56,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:41:56,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 19:41:56,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:41:56,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 19:41:56,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=390, Unknown=1, NotChecked=40, Total=506 [2025-03-17 19:41:56,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 97 [2025-03-17 19:41:56,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 167 transitions, 1157 flow. Second operand has 23 states, 23 states have (on average 35.391304347826086) internal successors, (814), 23 states have internal predecessors, (814), 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-17 19:41:56,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:41:56,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 97 [2025-03-17 19:41:56,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:41:58,127 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~id_0~0 4) c_~get_2~0.offset))) (and (<= 0 c_~id_0~0) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_118| Int)) (or (forall ((v_ArrVal_361 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_118| v_ArrVal_361) c_~get_2~0.base) .cse0) 9223372039002259456)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_118|) 0)))) (forall ((v_ArrVal_361 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_361) c_~get_2~0.base) .cse0) 9223372039002259456)))) is different from false [2025-03-17 19:42:00,038 INFO L124 PetriNetUnfolderBase]: 9942/19153 cut-off events. [2025-03-17 19:42:00,039 INFO L125 PetriNetUnfolderBase]: For 18844/19360 co-relation queries the response was YES. [2025-03-17 19:42:00,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48257 conditions, 19153 events. 9942/19153 cut-off events. For 18844/19360 co-relation queries the response was YES. Maximal size of possible extension queue 894. Compared 170960 event pairs, 2214 based on Foata normal form. 416/17941 useless extension candidates. Maximal degree in co-relation 48233. Up to 3427 conditions per place. [2025-03-17 19:42:00,154 INFO L140 encePairwiseOnDemand]: 82/97 looper letters, 365 selfloop transitions, 61 changer transitions 0/452 dead transitions. [2025-03-17 19:42:00,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 452 transitions, 3599 flow [2025-03-17 19:42:00,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 19:42:00,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-17 19:42:00,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 936 transitions. [2025-03-17 19:42:00,156 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4386129334582943 [2025-03-17 19:42:00,156 INFO L175 Difference]: Start difference. First operand has 143 places, 167 transitions, 1157 flow. Second operand 22 states and 936 transitions. [2025-03-17 19:42:00,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 452 transitions, 3599 flow [2025-03-17 19:42:00,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 452 transitions, 3439 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 19:42:00,221 INFO L231 Difference]: Finished difference. Result has 166 places, 196 transitions, 1496 flow [2025-03-17 19:42:00,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=1057, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1496, PETRI_PLACES=166, PETRI_TRANSITIONS=196} [2025-03-17 19:42:00,222 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 75 predicate places. [2025-03-17 19:42:00,222 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 196 transitions, 1496 flow [2025-03-17 19:42:00,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 35.391304347826086) internal successors, (814), 23 states have internal predecessors, (814), 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-17 19:42:00,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:42:00,223 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:42:00,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 19:42:00,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-17 19:42:00,427 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:42:00,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:42:00,428 INFO L85 PathProgramCache]: Analyzing trace with hash 12650156, now seen corresponding path program 1 times [2025-03-17 19:42:00,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:42:00,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433687931] [2025-03-17 19:42:00,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:42:00,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:42:00,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 19:42:00,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 19:42:00,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:42:00,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:00,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:42:00,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:42:00,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433687931] [2025-03-17 19:42:00,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433687931] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:42:00,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096635732] [2025-03-17 19:42:00,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:42:00,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:42:00,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:42:00,930 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:42:00,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 19:42:00,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 19:42:01,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 19:42:01,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:42:01,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:01,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-17 19:42:01,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:42:01,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 19:42:01,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 19:42:01,127 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 19:42:01,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 19:42:01,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 19:42:01,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 19:42:01,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:42:01,268 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:42:01,415 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:42:01,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2025-03-17 19:42:01,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:42:01,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 39 [2025-03-17 19:42:01,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2025-03-17 19:42:01,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:42:01,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096635732] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:42:01,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:42:01,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-17 19:42:01,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472821170] [2025-03-17 19:42:01,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:42:01,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 19:42:01,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:42:01,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 19:42:01,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=351, Unknown=3, NotChecked=0, Total=420 [2025-03-17 19:42:01,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 97 [2025-03-17 19:42:01,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 196 transitions, 1496 flow. Second operand has 21 states, 21 states have (on average 32.80952380952381) internal successors, (689), 21 states have internal predecessors, (689), 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-17 19:42:01,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:42:01,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 97 [2025-03-17 19:42:01,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:42:04,346 INFO L124 PetriNetUnfolderBase]: 9621/18401 cut-off events. [2025-03-17 19:42:04,346 INFO L125 PetriNetUnfolderBase]: For 20192/20973 co-relation queries the response was YES. [2025-03-17 19:42:04,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49300 conditions, 18401 events. 9621/18401 cut-off events. For 20192/20973 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 161816 event pairs, 2132 based on Foata normal form. 517/17800 useless extension candidates. Maximal degree in co-relation 49270. Up to 3085 conditions per place. [2025-03-17 19:42:04,454 INFO L140 encePairwiseOnDemand]: 79/97 looper letters, 401 selfloop transitions, 95 changer transitions 0/517 dead transitions. [2025-03-17 19:42:04,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 517 transitions, 3968 flow [2025-03-17 19:42:04,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-17 19:42:04,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-17 19:42:04,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1229 transitions. [2025-03-17 19:42:04,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42233676975945017 [2025-03-17 19:42:04,457 INFO L175 Difference]: Start difference. First operand has 166 places, 196 transitions, 1496 flow. Second operand 30 states and 1229 transitions. [2025-03-17 19:42:04,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 517 transitions, 3968 flow [2025-03-17 19:42:04,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 517 transitions, 3878 flow, removed 18 selfloop flow, removed 7 redundant places. [2025-03-17 19:42:04,519 INFO L231 Difference]: Finished difference. Result has 195 places, 234 transitions, 1982 flow [2025-03-17 19:42:04,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=1421, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1982, PETRI_PLACES=195, PETRI_TRANSITIONS=234} [2025-03-17 19:42:04,519 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 104 predicate places. [2025-03-17 19:42:04,520 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 234 transitions, 1982 flow [2025-03-17 19:42:04,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 32.80952380952381) internal successors, (689), 21 states have internal predecessors, (689), 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-17 19:42:04,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:42:04,520 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:42:04,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-17 19:42:04,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-17 19:42:04,720 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:42:04,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:42:04,721 INFO L85 PathProgramCache]: Analyzing trace with hash 750627298, now seen corresponding path program 1 times [2025-03-17 19:42:04,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:42:04,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438647283] [2025-03-17 19:42:04,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:42:04,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:42:04,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 19:42:04,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 19:42:04,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:42:04,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:05,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:42:05,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:42:05,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438647283] [2025-03-17 19:42:05,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438647283] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:42:05,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759799209] [2025-03-17 19:42:05,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:42:05,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:42:05,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:42:05,185 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:42:05,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 19:42:05,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 19:42:05,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 19:42:05,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:42:05,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:05,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 19:42:05,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:42:05,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 19:42:05,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-17 19:42:05,463 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 19:42:05,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 19:42:05,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2025-03-17 19:42:05,680 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 19:42:05,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2025-03-17 19:42:05,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:42:05,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:42:05,749 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_432 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_432) c_~get_2~0.base) (+ (* c_~id_0~0 4) c_~get_2~0.offset)) 4294967296))) is different from false [2025-03-17 19:42:05,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:42:05,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2025-03-17 19:42:05,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:42:05,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 39 [2025-03-17 19:42:05,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2025-03-17 19:42:05,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2025-03-17 19:42:05,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759799209] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:42:05,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:42:05,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-03-17 19:42:05,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834200506] [2025-03-17 19:42:05,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:42:05,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 19:42:05,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:42:05,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 19:42:05,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=382, Unknown=1, NotChecked=40, Total=506 [2025-03-17 19:42:05,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 97 [2025-03-17 19:42:05,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 234 transitions, 1982 flow. Second operand has 23 states, 23 states have (on average 35.391304347826086) internal successors, (814), 23 states have internal predecessors, (814), 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-17 19:42:05,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:42:05,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 97 [2025-03-17 19:42:05,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:42:07,004 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~id_0~0 4) c_~get_2~0.offset))) (and (<= 0 c_~id_0~0) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_124| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_124|) 0)) (forall ((v_ArrVal_432 (Array Int Int))) (< 0 (+ 4294967296 (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_124| v_ArrVal_432) c_~get_2~0.base) .cse0)))))) (forall ((v_ArrVal_432 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_432) c_~get_2~0.base) .cse0) 4294967296))))) is different from false [2025-03-17 19:42:08,992 INFO L124 PetriNetUnfolderBase]: 9655/18497 cut-off events. [2025-03-17 19:42:08,993 INFO L125 PetriNetUnfolderBase]: For 36916/37423 co-relation queries the response was YES. [2025-03-17 19:42:09,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53885 conditions, 18497 events. 9655/18497 cut-off events. For 36916/37423 co-relation queries the response was YES. Maximal size of possible extension queue 878. Compared 163889 event pairs, 2622 based on Foata normal form. 314/17539 useless extension candidates. Maximal degree in co-relation 53848. Up to 3878 conditions per place. [2025-03-17 19:42:09,224 INFO L140 encePairwiseOnDemand]: 82/97 looper letters, 354 selfloop transitions, 61 changer transitions 0/445 dead transitions. [2025-03-17 19:42:09,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 445 transitions, 4068 flow [2025-03-17 19:42:09,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 19:42:09,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-17 19:42:09,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 921 transitions. [2025-03-17 19:42:09,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43158388003748827 [2025-03-17 19:42:09,226 INFO L175 Difference]: Start difference. First operand has 195 places, 234 transitions, 1982 flow. Second operand 22 states and 921 transitions. [2025-03-17 19:42:09,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 445 transitions, 4068 flow [2025-03-17 19:42:09,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 445 transitions, 3937 flow, removed 13 selfloop flow, removed 14 redundant places. [2025-03-17 19:42:09,322 INFO L231 Difference]: Finished difference. Result has 203 places, 237 transitions, 2038 flow [2025-03-17 19:42:09,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=1868, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2038, PETRI_PLACES=203, PETRI_TRANSITIONS=237} [2025-03-17 19:42:09,322 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 112 predicate places. [2025-03-17 19:42:09,322 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 237 transitions, 2038 flow [2025-03-17 19:42:09,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 35.391304347826086) internal successors, (814), 23 states have internal predecessors, (814), 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-17 19:42:09,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:42:09,323 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:42:09,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-17 19:42:09,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-17 19:42:09,523 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:42:09,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:42:09,524 INFO L85 PathProgramCache]: Analyzing trace with hash 392155741, now seen corresponding path program 1 times [2025-03-17 19:42:09,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:42:09,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093970637] [2025-03-17 19:42:09,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:42:09,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:42:09,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 19:42:09,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 19:42:09,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:42:09,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:09,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:42:09,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:42:09,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093970637] [2025-03-17 19:42:09,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093970637] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:42:09,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627868493] [2025-03-17 19:42:09,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:42:09,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:42:09,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:42:09,906 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:42:09,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 19:42:09,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 19:42:09,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 19:42:09,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:42:09,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:09,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-17 19:42:09,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:42:10,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 19:42:10,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 19:42:10,114 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 19:42:10,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 19:42:10,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 19:42:10,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 19:42:10,256 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:42:10,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:42:10,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:42:10,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-03-17 19:42:10,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:42:10,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 33 [2025-03-17 19:42:10,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-03-17 19:42:10,495 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:42:10,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627868493] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:42:10,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:42:10,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2025-03-17 19:42:10,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825794509] [2025-03-17 19:42:10,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:42:10,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-17 19:42:10,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:42:10,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 19:42:10,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=549, Unknown=9, NotChecked=0, Total=650 [2025-03-17 19:42:10,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 97 [2025-03-17 19:42:10,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 237 transitions, 2038 flow. Second operand has 26 states, 26 states have (on average 32.96153846153846) internal successors, (857), 26 states have internal predecessors, (857), 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-17 19:42:10,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:42:10,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 97 [2025-03-17 19:42:10,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:42:13,798 INFO L124 PetriNetUnfolderBase]: 10012/18614 cut-off events. [2025-03-17 19:42:13,798 INFO L125 PetriNetUnfolderBase]: For 30339/30922 co-relation queries the response was YES. [2025-03-17 19:42:13,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55767 conditions, 18614 events. 10012/18614 cut-off events. For 30339/30922 co-relation queries the response was YES. Maximal size of possible extension queue 831. Compared 159431 event pairs, 2556 based on Foata normal form. 946/18520 useless extension candidates. Maximal degree in co-relation 55730. Up to 3883 conditions per place. [2025-03-17 19:42:13,970 INFO L140 encePairwiseOnDemand]: 73/97 looper letters, 393 selfloop transitions, 110 changer transitions 18/548 dead transitions. [2025-03-17 19:42:13,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 548 transitions, 4533 flow [2025-03-17 19:42:13,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-17 19:42:13,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-17 19:42:13,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 1366 transitions. [2025-03-17 19:42:13,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41419041843541543 [2025-03-17 19:42:13,972 INFO L175 Difference]: Start difference. First operand has 203 places, 237 transitions, 2038 flow. Second operand 34 states and 1366 transitions. [2025-03-17 19:42:13,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 548 transitions, 4533 flow [2025-03-17 19:42:14,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 548 transitions, 4371 flow, removed 2 selfloop flow, removed 16 redundant places. [2025-03-17 19:42:14,103 INFO L231 Difference]: Finished difference. Result has 226 places, 263 transitions, 2408 flow [2025-03-17 19:42:14,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=1960, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2408, PETRI_PLACES=226, PETRI_TRANSITIONS=263} [2025-03-17 19:42:14,104 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 135 predicate places. [2025-03-17 19:42:14,104 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 263 transitions, 2408 flow [2025-03-17 19:42:14,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 32.96153846153846) internal successors, (857), 26 states have internal predecessors, (857), 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-17 19:42:14,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:42:14,104 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:42:14,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-17 19:42:14,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-17 19:42:14,305 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:42:14,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:42:14,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1794610683, now seen corresponding path program 1 times [2025-03-17 19:42:14,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:42:14,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105029144] [2025-03-17 19:42:14,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:42:14,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:42:14,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 19:42:14,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 19:42:14,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:42:14,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:14,346 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-17 19:42:14,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:42:14,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105029144] [2025-03-17 19:42:14,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105029144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:42:14,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:42:14,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:42:14,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860930270] [2025-03-17 19:42:14,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:42:14,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:42:14,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:42:14,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:42:14,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:42:14,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 97 [2025-03-17 19:42:14,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 263 transitions, 2408 flow. Second operand has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 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-17 19:42:14,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:42:14,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 97 [2025-03-17 19:42:14,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:42:15,855 INFO L124 PetriNetUnfolderBase]: 6324/15185 cut-off events. [2025-03-17 19:42:15,855 INFO L125 PetriNetUnfolderBase]: For 39726/40282 co-relation queries the response was YES. [2025-03-17 19:42:15,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45977 conditions, 15185 events. 6324/15185 cut-off events. For 39726/40282 co-relation queries the response was YES. Maximal size of possible extension queue 775. Compared 156142 event pairs, 2502 based on Foata normal form. 415/14500 useless extension candidates. Maximal degree in co-relation 45935. Up to 5903 conditions per place. [2025-03-17 19:42:16,010 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 336 selfloop transitions, 11 changer transitions 0/397 dead transitions. [2025-03-17 19:42:16,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 397 transitions, 4396 flow [2025-03-17 19:42:16,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:42:16,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:42:16,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2025-03-17 19:42:16,011 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6675257731958762 [2025-03-17 19:42:16,011 INFO L175 Difference]: Start difference. First operand has 226 places, 263 transitions, 2408 flow. Second operand 4 states and 259 transitions. [2025-03-17 19:42:16,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 397 transitions, 4396 flow [2025-03-17 19:42:16,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 397 transitions, 4234 flow, removed 13 selfloop flow, removed 18 redundant places. [2025-03-17 19:42:16,239 INFO L231 Difference]: Finished difference. Result has 211 places, 260 transitions, 2280 flow [2025-03-17 19:42:16,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2258, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2280, PETRI_PLACES=211, PETRI_TRANSITIONS=260} [2025-03-17 19:42:16,240 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 120 predicate places. [2025-03-17 19:42:16,240 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 260 transitions, 2280 flow [2025-03-17 19:42:16,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 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-17 19:42:16,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:42:16,240 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:42:16,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 19:42:16,241 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:42:16,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:42:16,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1794609690, now seen corresponding path program 1 times [2025-03-17 19:42:16,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:42:16,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464340489] [2025-03-17 19:42:16,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:42:16,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:42:16,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 19:42:16,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 19:42:16,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:42:16,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:16,658 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:42:16,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:42:16,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464340489] [2025-03-17 19:42:16,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464340489] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:42:16,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259357029] [2025-03-17 19:42:16,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:42:16,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:42:16,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:42:16,661 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:42:16,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-17 19:42:16,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 19:42:16,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 19:42:16,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:42:16,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:16,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 19:42:16,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:42:16,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 19:42:16,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 19:42:16,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:42:16,980 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:42:17,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-17 19:42:17,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2025-03-17 19:42:17,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:42:17,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259357029] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:42:17,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:42:17,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-03-17 19:42:17,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255984534] [2025-03-17 19:42:17,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:42:17,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 19:42:17,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:42:17,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 19:42:17,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-03-17 19:42:17,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 97 [2025-03-17 19:42:17,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 260 transitions, 2280 flow. Second operand has 18 states, 18 states have (on average 38.888888888888886) internal successors, (700), 18 states have internal predecessors, (700), 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-17 19:42:17,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:42:17,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 97 [2025-03-17 19:42:17,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:42:19,107 INFO L124 PetriNetUnfolderBase]: 8500/16707 cut-off events. [2025-03-17 19:42:19,107 INFO L125 PetriNetUnfolderBase]: For 47637/48832 co-relation queries the response was YES. [2025-03-17 19:42:19,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53769 conditions, 16707 events. 8500/16707 cut-off events. For 47637/48832 co-relation queries the response was YES. Maximal size of possible extension queue 771. Compared 149129 event pairs, 2013 based on Foata normal form. 368/16360 useless extension candidates. Maximal degree in co-relation 53728. Up to 2664 conditions per place. [2025-03-17 19:42:19,216 INFO L140 encePairwiseOnDemand]: 82/97 looper letters, 754 selfloop transitions, 90 changer transitions 0/891 dead transitions. [2025-03-17 19:42:19,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 891 transitions, 8464 flow [2025-03-17 19:42:19,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 19:42:19,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-17 19:42:19,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1073 transitions. [2025-03-17 19:42:19,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5028116213683224 [2025-03-17 19:42:19,218 INFO L175 Difference]: Start difference. First operand has 211 places, 260 transitions, 2280 flow. Second operand 22 states and 1073 transitions. [2025-03-17 19:42:19,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 891 transitions, 8464 flow [2025-03-17 19:42:19,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 891 transitions, 8416 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:42:19,342 INFO L231 Difference]: Finished difference. Result has 236 places, 294 transitions, 2761 flow [2025-03-17 19:42:19,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2264, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2761, PETRI_PLACES=236, PETRI_TRANSITIONS=294} [2025-03-17 19:42:19,342 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 145 predicate places. [2025-03-17 19:42:19,343 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 294 transitions, 2761 flow [2025-03-17 19:42:19,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 38.888888888888886) internal successors, (700), 18 states have internal predecessors, (700), 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-17 19:42:19,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:42:19,343 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:42:19,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-17 19:42:19,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:42:19,543 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:42:19,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:42:19,544 INFO L85 PathProgramCache]: Analyzing trace with hash 190615923, now seen corresponding path program 1 times [2025-03-17 19:42:19,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:42:19,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862331551] [2025-03-17 19:42:19,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:42:19,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:42:19,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 19:42:19,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 19:42:19,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:42:19,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:19,592 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-17 19:42:19,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:42:19,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862331551] [2025-03-17 19:42:19,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862331551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:42:19,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:42:19,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 19:42:19,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987577060] [2025-03-17 19:42:19,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:42:19,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 19:42:19,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:42:19,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:42:19,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:42:19,614 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 97 [2025-03-17 19:42:19,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 294 transitions, 2761 flow. Second operand has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:42:19,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:42:19,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 97 [2025-03-17 19:42:19,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:42:20,999 INFO L124 PetriNetUnfolderBase]: 7250/15379 cut-off events. [2025-03-17 19:42:20,999 INFO L125 PetriNetUnfolderBase]: For 43624/43834 co-relation queries the response was YES. [2025-03-17 19:42:21,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50828 conditions, 15379 events. 7250/15379 cut-off events. For 43624/43834 co-relation queries the response was YES. Maximal size of possible extension queue 721. Compared 142843 event pairs, 2766 based on Foata normal form. 198/15097 useless extension candidates. Maximal degree in co-relation 50780. Up to 6454 conditions per place. [2025-03-17 19:42:21,170 INFO L140 encePairwiseOnDemand]: 89/97 looper letters, 378 selfloop transitions, 38 changer transitions 60/511 dead transitions. [2025-03-17 19:42:21,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 511 transitions, 5547 flow [2025-03-17 19:42:21,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:42:21,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 19:42:21,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 371 transitions. [2025-03-17 19:42:21,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6374570446735395 [2025-03-17 19:42:21,171 INFO L175 Difference]: Start difference. First operand has 236 places, 294 transitions, 2761 flow. Second operand 6 states and 371 transitions. [2025-03-17 19:42:21,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 511 transitions, 5547 flow [2025-03-17 19:42:21,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 511 transitions, 5328 flow, removed 25 selfloop flow, removed 9 redundant places. [2025-03-17 19:42:21,517 INFO L231 Difference]: Finished difference. Result has 234 places, 281 transitions, 2584 flow [2025-03-17 19:42:21,518 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2542, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2584, PETRI_PLACES=234, PETRI_TRANSITIONS=281} [2025-03-17 19:42:21,518 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 143 predicate places. [2025-03-17 19:42:21,518 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 281 transitions, 2584 flow [2025-03-17 19:42:21,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:42:21,518 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:42:21,518 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:42:21,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 19:42:21,518 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:42:21,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:42:21,519 INFO L85 PathProgramCache]: Analyzing trace with hash -201673531, now seen corresponding path program 1 times [2025-03-17 19:42:21,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:42:21,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475921374] [2025-03-17 19:42:21,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:42:21,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:42:21,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 19:42:21,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 19:42:21,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:42:21,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:21,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:42:21,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:42:21,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475921374] [2025-03-17 19:42:21,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475921374] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:42:21,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020253846] [2025-03-17 19:42:21,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:42:21,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:42:21,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:42:21,754 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:42:21,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-17 19:42:21,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 19:42:21,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 19:42:21,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:42:21,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:21,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 19:42:21,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:42:21,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 19:42:21,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 19:42:21,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:42:21,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:42:22,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-17 19:42:22,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2025-03-17 19:42:22,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:42:22,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020253846] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:42:22,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:42:22,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-03-17 19:42:22,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080125205] [2025-03-17 19:42:22,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:42:22,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 19:42:22,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:42:22,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 19:42:22,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-03-17 19:42:22,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 97 [2025-03-17 19:42:22,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 281 transitions, 2584 flow. Second operand has 20 states, 20 states have (on average 40.2) internal successors, (804), 20 states have internal predecessors, (804), 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-17 19:42:22,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:42:22,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 97 [2025-03-17 19:42:22,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:42:24,066 INFO L124 PetriNetUnfolderBase]: 7484/15099 cut-off events. [2025-03-17 19:42:24,067 INFO L125 PetriNetUnfolderBase]: For 56020/56794 co-relation queries the response was YES. [2025-03-17 19:42:24,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52421 conditions, 15099 events. 7484/15099 cut-off events. For 56020/56794 co-relation queries the response was YES. Maximal size of possible extension queue 729. Compared 135672 event pairs, 2327 based on Foata normal form. 767/15332 useless extension candidates. Maximal degree in co-relation 52374. Up to 3252 conditions per place. [2025-03-17 19:42:24,267 INFO L140 encePairwiseOnDemand]: 79/97 looper letters, 702 selfloop transitions, 85 changer transitions 160/993 dead transitions. [2025-03-17 19:42:24,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 993 transitions, 9984 flow [2025-03-17 19:42:24,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 19:42:24,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-17 19:42:24,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1180 transitions. [2025-03-17 19:42:24,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.506872852233677 [2025-03-17 19:42:24,269 INFO L175 Difference]: Start difference. First operand has 234 places, 281 transitions, 2584 flow. Second operand 24 states and 1180 transitions. [2025-03-17 19:42:24,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 993 transitions, 9984 flow [2025-03-17 19:42:24,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 993 transitions, 9756 flow, removed 34 selfloop flow, removed 2 redundant places. [2025-03-17 19:42:24,465 INFO L231 Difference]: Finished difference. Result has 263 places, 301 transitions, 2917 flow [2025-03-17 19:42:24,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2544, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2917, PETRI_PLACES=263, PETRI_TRANSITIONS=301} [2025-03-17 19:42:24,465 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 172 predicate places. [2025-03-17 19:42:24,465 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 301 transitions, 2917 flow [2025-03-17 19:42:24,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 40.2) internal successors, (804), 20 states have internal predecessors, (804), 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-17 19:42:24,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:42:24,466 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 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-17 19:42:24,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-17 19:42:24,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-17 19:42:24,666 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:42:24,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:42:24,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1987510474, now seen corresponding path program 2 times [2025-03-17 19:42:24,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:42:24,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089571974] [2025-03-17 19:42:24,667 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:42:24,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:42:24,674 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-17 19:42:24,680 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 19:42:24,680 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:42:24,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:24,839 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:42:24,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:42:24,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089571974] [2025-03-17 19:42:24,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089571974] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:42:24,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276887410] [2025-03-17 19:42:24,839 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:42:24,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:42:24,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:42:24,841 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:42:24,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-17 19:42:24,908 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-17 19:42:24,931 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 19:42:24,931 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:42:24,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:24,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 19:42:24,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:42:25,047 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:42:25,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:42:25,161 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:42:25,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276887410] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:42:25,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:42:25,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2025-03-17 19:42:25,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813599298] [2025-03-17 19:42:25,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:42:25,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 19:42:25,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:42:25,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 19:42:25,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2025-03-17 19:42:25,316 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 97 [2025-03-17 19:42:25,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 301 transitions, 2917 flow. Second operand has 28 states, 28 states have (on average 42.857142857142854) internal successors, (1200), 28 states have internal predecessors, (1200), 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-17 19:42:25,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:42:25,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 97 [2025-03-17 19:42:25,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:42:26,750 INFO L124 PetriNetUnfolderBase]: 4598/11518 cut-off events. [2025-03-17 19:42:26,750 INFO L125 PetriNetUnfolderBase]: For 42375/42785 co-relation queries the response was YES. [2025-03-17 19:42:26,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41829 conditions, 11518 events. 4598/11518 cut-off events. For 42375/42785 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 111269 event pairs, 3482 based on Foata normal form. 172/11405 useless extension candidates. Maximal degree in co-relation 41772. Up to 2729 conditions per place. [2025-03-17 19:42:26,883 INFO L140 encePairwiseOnDemand]: 87/97 looper letters, 240 selfloop transitions, 141 changer transitions 0/448 dead transitions. [2025-03-17 19:42:26,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 448 transitions, 4532 flow [2025-03-17 19:42:26,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 19:42:26,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-17 19:42:26,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 940 transitions. [2025-03-17 19:42:26,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4845360824742268 [2025-03-17 19:42:26,884 INFO L175 Difference]: Start difference. First operand has 263 places, 301 transitions, 2917 flow. Second operand 20 states and 940 transitions. [2025-03-17 19:42:26,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 448 transitions, 4532 flow [2025-03-17 19:42:27,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 448 transitions, 4445 flow, removed 5 selfloop flow, removed 8 redundant places. [2025-03-17 19:42:27,145 INFO L231 Difference]: Finished difference. Result has 277 places, 369 transitions, 3586 flow [2025-03-17 19:42:27,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2830, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3586, PETRI_PLACES=277, PETRI_TRANSITIONS=369} [2025-03-17 19:42:27,145 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 186 predicate places. [2025-03-17 19:42:27,145 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 369 transitions, 3586 flow [2025-03-17 19:42:27,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 42.857142857142854) internal successors, (1200), 28 states have internal predecessors, (1200), 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-17 19:42:27,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:42:27,146 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:42:27,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-17 19:42:27,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-17 19:42:27,346 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:42:27,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:42:27,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1038222303, now seen corresponding path program 1 times [2025-03-17 19:42:27,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:42:27,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515040802] [2025-03-17 19:42:27,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:42:27,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:42:27,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 19:42:27,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 19:42:27,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:42:27,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:27,384 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-17 19:42:27,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:42:27,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515040802] [2025-03-17 19:42:27,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515040802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:42:27,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:42:27,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:42:27,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216573977] [2025-03-17 19:42:27,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:42:27,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:42:27,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:42:27,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:42:27,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:42:27,400 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 97 [2025-03-17 19:42:27,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 369 transitions, 3586 flow. Second operand has 4 states, 4 states have (on average 53.5) internal successors, (214), 4 states have internal predecessors, (214), 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-17 19:42:27,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:42:27,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 97 [2025-03-17 19:42:27,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:42:28,729 INFO L124 PetriNetUnfolderBase]: 6302/13455 cut-off events. [2025-03-17 19:42:28,729 INFO L125 PetriNetUnfolderBase]: For 50638/51316 co-relation queries the response was YES. [2025-03-17 19:42:28,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49323 conditions, 13455 events. 6302/13455 cut-off events. For 50638/51316 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 118788 event pairs, 2607 based on Foata normal form. 417/13638 useless extension candidates. Maximal degree in co-relation 49263. Up to 5867 conditions per place. [2025-03-17 19:42:28,846 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 333 selfloop transitions, 16 changer transitions 104/502 dead transitions. [2025-03-17 19:42:28,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 502 transitions, 5716 flow [2025-03-17 19:42:28,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:42:28,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:42:28,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 257 transitions. [2025-03-17 19:42:28,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6623711340206185 [2025-03-17 19:42:28,850 INFO L175 Difference]: Start difference. First operand has 277 places, 369 transitions, 3586 flow. Second operand 4 states and 257 transitions. [2025-03-17 19:42:28,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 502 transitions, 5716 flow [2025-03-17 19:42:29,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 502 transitions, 5584 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-03-17 19:42:29,079 INFO L231 Difference]: Finished difference. Result has 269 places, 300 transitions, 2866 flow [2025-03-17 19:42:29,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=3376, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2866, PETRI_PLACES=269, PETRI_TRANSITIONS=300} [2025-03-17 19:42:29,080 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 178 predicate places. [2025-03-17 19:42:29,080 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 300 transitions, 2866 flow [2025-03-17 19:42:29,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.5) internal successors, (214), 4 states have internal predecessors, (214), 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-17 19:42:29,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:42:29,081 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 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-17 19:42:29,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 19:42:29,081 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:42:29,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:42:29,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1864480264, now seen corresponding path program 2 times [2025-03-17 19:42:29,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:42:29,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581605415] [2025-03-17 19:42:29,081 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:42:29,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:42:29,088 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-17 19:42:29,094 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 19:42:29,094 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:42:29,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:29,213 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:42:29,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:42:29,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581605415] [2025-03-17 19:42:29,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581605415] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:42:29,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770935307] [2025-03-17 19:42:29,213 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:42:29,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:42:29,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:42:29,215 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:42:29,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-17 19:42:29,291 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-17 19:42:29,320 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 19:42:29,320 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:42:29,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:29,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 19:42:29,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:42:29,441 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:42:29,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:42:29,579 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:42:29,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770935307] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:42:29,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:42:29,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-03-17 19:42:29,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486672790] [2025-03-17 19:42:29,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:42:29,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-17 19:42:29,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:42:29,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-17 19:42:29,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2025-03-17 19:42:29,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 97 [2025-03-17 19:42:29,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 300 transitions, 2866 flow. Second operand has 27 states, 27 states have (on average 42.925925925925924) internal successors, (1159), 27 states have internal predecessors, (1159), 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-17 19:42:29,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:42:29,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 97 [2025-03-17 19:42:29,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:42:30,777 INFO L124 PetriNetUnfolderBase]: 2888/7110 cut-off events. [2025-03-17 19:42:30,777 INFO L125 PetriNetUnfolderBase]: For 29186/29654 co-relation queries the response was YES. [2025-03-17 19:42:30,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27320 conditions, 7110 events. 2888/7110 cut-off events. For 29186/29654 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 62729 event pairs, 2090 based on Foata normal form. 163/7175 useless extension candidates. Maximal degree in co-relation 27259. Up to 2744 conditions per place. [2025-03-17 19:42:30,827 INFO L140 encePairwiseOnDemand]: 87/97 looper letters, 193 selfloop transitions, 105 changer transitions 0/356 dead transitions. [2025-03-17 19:42:30,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 356 transitions, 3779 flow [2025-03-17 19:42:30,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 19:42:30,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-17 19:42:30,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 948 transitions. [2025-03-17 19:42:30,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.488659793814433 [2025-03-17 19:42:30,829 INFO L175 Difference]: Start difference. First operand has 269 places, 300 transitions, 2866 flow. Second operand 20 states and 948 transitions. [2025-03-17 19:42:30,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 356 transitions, 3779 flow [2025-03-17 19:42:30,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 356 transitions, 3729 flow, removed 11 selfloop flow, removed 3 redundant places. [2025-03-17 19:42:30,935 INFO L231 Difference]: Finished difference. Result has 288 places, 320 transitions, 3285 flow [2025-03-17 19:42:30,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2815, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3285, PETRI_PLACES=288, PETRI_TRANSITIONS=320} [2025-03-17 19:42:30,936 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 197 predicate places. [2025-03-17 19:42:30,936 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 320 transitions, 3285 flow [2025-03-17 19:42:30,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 42.925925925925924) internal successors, (1159), 27 states have internal predecessors, (1159), 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-17 19:42:30,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:42:30,936 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 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-17 19:42:30,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-17 19:42:31,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:42:31,137 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:42:31,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:42:31,137 INFO L85 PathProgramCache]: Analyzing trace with hash 867764458, now seen corresponding path program 3 times [2025-03-17 19:42:31,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:42:31,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84653286] [2025-03-17 19:42:31,137 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:42:31,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:42:31,145 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 4 equivalence classes. [2025-03-17 19:42:31,168 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 43 statements. [2025-03-17 19:42:31,168 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 19:42:31,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:31,347 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-17 19:42:31,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:42:31,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84653286] [2025-03-17 19:42:31,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84653286] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:42:31,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22364463] [2025-03-17 19:42:31,347 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:42:31,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:42:31,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:42:31,349 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:42:31,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-17 19:42:31,435 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 4 equivalence classes. [2025-03-17 19:42:31,460 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 43 statements. [2025-03-17 19:42:31,461 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 19:42:31,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:31,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 19:42:31,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:42:31,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-17 19:42:31,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2025-03-17 19:42:31,576 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-17 19:42:31,577 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:42:31,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22364463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:42:31,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:42:31,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2025-03-17 19:42:31,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237431248] [2025-03-17 19:42:31,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:42:31,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:42:31,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:42:31,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:42:31,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-17 19:42:31,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 97 [2025-03-17 19:42:31,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 320 transitions, 3285 flow. Second operand has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 7 states have internal predecessors, (373), 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-17 19:42:31,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:42:31,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 97 [2025-03-17 19:42:31,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:42:32,939 INFO L124 PetriNetUnfolderBase]: 3037/7315 cut-off events. [2025-03-17 19:42:32,939 INFO L125 PetriNetUnfolderBase]: For 27225/27699 co-relation queries the response was YES. [2025-03-17 19:42:32,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27574 conditions, 7315 events. 3037/7315 cut-off events. For 27225/27699 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 63572 event pairs, 650 based on Foata normal form. 235/7542 useless extension candidates. Maximal degree in co-relation 27512. Up to 2924 conditions per place. [2025-03-17 19:42:32,998 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 249 selfloop transitions, 61 changer transitions 0/364 dead transitions. [2025-03-17 19:42:32,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 364 transitions, 4260 flow [2025-03-17 19:42:32,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:42:32,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 19:42:32,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 405 transitions. [2025-03-17 19:42:32,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5964653902798233 [2025-03-17 19:42:32,999 INFO L175 Difference]: Start difference. First operand has 288 places, 320 transitions, 3285 flow. Second operand 7 states and 405 transitions. [2025-03-17 19:42:32,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 364 transitions, 4260 flow [2025-03-17 19:42:33,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 364 transitions, 4106 flow, removed 0 selfloop flow, removed 13 redundant places. [2025-03-17 19:42:33,131 INFO L231 Difference]: Finished difference. Result has 280 places, 317 transitions, 3230 flow [2025-03-17 19:42:33,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=3108, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3230, PETRI_PLACES=280, PETRI_TRANSITIONS=317} [2025-03-17 19:42:33,132 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 189 predicate places. [2025-03-17 19:42:33,132 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 317 transitions, 3230 flow [2025-03-17 19:42:33,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 7 states have internal predecessors, (373), 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-17 19:42:33,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:42:33,133 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 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-17 19:42:33,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-17 19:42:33,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:42:33,333 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:42:33,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:42:33,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1130864570, now seen corresponding path program 2 times [2025-03-17 19:42:33,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:42:33,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435876170] [2025-03-17 19:42:33,334 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:42:33,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:42:33,341 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-17 19:42:33,381 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 19:42:33,381 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:42:33,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:33,599 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-17 19:42:33,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:42:33,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435876170] [2025-03-17 19:42:33,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435876170] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:42:33,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526492808] [2025-03-17 19:42:33,603 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:42:33,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:42:33,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:42:33,607 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:42:33,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-17 19:42:33,713 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-17 19:42:33,748 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 19:42:33,748 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:42:33,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:33,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 19:42:33,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:42:33,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-17 19:42:33,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2025-03-17 19:42:33,916 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-17 19:42:33,916 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:42:33,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526492808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:42:33,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:42:33,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2025-03-17 19:42:33,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699499733] [2025-03-17 19:42:33,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:42:33,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:42:33,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:42:33,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:42:33,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-17 19:42:34,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-03-17 19:42:34,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 317 transitions, 3230 flow. Second operand has 7 states, 7 states have (on average 52.42857142857143) internal successors, (367), 7 states have internal predecessors, (367), 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-17 19:42:34,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:42:34,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-03-17 19:42:34,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:42:34,810 INFO L124 PetriNetUnfolderBase]: 3037/7237 cut-off events. [2025-03-17 19:42:34,811 INFO L125 PetriNetUnfolderBase]: For 29435/29879 co-relation queries the response was YES. [2025-03-17 19:42:34,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27809 conditions, 7237 events. 3037/7237 cut-off events. For 29435/29879 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 62177 event pairs, 650 based on Foata normal form. 223/7452 useless extension candidates. Maximal degree in co-relation 27747. Up to 2924 conditions per place. [2025-03-17 19:42:34,864 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 239 selfloop transitions, 61 changer transitions 12/363 dead transitions. [2025-03-17 19:42:34,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 363 transitions, 4227 flow [2025-03-17 19:42:34,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:42:34,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 19:42:34,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 398 transitions. [2025-03-17 19:42:34,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5861561119293078 [2025-03-17 19:42:34,865 INFO L175 Difference]: Start difference. First operand has 280 places, 317 transitions, 3230 flow. Second operand 7 states and 398 transitions. [2025-03-17 19:42:34,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 363 transitions, 4227 flow [2025-03-17 19:42:35,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 363 transitions, 4105 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 19:42:35,064 INFO L231 Difference]: Finished difference. Result has 279 places, 310 transitions, 3153 flow [2025-03-17 19:42:35,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=3103, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3153, PETRI_PLACES=279, PETRI_TRANSITIONS=310} [2025-03-17 19:42:35,064 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 188 predicate places. [2025-03-17 19:42:35,064 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 310 transitions, 3153 flow [2025-03-17 19:42:35,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 52.42857142857143) internal successors, (367), 7 states have internal predecessors, (367), 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-17 19:42:35,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:42:35,064 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 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-17 19:42:35,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-17 19:42:35,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:42:35,265 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:42:35,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:42:35,265 INFO L85 PathProgramCache]: Analyzing trace with hash 517985304, now seen corresponding path program 3 times [2025-03-17 19:42:35,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:42:35,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101203606] [2025-03-17 19:42:35,266 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:42:35,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:42:35,274 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 5 equivalence classes. [2025-03-17 19:42:35,300 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 42 of 45 statements. [2025-03-17 19:42:35,300 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 19:42:35,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:35,582 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 19:42:35,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:42:35,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101203606] [2025-03-17 19:42:35,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101203606] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:42:35,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86257938] [2025-03-17 19:42:35,583 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:42:35,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:42:35,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:42:35,585 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:42:35,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-17 19:42:35,665 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 5 equivalence classes. [2025-03-17 19:42:35,703 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 42 of 45 statements. [2025-03-17 19:42:35,703 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 19:42:35,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:35,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 19:42:35,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:42:35,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 19:42:35,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-17 19:42:35,816 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 19:42:35,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 19:42:35,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-17 19:42:35,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2025-03-17 19:42:35,879 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 19:42:35,879 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:42:36,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:42:36,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-03-17 19:42:36,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:42:36,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 35 [2025-03-17 19:42:36,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-03-17 19:42:36,117 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 19:42:36,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86257938] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:42:36,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:42:36,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-03-17 19:42:36,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779728372] [2025-03-17 19:42:36,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:42:36,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 19:42:36,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:42:36,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 19:42:36,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=384, Unknown=6, NotChecked=0, Total=462 [2025-03-17 19:42:36,167 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 97 [2025-03-17 19:42:36,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 310 transitions, 3153 flow. Second operand has 22 states, 22 states have (on average 35.95454545454545) internal successors, (791), 22 states have internal predecessors, (791), 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-17 19:42:36,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:42:36,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 97 [2025-03-17 19:42:36,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:42:37,434 INFO L124 PetriNetUnfolderBase]: 4583/8838 cut-off events. [2025-03-17 19:42:37,434 INFO L125 PetriNetUnfolderBase]: For 39325/40183 co-relation queries the response was YES. [2025-03-17 19:42:37,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34492 conditions, 8838 events. 4583/8838 cut-off events. For 39325/40183 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 67609 event pairs, 690 based on Foata normal form. 316/9126 useless extension candidates. Maximal degree in co-relation 34430. Up to 5610 conditions per place. [2025-03-17 19:42:37,515 INFO L140 encePairwiseOnDemand]: 86/97 looper letters, 248 selfloop transitions, 70 changer transitions 0/356 dead transitions. [2025-03-17 19:42:37,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 356 transitions, 4219 flow [2025-03-17 19:42:37,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 19:42:37,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 19:42:37,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 351 transitions. [2025-03-17 19:42:37,516 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4020618556701031 [2025-03-17 19:42:37,516 INFO L175 Difference]: Start difference. First operand has 279 places, 310 transitions, 3153 flow. Second operand 9 states and 351 transitions. [2025-03-17 19:42:37,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 356 transitions, 4219 flow [2025-03-17 19:42:37,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 356 transitions, 4041 flow, removed 0 selfloop flow, removed 10 redundant places. [2025-03-17 19:42:37,634 INFO L231 Difference]: Finished difference. Result has 275 places, 307 transitions, 3132 flow [2025-03-17 19:42:37,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2992, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3132, PETRI_PLACES=275, PETRI_TRANSITIONS=307} [2025-03-17 19:42:37,635 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 184 predicate places. [2025-03-17 19:42:37,635 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 307 transitions, 3132 flow [2025-03-17 19:42:37,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 35.95454545454545) internal successors, (791), 22 states have internal predecessors, (791), 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-17 19:42:37,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:42:37,636 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 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-17 19:42:37,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-17 19:42:37,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-17 19:42:37,836 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:42:37,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:42:37,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1571789268, now seen corresponding path program 2 times [2025-03-17 19:42:37,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:42:37,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560859933] [2025-03-17 19:42:37,837 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:42:37,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:42:37,846 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-17 19:42:37,861 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 19:42:37,861 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:42:37,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:38,175 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 19:42:38,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:42:38,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560859933] [2025-03-17 19:42:38,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560859933] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:42:38,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023194439] [2025-03-17 19:42:38,176 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:42:38,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:42:38,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:42:38,177 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:42:38,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-17 19:42:38,256 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-17 19:42:38,288 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 19:42:38,288 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:42:38,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:38,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-17 19:42:38,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:42:38,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 19:42:38,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-17 19:42:38,479 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 19:42:38,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 19:42:38,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2025-03-17 19:42:38,908 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 19:42:38,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2025-03-17 19:42:38,948 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 11 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:42:38,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:42:39,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:42:39,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2025-03-17 19:42:39,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:42:39,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 39 [2025-03-17 19:42:39,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2025-03-17 19:42:39,577 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:42:39,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023194439] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:42:39,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:42:39,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 20, 20] total 44 [2025-03-17 19:42:39,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920286794] [2025-03-17 19:42:39,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:42:39,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-17 19:42:39,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:42:39,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-17 19:42:39,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1779, Unknown=1, NotChecked=0, Total=1980 [2025-03-17 19:42:40,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 97 [2025-03-17 19:42:40,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 307 transitions, 3132 flow. Second operand has 45 states, 45 states have (on average 26.244444444444444) internal successors, (1181), 45 states have internal predecessors, (1181), 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-17 19:42:40,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:42:40,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 97 [2025-03-17 19:42:40,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:42:43,626 INFO L124 PetriNetUnfolderBase]: 7234/13533 cut-off events. [2025-03-17 19:42:43,626 INFO L125 PetriNetUnfolderBase]: For 49349/50411 co-relation queries the response was YES. [2025-03-17 19:42:43,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51533 conditions, 13533 events. 7234/13533 cut-off events. For 49349/50411 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 107845 event pairs, 1040 based on Foata normal form. 847/14345 useless extension candidates. Maximal degree in co-relation 51471. Up to 1968 conditions per place. [2025-03-17 19:42:43,752 INFO L140 encePairwiseOnDemand]: 80/97 looper letters, 742 selfloop transitions, 99 changer transitions 12/882 dead transitions. [2025-03-17 19:42:43,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 882 transitions, 9102 flow [2025-03-17 19:42:43,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-17 19:42:43,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-03-17 19:42:43,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 1208 transitions. [2025-03-17 19:42:43,754 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3459335624284078 [2025-03-17 19:42:43,754 INFO L175 Difference]: Start difference. First operand has 275 places, 307 transitions, 3132 flow. Second operand 36 states and 1208 transitions. [2025-03-17 19:42:43,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 882 transitions, 9102 flow [2025-03-17 19:42:44,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 882 transitions, 8623 flow, removed 0 selfloop flow, removed 16 redundant places. [2025-03-17 19:42:44,007 INFO L231 Difference]: Finished difference. Result has 291 places, 320 transitions, 3268 flow [2025-03-17 19:42:44,007 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2901, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=3268, PETRI_PLACES=291, PETRI_TRANSITIONS=320} [2025-03-17 19:42:44,007 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 200 predicate places. [2025-03-17 19:42:44,007 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 320 transitions, 3268 flow [2025-03-17 19:42:44,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 26.244444444444444) internal successors, (1181), 45 states have internal predecessors, (1181), 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-17 19:42:44,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:42:44,008 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 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-17 19:42:44,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-17 19:42:44,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-03-17 19:42:44,208 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:42:44,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:42:44,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1122354590, now seen corresponding path program 2 times [2025-03-17 19:42:44,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:42:44,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754038383] [2025-03-17 19:42:44,209 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:42:44,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:42:44,218 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-17 19:42:44,231 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 19:42:44,231 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:42:44,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:44,636 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 19:42:44,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:42:44,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754038383] [2025-03-17 19:42:44,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754038383] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:42:44,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43431732] [2025-03-17 19:42:44,638 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:42:44,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:42:44,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:42:44,640 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:42:44,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-17 19:42:44,734 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-17 19:42:44,764 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 19:42:44,764 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:42:44,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:44,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-17 19:42:44,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:42:44,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 19:42:44,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-17 19:42:44,941 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 19:42:44,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 19:42:44,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2025-03-17 19:42:45,384 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 19:42:45,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2025-03-17 19:42:45,406 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 11 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:42:45,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:42:45,785 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:42:45,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2025-03-17 19:42:45,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:42:45,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 39 [2025-03-17 19:42:45,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2025-03-17 19:42:46,120 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:42:46,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43431732] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:42:46,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:42:46,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 19, 19] total 43 [2025-03-17 19:42:46,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099767088] [2025-03-17 19:42:46,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:42:46,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-17 19:42:46,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:42:46,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-17 19:42:46,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1683, Unknown=2, NotChecked=0, Total=1892 [2025-03-17 19:42:46,587 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 97 [2025-03-17 19:42:46,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 320 transitions, 3268 flow. Second operand has 44 states, 44 states have (on average 28.522727272727273) internal successors, (1255), 44 states have internal predecessors, (1255), 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-17 19:42:46,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:42:46,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 97 [2025-03-17 19:42:46,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:42:49,225 INFO L124 PetriNetUnfolderBase]: 7062/13474 cut-off events. [2025-03-17 19:42:49,225 INFO L125 PetriNetUnfolderBase]: For 50951/51959 co-relation queries the response was YES. [2025-03-17 19:42:49,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51280 conditions, 13474 events. 7062/13474 cut-off events. For 50951/51959 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 108508 event pairs, 1104 based on Foata normal form. 346/13784 useless extension candidates. Maximal degree in co-relation 51222. Up to 3036 conditions per place. [2025-03-17 19:42:49,331 INFO L140 encePairwiseOnDemand]: 84/97 looper letters, 386 selfloop transitions, 75 changer transitions 34/527 dead transitions. [2025-03-17 19:42:49,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 527 transitions, 5845 flow [2025-03-17 19:42:49,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 19:42:49,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-17 19:42:49,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 808 transitions. [2025-03-17 19:42:49,333 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3470790378006873 [2025-03-17 19:42:49,333 INFO L175 Difference]: Start difference. First operand has 291 places, 320 transitions, 3268 flow. Second operand 24 states and 808 transitions. [2025-03-17 19:42:49,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 527 transitions, 5845 flow [2025-03-17 19:42:49,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 527 transitions, 5534 flow, removed 29 selfloop flow, removed 27 redundant places. [2025-03-17 19:42:49,666 INFO L231 Difference]: Finished difference. Result has 286 places, 317 transitions, 3160 flow [2025-03-17 19:42:49,667 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=3036, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=3160, PETRI_PLACES=286, PETRI_TRANSITIONS=317} [2025-03-17 19:42:49,667 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 195 predicate places. [2025-03-17 19:42:49,667 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 317 transitions, 3160 flow [2025-03-17 19:42:49,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 28.522727272727273) internal successors, (1255), 44 states have internal predecessors, (1255), 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-17 19:42:49,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:42:49,668 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 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-17 19:42:49,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-17 19:42:49,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:42:49,868 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:42:49,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:42:49,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1480826147, now seen corresponding path program 2 times [2025-03-17 19:42:49,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:42:49,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333859594] [2025-03-17 19:42:49,869 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:42:49,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:42:49,876 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-17 19:42:49,887 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 19:42:49,887 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:42:49,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:50,226 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 19:42:50,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:42:50,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333859594] [2025-03-17 19:42:50,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333859594] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:42:50,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469155817] [2025-03-17 19:42:50,227 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:42:50,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:42:50,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:42:50,229 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:42:50,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-17 19:42:50,313 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-17 19:42:50,339 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 19:42:50,339 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:42:50,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:50,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-17 19:42:50,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:42:50,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 19:42:50,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 19:42:50,492 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 19:42:50,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 19:42:50,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 19:42:50,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 19:42:50,836 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:42:50,836 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:42:51,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:42:51,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-03-17 19:42:51,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:42:51,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 33 [2025-03-17 19:42:51,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-03-17 19:42:51,397 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:42:51,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469155817] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:42:51,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:42:51,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 21, 21] total 47 [2025-03-17 19:42:51,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257055132] [2025-03-17 19:42:51,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:42:51,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-17 19:42:51,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:42:51,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-17 19:42:51,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=2042, Unknown=2, NotChecked=0, Total=2256 [2025-03-17 19:42:51,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 97 [2025-03-17 19:42:51,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 317 transitions, 3160 flow. Second operand has 48 states, 48 states have (on average 26.354166666666668) internal successors, (1265), 48 states have internal predecessors, (1265), 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-17 19:42:51,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:42:51,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 97 [2025-03-17 19:42:51,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:42:55,596 INFO L124 PetriNetUnfolderBase]: 6238/11861 cut-off events. [2025-03-17 19:42:55,597 INFO L125 PetriNetUnfolderBase]: For 36313/37199 co-relation queries the response was YES. [2025-03-17 19:42:55,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42729 conditions, 11861 events. 6238/11861 cut-off events. For 36313/37199 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 93160 event pairs, 1040 based on Foata normal form. 691/12543 useless extension candidates. Maximal degree in co-relation 42676. Up to 1776 conditions per place. [2025-03-17 19:42:55,669 INFO L140 encePairwiseOnDemand]: 78/97 looper letters, 401 selfloop transitions, 87 changer transitions 368/876 dead transitions. [2025-03-17 19:42:55,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 876 transitions, 8698 flow [2025-03-17 19:42:55,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-17 19:42:55,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-03-17 19:42:55,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 1487 transitions. [2025-03-17 19:42:55,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3332586284177499 [2025-03-17 19:42:55,671 INFO L175 Difference]: Start difference. First operand has 286 places, 317 transitions, 3160 flow. Second operand 46 states and 1487 transitions. [2025-03-17 19:42:55,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 876 transitions, 8698 flow [2025-03-17 19:42:55,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 876 transitions, 8552 flow, removed 22 selfloop flow, removed 23 redundant places. [2025-03-17 19:42:55,760 INFO L231 Difference]: Finished difference. Result has 306 places, 227 transitions, 2286 flow [2025-03-17 19:42:55,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=3040, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=2286, PETRI_PLACES=306, PETRI_TRANSITIONS=227} [2025-03-17 19:42:55,761 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 215 predicate places. [2025-03-17 19:42:55,761 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 227 transitions, 2286 flow [2025-03-17 19:42:55,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 26.354166666666668) internal successors, (1265), 48 states have internal predecessors, (1265), 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-17 19:42:55,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:42:55,763 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 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-17 19:42:55,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-17 19:42:55,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:42:55,964 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:42:55,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:42:55,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1909407078, now seen corresponding path program 2 times [2025-03-17 19:42:55,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:42:55,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620797813] [2025-03-17 19:42:55,964 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:42:55,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:42:55,973 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-03-17 19:42:55,991 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 19:42:55,991 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:42:55,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:56,176 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 19:42:56,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:42:56,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620797813] [2025-03-17 19:42:56,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620797813] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:42:56,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909376] [2025-03-17 19:42:56,176 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:42:56,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:42:56,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:42:56,178 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:42:56,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-17 19:42:56,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-03-17 19:42:56,296 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 19:42:56,296 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:42:56,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:56,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-17 19:42:56,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:42:56,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 19:42:56,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-17 19:42:56,584 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 19:42:56,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:42:56,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-17 19:42:56,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2025-03-17 19:42:56,740 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 19:42:56,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909376] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:42:56,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:42:56,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 15, 11] total 28 [2025-03-17 19:42:56,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646893203] [2025-03-17 19:42:56,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:42:56,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-17 19:42:56,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:42:56,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-17 19:42:56,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2025-03-17 19:42:57,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 97 [2025-03-17 19:42:57,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 227 transitions, 2286 flow. Second operand has 29 states, 29 states have (on average 34.241379310344826) internal successors, (993), 29 states have internal predecessors, (993), 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-17 19:42:57,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:42:57,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 97 [2025-03-17 19:42:57,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:42:58,883 INFO L124 PetriNetUnfolderBase]: 5637/11359 cut-off events. [2025-03-17 19:42:58,884 INFO L125 PetriNetUnfolderBase]: For 45004/45352 co-relation queries the response was YES. [2025-03-17 19:42:58,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42574 conditions, 11359 events. 5637/11359 cut-off events. For 45004/45352 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 94194 event pairs, 544 based on Foata normal form. 400/11735 useless extension candidates. Maximal degree in co-relation 42540. Up to 1848 conditions per place. [2025-03-17 19:42:58,972 INFO L140 encePairwiseOnDemand]: 79/97 looper letters, 720 selfloop transitions, 95 changer transitions 8/856 dead transitions. [2025-03-17 19:42:58,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 856 transitions, 9426 flow [2025-03-17 19:42:58,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-17 19:42:58,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-17 19:42:58,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1139 transitions. [2025-03-17 19:42:58,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4049057945254177 [2025-03-17 19:42:58,974 INFO L175 Difference]: Start difference. First operand has 306 places, 227 transitions, 2286 flow. Second operand 29 states and 1139 transitions. [2025-03-17 19:42:58,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 856 transitions, 9426 flow [2025-03-17 19:42:59,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 856 transitions, 7595 flow, removed 101 selfloop flow, removed 47 redundant places. [2025-03-17 19:42:59,187 INFO L231 Difference]: Finished difference. Result has 258 places, 258 transitions, 2412 flow [2025-03-17 19:42:59,187 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=1838, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=2412, PETRI_PLACES=258, PETRI_TRANSITIONS=258} [2025-03-17 19:42:59,188 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 167 predicate places. [2025-03-17 19:42:59,188 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 258 transitions, 2412 flow [2025-03-17 19:42:59,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 34.241379310344826) internal successors, (993), 29 states have internal predecessors, (993), 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-17 19:42:59,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:42:59,188 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 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-17 19:42:59,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-17 19:42:59,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-17 19:42:59,393 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-17 19:42:59,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:42:59,393 INFO L85 PathProgramCache]: Analyzing trace with hash 937923653, now seen corresponding path program 2 times [2025-03-17 19:42:59,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:42:59,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866906776] [2025-03-17 19:42:59,393 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:42:59,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:42:59,402 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-17 19:42:59,417 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 19:42:59,417 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:42:59,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:59,591 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 19:42:59,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:42:59,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866906776] [2025-03-17 19:42:59,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866906776] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:42:59,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547123229] [2025-03-17 19:42:59,591 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:42:59,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:42:59,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:42:59,593 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:42:59,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-17 19:42:59,689 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-17 19:42:59,719 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 19:42:59,719 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:42:59,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:42:59,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-17 19:42:59,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:42:59,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 19:42:59,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-17 19:42:59,985 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 19:42:59,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:43:00,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-17 19:43:00,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2025-03-17 19:43:00,186 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 19:43:00,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547123229] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:43:00,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:43:00,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 12] total 29 [2025-03-17 19:43:00,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207000688] [2025-03-17 19:43:00,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:43:00,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-17 19:43:00,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:43:00,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-17 19:43:00,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2025-03-17 19:43:00,647 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 97 [2025-03-17 19:43:00,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 258 transitions, 2412 flow. Second operand has 30 states, 30 states have (on average 35.166666666666664) internal successors, (1055), 30 states have internal predecessors, (1055), 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-17 19:43:00,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:43:00,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 97 [2025-03-17 19:43:00,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:43:02,024 INFO L124 PetriNetUnfolderBase]: 3997/8719 cut-off events. [2025-03-17 19:43:02,024 INFO L125 PetriNetUnfolderBase]: For 15944/16024 co-relation queries the response was YES. [2025-03-17 19:43:02,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27638 conditions, 8719 events. 3997/8719 cut-off events. For 15944/16024 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 72522 event pairs, 544 based on Foata normal form. 400/9101 useless extension candidates. Maximal degree in co-relation 27610. Up to 1152 conditions per place. [2025-03-17 19:43:02,073 INFO L140 encePairwiseOnDemand]: 79/97 looper letters, 0 selfloop transitions, 0 changer transitions 743/743 dead transitions. [2025-03-17 19:43:02,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 743 transitions, 6975 flow [2025-03-17 19:43:02,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-17 19:43:02,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-17 19:43:02,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 1066 transitions. [2025-03-17 19:43:02,075 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40702558228331426 [2025-03-17 19:43:02,075 INFO L175 Difference]: Start difference. First operand has 258 places, 258 transitions, 2412 flow. Second operand 27 states and 1066 transitions. [2025-03-17 19:43:02,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 743 transitions, 6975 flow [2025-03-17 19:43:02,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 743 transitions, 6785 flow, removed 13 selfloop flow, removed 16 redundant places. [2025-03-17 19:43:02,139 INFO L231 Difference]: Finished difference. Result has 264 places, 0 transitions, 0 flow [2025-03-17 19:43:02,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2223, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=0, PETRI_PLACES=264, PETRI_TRANSITIONS=0} [2025-03-17 19:43:02,140 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 173 predicate places. [2025-03-17 19:43:02,140 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 0 transitions, 0 flow [2025-03-17 19:43:02,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 35.166666666666664) internal successors, (1055), 30 states have internal predecessors, (1055), 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-17 19:43:02,143 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 44 remaining) [2025-03-17 19:43:02,143 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 44 remaining) [2025-03-17 19:43:02,143 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 44 remaining) [2025-03-17 19:43:02,143 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 44 remaining) [2025-03-17 19:43:02,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 44 remaining) [2025-03-17 19:43:02,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 44 remaining) [2025-03-17 19:43:02,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 44 remaining) [2025-03-17 19:43:02,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 44 remaining) [2025-03-17 19:43:02,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 44 remaining) [2025-03-17 19:43:02,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 44 remaining) [2025-03-17 19:43:02,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 44 remaining) [2025-03-17 19:43:02,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 44 remaining) [2025-03-17 19:43:02,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 44 remaining) [2025-03-17 19:43:02,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 44 remaining) [2025-03-17 19:43:02,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 44 remaining) [2025-03-17 19:43:02,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 44 remaining) [2025-03-17 19:43:02,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 44 remaining) [2025-03-17 19:43:02,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 44 remaining) [2025-03-17 19:43:02,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 44 remaining) [2025-03-17 19:43:02,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 44 remaining) [2025-03-17 19:43:02,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 44 remaining) [2025-03-17 19:43:02,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 44 remaining) [2025-03-17 19:43:02,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 44 remaining) [2025-03-17 19:43:02,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 44 remaining) [2025-03-17 19:43:02,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 44 remaining) [2025-03-17 19:43:02,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 44 remaining) [2025-03-17 19:43:02,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 44 remaining) [2025-03-17 19:43:02,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 44 remaining) [2025-03-17 19:43:02,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 44 remaining) [2025-03-17 19:43:02,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 44 remaining) [2025-03-17 19:43:02,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 44 remaining) [2025-03-17 19:43:02,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 44 remaining) [2025-03-17 19:43:02,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 44 remaining) [2025-03-17 19:43:02,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 44 remaining) [2025-03-17 19:43:02,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 44 remaining) [2025-03-17 19:43:02,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 44 remaining) [2025-03-17 19:43:02,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 44 remaining) [2025-03-17 19:43:02,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 44 remaining) [2025-03-17 19:43:02,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 44 remaining) [2025-03-17 19:43:02,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 44 remaining) [2025-03-17 19:43:02,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 44 remaining) [2025-03-17 19:43:02,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 44 remaining) [2025-03-17 19:43:02,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 44 remaining) [2025-03-17 19:43:02,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 44 remaining) [2025-03-17 19:43:02,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-17 19:43:02,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-17 19:43:02,350 INFO L422 BasicCegarLoop]: Path program histogram: [3, 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] [2025-03-17 19:43:02,354 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 19:43:02,354 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 19:43:02,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 07:43:02 BasicIcfg [2025-03-17 19:43:02,357 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 19:43:02,358 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 19:43:02,358 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 19:43:02,358 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 19:43:02,359 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:41:42" (3/4) ... [2025-03-17 19:43:02,360 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 19:43:02,361 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-17 19:43:02,362 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-17 19:43:02,368 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 165 nodes and edges [2025-03-17 19:43:02,368 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 68 nodes and edges [2025-03-17 19:43:02,368 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2025-03-17 19:43:02,369 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 19:43:02,439 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 19:43:02,439 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 19:43:02,439 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 19:43:02,440 INFO L158 Benchmark]: Toolchain (without parser) took 81516.72ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 124.9MB in the beginning and 448.8MB in the end (delta: -323.9MB). Peak memory consumption was 979.1MB. Max. memory is 16.1GB. [2025-03-17 19:43:02,440 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:43:02,440 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.56ms. Allocated memory is still 167.8MB. Free memory was 124.2MB in the beginning and 111.4MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 19:43:02,440 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.44ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 109.5MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 19:43:02,440 INFO L158 Benchmark]: Boogie Preprocessor took 34.93ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 106.6MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:43:02,440 INFO L158 Benchmark]: IcfgBuilder took 877.00ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 105.0MB in the end (delta: 1.6MB). Peak memory consumption was 74.6MB. Max. memory is 16.1GB. [2025-03-17 19:43:02,440 INFO L158 Benchmark]: TraceAbstraction took 80266.42ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 104.2MB in the beginning and 457.2MB in the end (delta: -353.0MB). Peak memory consumption was 954.8MB. Max. memory is 16.1GB. [2025-03-17 19:43:02,441 INFO L158 Benchmark]: Witness Printer took 81.58ms. Allocated memory is still 1.5GB. Free memory was 457.2MB in the beginning and 448.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 19:43:02,441 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 217.56ms. Allocated memory is still 167.8MB. Free memory was 124.2MB in the beginning and 111.4MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.44ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 109.5MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.93ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 106.6MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 877.00ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 105.0MB in the end (delta: 1.6MB). Peak memory consumption was 74.6MB. Max. memory is 16.1GB. * TraceAbstraction took 80266.42ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 104.2MB in the beginning and 457.2MB in the end (delta: -353.0MB). Peak memory consumption was 954.8MB. Max. memory is 16.1GB. * Witness Printer took 81.58ms. Allocated memory is still 1.5GB. Free memory was 457.2MB in the beginning and 448.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 121]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 121]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 123]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 123]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 121]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 121]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 123]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 123]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 103]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 103]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 103]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 83]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 103]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 83]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 114]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 114]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 114]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 114]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 92]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 92]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 130 locations, 145 edges, 44 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 80.2s, OverallIterations: 39, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 55.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 98 mSolverCounterUnknown, 9304 SdHoareTripleChecker+Valid, 17.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8860 mSDsluCounter, 18349 SdHoareTripleChecker+Invalid, 14.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 504 IncrementalHoareTripleChecker+Unchecked, 18258 mSDsCounter, 727 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33529 IncrementalHoareTripleChecker+Invalid, 34858 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 727 mSolverCounterUnsat, 91 mSDtfsCounter, 33529 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2086 GetRequests, 1218 SyntacticMatches, 31 SemanticMatches, 837 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 8650 ImplicationChecksByTransitivity, 13.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3586occurred in iteration=29, InterpolantAutomatonStates: 521, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 16.1s InterpolantComputationTime, 1947 NumberOfCodeBlocks, 1845 NumberOfCodeBlocksAsserted, 88 NumberOfCheckSat, 2587 ConstructedInterpolants, 203 QuantifiedInterpolants, 25570 SizeOfPredicates, 309 NumberOfNonLiveVariables, 6420 ConjunctsInSsa, 648 ConjunctsInUnsatCore, 85 InterpolantComputations, 18 PerfectInterpolantSequences, 787/1307 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 19:43:02,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE