./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-ext/09_fmaxsym.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/09_fmaxsym.i -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 2ce2a912f26c96a7a9e9698d6a341c03f1dcacccb179d06c2396dd9f137bcbd1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:09:09,870 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:09:09,929 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:09:09,936 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:09:09,936 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:09:09,957 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:09:09,957 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:09:09,957 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:09:09,958 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:09:09,958 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:09:09,958 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:09:09,959 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:09:09,959 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:09:09,959 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:09:09,959 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:09:09,960 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:09:09,960 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:09:09,960 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:09:09,960 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:09:09,960 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:09:09,961 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:09:09,961 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:09:09,961 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:09:09,961 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:09:09,961 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:09:09,961 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:09:09,961 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:09:09,961 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:09:09,961 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:09:09,961 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:09:09,962 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:09:09,962 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:09:09,962 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:09:09,962 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:09:09,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:09:09,962 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:09:09,962 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:09:09,962 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:09:09,962 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:09:09,962 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:09:09,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:09:09,963 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:09:09,963 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:09:09,963 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:09:09,963 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:09:09,963 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 -> 2ce2a912f26c96a7a9e9698d6a341c03f1dcacccb179d06c2396dd9f137bcbd1 [2025-03-04 15:09:10,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:09:10,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:09:10,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:09:10,205 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:09:10,205 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:09:10,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2025-03-04 15:09:11,453 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3211720c/44dde4213185421eb3f34d430072a15e/FLAG8b9422e38 [2025-03-04 15:09:11,722 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:09:11,723 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2025-03-04 15:09:11,738 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3211720c/44dde4213185421eb3f34d430072a15e/FLAG8b9422e38 [2025-03-04 15:09:11,755 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3211720c/44dde4213185421eb3f34d430072a15e [2025-03-04 15:09:11,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:09:11,762 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:09:11,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:09:11,764 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:09:11,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:09:11,768 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:09:11" (1/1) ... [2025-03-04 15:09:11,769 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@413ec881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:11, skipping insertion in model container [2025-03-04 15:09:11,769 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:09:11" (1/1) ... [2025-03-04 15:09:11,799 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:09:12,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:09:12,061 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:09:12,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:09:12,127 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:09:12,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:12 WrapperNode [2025-03-04 15:09:12,128 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:09:12,129 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:09:12,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:09:12,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:09:12,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:12" (1/1) ... [2025-03-04 15:09:12,145 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:12" (1/1) ... [2025-03-04 15:09:12,164 INFO L138 Inliner]: procedures = 164, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 92 [2025-03-04 15:09:12,164 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:09:12,165 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:09:12,165 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:09:12,165 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:09:12,170 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:12" (1/1) ... [2025-03-04 15:09:12,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:12" (1/1) ... [2025-03-04 15:09:12,172 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:12" (1/1) ... [2025-03-04 15:09:12,179 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 5, 8]. 53 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6]. The 1 writes are split as follows [0, 0, 1]. [2025-03-04 15:09:12,179 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:12" (1/1) ... [2025-03-04 15:09:12,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:12" (1/1) ... [2025-03-04 15:09:12,183 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:12" (1/1) ... [2025-03-04 15:09:12,183 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:12" (1/1) ... [2025-03-04 15:09:12,184 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:12" (1/1) ... [2025-03-04 15:09:12,185 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:12" (1/1) ... [2025-03-04 15:09:12,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:09:12,188 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:09:12,188 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:09:12,188 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:09:12,189 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:12" (1/1) ... [2025-03-04 15:09:12,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:09:12,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:09:12,216 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:09:12,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:09:12,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:09:12,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:09:12,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:09:12,237 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-04 15:09:12,237 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-04 15:09:12,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:09:12,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:09:12,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:09:12,238 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 15:09:12,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:09:12,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:09:12,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:09:12,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:09:12,239 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 15:09:12,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:09:12,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:09:12,240 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:09:12,346 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:09:12,351 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:09:12,517 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:09:12,517 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:09:12,639 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:09:12,640 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:09:12,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:09:12 BoogieIcfgContainer [2025-03-04 15:09:12,640 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:09:12,641 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:09:12,641 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:09:12,645 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:09:12,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:09:11" (1/3) ... [2025-03-04 15:09:12,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49dac16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:09:12, skipping insertion in model container [2025-03-04 15:09:12,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:12" (2/3) ... [2025-03-04 15:09:12,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49dac16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:09:12, skipping insertion in model container [2025-03-04 15:09:12,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:09:12" (3/3) ... [2025-03-04 15:09:12,647 INFO L128 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym.i [2025-03-04 15:09:12,658 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:09:12,660 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09_fmaxsym.i that has 2 procedures, 30 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-03-04 15:09:12,660 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:09:12,704 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:09:12,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 33 transitions, 70 flow [2025-03-04 15:09:12,775 INFO L124 PetriNetUnfolderBase]: 3/35 cut-off events. [2025-03-04 15:09:12,777 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:09:12,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 35 events. 3/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-03-04 15:09:12,779 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 33 transitions, 70 flow [2025-03-04 15:09:12,782 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 33 transitions, 70 flow [2025-03-04 15:09:12,789 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:09:12,803 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;@51528996, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:09:12,803 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-04 15:09:12,806 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:09:12,806 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:09:12,806 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:09:12,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:12,807 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:09:12,807 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-04 15:09:12,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:12,811 INFO L85 PathProgramCache]: Analyzing trace with hash 243422, now seen corresponding path program 1 times [2025-03-04 15:09:12,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:12,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787575593] [2025-03-04 15:09:12,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:12,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:12,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:09:12,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:09:12,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:12,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:13,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:13,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:13,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787575593] [2025-03-04 15:09:13,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787575593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:13,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:13,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:13,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312851291] [2025-03-04 15:09:13,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:13,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:09:13,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:13,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:09:13,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:09:13,092 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2025-03-04 15:09:13,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 33 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:13,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:13,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2025-03-04 15:09:13,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:13,187 INFO L124 PetriNetUnfolderBase]: 24/88 cut-off events. [2025-03-04 15:09:13,187 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:09:13,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 88 events. 24/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 192 event pairs, 20 based on Foata normal form. 4/81 useless extension candidates. Maximal degree in co-relation 127. Up to 64 conditions per place. [2025-03-04 15:09:13,188 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 19 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2025-03-04 15:09:13,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 114 flow [2025-03-04 15:09:13,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:09:13,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:09:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2025-03-04 15:09:13,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5378787878787878 [2025-03-04 15:09:13,199 INFO L175 Difference]: Start difference. First operand has 33 places, 33 transitions, 70 flow. Second operand 4 states and 71 transitions. [2025-03-04 15:09:13,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 114 flow [2025-03-04 15:09:13,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 114 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:09:13,206 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 90 flow [2025-03-04 15:09:13,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2025-03-04 15:09:13,212 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places. [2025-03-04 15:09:13,213 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 33 transitions, 90 flow [2025-03-04 15:09:13,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:13,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:13,213 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:09:13,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:09:13,215 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-04 15:09:13,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:13,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1337956340, now seen corresponding path program 1 times [2025-03-04 15:09:13,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:13,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244344022] [2025-03-04 15:09:13,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:13,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:13,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:09:13,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:09:13,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:13,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:13,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:13,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:13,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244344022] [2025-03-04 15:09:13,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244344022] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:09:13,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337068869] [2025-03-04 15:09:13,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:13,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:13,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:09:13,321 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:09:13,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 15:09:13,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:09:13,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:09:13,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:13,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:13,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:09:13,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:09:13,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:13,420 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:09:13,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337068869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:13,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:09:13,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:09:13,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299030586] [2025-03-04 15:09:13,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:13,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:09:13,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:13,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:09:13,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:09:13,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2025-03-04 15:09:13,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 33 transitions, 90 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:13,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:13,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2025-03-04 15:09:13,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:13,510 INFO L124 PetriNetUnfolderBase]: 24/87 cut-off events. [2025-03-04 15:09:13,510 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:09:13,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 87 events. 24/87 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 190 event pairs, 20 based on Foata normal form. 1/77 useless extension candidates. Maximal degree in co-relation 150. Up to 59 conditions per place. [2025-03-04 15:09:13,511 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 15 selfloop transitions, 6 changer transitions 0/32 dead transitions. [2025-03-04 15:09:13,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 32 transitions, 128 flow [2025-03-04 15:09:13,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:09:13,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:09:13,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2025-03-04 15:09:13,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-03-04 15:09:13,512 INFO L175 Difference]: Start difference. First operand has 37 places, 33 transitions, 90 flow. Second operand 6 states and 88 transitions. [2025-03-04 15:09:13,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 32 transitions, 128 flow [2025-03-04 15:09:13,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 32 transitions, 126 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:09:13,513 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 96 flow [2025-03-04 15:09:13,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=96, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2025-03-04 15:09:13,514 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places. [2025-03-04 15:09:13,514 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 96 flow [2025-03-04 15:09:13,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:13,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:13,514 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:09:13,521 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-04 15:09:13,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:13,715 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-04 15:09:13,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:13,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1473026613, now seen corresponding path program 1 times [2025-03-04 15:09:13,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:13,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548314455] [2025-03-04 15:09:13,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:13,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:13,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:09:13,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:09:13,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:13,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:13,776 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:09:13,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:13,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548314455] [2025-03-04 15:09:13,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548314455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:13,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:13,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:13,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170227293] [2025-03-04 15:09:13,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:13,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:13,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:13,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:13,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:13,782 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2025-03-04 15:09:13,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:13,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:13,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2025-03-04 15:09:13,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:13,844 INFO L124 PetriNetUnfolderBase]: 24/86 cut-off events. [2025-03-04 15:09:13,844 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 15:09:13,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 86 events. 24/86 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 186 event pairs, 20 based on Foata normal form. 1/77 useless extension candidates. Maximal degree in co-relation 146. Up to 62 conditions per place. [2025-03-04 15:09:13,845 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 16 selfloop transitions, 4 changer transitions 0/31 dead transitions. [2025-03-04 15:09:13,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 31 transitions, 132 flow [2025-03-04 15:09:13,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:13,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:13,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2025-03-04 15:09:13,846 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5252525252525253 [2025-03-04 15:09:13,846 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 96 flow. Second operand 3 states and 52 transitions. [2025-03-04 15:09:13,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 31 transitions, 132 flow [2025-03-04 15:09:13,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 110 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-04 15:09:13,847 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 78 flow [2025-03-04 15:09:13,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2025-03-04 15:09:13,848 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places. [2025-03-04 15:09:13,848 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 78 flow [2025-03-04 15:09:13,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:13,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:13,848 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:13,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:09:13,849 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-04 15:09:13,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:13,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1760149466, now seen corresponding path program 1 times [2025-03-04 15:09:13,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:13,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926166036] [2025-03-04 15:09:13,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:13,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:13,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:09:13,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:09:13,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:13,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:13,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:13,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:13,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926166036] [2025-03-04 15:09:13,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926166036] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:09:13,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901827002] [2025-03-04 15:09:13,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:13,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:13,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:09:13,913 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:09:13,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 15:09:13,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:09:13,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:09:13,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:13,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:13,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:09:13,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:09:14,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:14,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:09:14,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:14,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901827002] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:09:14,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:09:14,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 15:09:14,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353485936] [2025-03-04 15:09:14,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:09:14,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:09:14,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:14,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:09:14,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:09:14,045 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2025-03-04 15:09:14,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 78 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:14,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:14,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2025-03-04 15:09:14,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:14,119 INFO L124 PetriNetUnfolderBase]: 24/90 cut-off events. [2025-03-04 15:09:14,119 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-04 15:09:14,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 90 events. 24/90 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 177 event pairs, 20 based on Foata normal form. 2/83 useless extension candidates. Maximal degree in co-relation 139. Up to 60 conditions per place. [2025-03-04 15:09:14,120 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 16 selfloop transitions, 7 changer transitions 0/34 dead transitions. [2025-03-04 15:09:14,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 34 transitions, 139 flow [2025-03-04 15:09:14,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:09:14,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:09:14,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2025-03-04 15:09:14,121 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44155844155844154 [2025-03-04 15:09:14,122 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 78 flow. Second operand 7 states and 102 transitions. [2025-03-04 15:09:14,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 34 transitions, 139 flow [2025-03-04 15:09:14,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 34 transitions, 125 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:14,123 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 104 flow [2025-03-04 15:09:14,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=104, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2025-03-04 15:09:14,123 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2025-03-04 15:09:14,123 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 104 flow [2025-03-04 15:09:14,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:14,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:14,124 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:14,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:09:14,324 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,SelfDestructingSolverStorable3 [2025-03-04 15:09:14,325 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-04 15:09:14,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:14,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1515559270, now seen corresponding path program 2 times [2025-03-04 15:09:14,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:14,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840424315] [2025-03-04 15:09:14,326 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:09:14,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:14,334 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 15:09:14,337 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 15 statements. [2025-03-04 15:09:14,337 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:09:14,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:14,375 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:09:14,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:14,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840424315] [2025-03-04 15:09:14,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840424315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:14,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:14,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:14,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535730469] [2025-03-04 15:09:14,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:14,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:14,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:14,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:14,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:14,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2025-03-04 15:09:14,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:14,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:14,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2025-03-04 15:09:14,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:14,427 INFO L124 PetriNetUnfolderBase]: 26/97 cut-off events. [2025-03-04 15:09:14,427 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-04 15:09:14,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 97 events. 26/97 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 198 event pairs, 2 based on Foata normal form. 3/97 useless extension candidates. Maximal degree in co-relation 153. Up to 53 conditions per place. [2025-03-04 15:09:14,428 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 24 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2025-03-04 15:09:14,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 35 transitions, 158 flow [2025-03-04 15:09:14,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:14,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:14,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-03-04 15:09:14,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-03-04 15:09:14,430 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 104 flow. Second operand 3 states and 55 transitions. [2025-03-04 15:09:14,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 35 transitions, 158 flow [2025-03-04 15:09:14,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:14,431 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 102 flow [2025-03-04 15:09:14,431 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2025-03-04 15:09:14,431 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places. [2025-03-04 15:09:14,431 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 102 flow [2025-03-04 15:09:14,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:14,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:14,432 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-03-04 15:09:14,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:09:14,432 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-04 15:09:14,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:14,432 INFO L85 PathProgramCache]: Analyzing trace with hash -262330285, now seen corresponding path program 1 times [2025-03-04 15:09:14,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:14,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267684138] [2025-03-04 15:09:14,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:14,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:14,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:09:14,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:09:14,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:14,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:14,544 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:14,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:14,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267684138] [2025-03-04 15:09:14,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267684138] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:09:14,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233663583] [2025-03-04 15:09:14,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:14,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:14,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:09:14,549 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:09:14,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 15:09:14,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:09:14,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:09:14,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:14,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:14,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:09:14,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:09:14,645 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:14,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:09:14,714 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:14,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233663583] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:09:14,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:09:14,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-04 15:09:14,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788749851] [2025-03-04 15:09:14,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:09:14,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 15:09:14,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:14,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 15:09:14,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-04 15:09:14,728 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2025-03-04 15:09:14,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 102 flow. Second operand has 15 states, 15 states have (on average 12.333333333333334) internal successors, (185), 15 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:14,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:14,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2025-03-04 15:09:14,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:14,871 INFO L124 PetriNetUnfolderBase]: 24/98 cut-off events. [2025-03-04 15:09:14,871 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-04 15:09:14,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 98 events. 24/98 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 175 event pairs, 20 based on Foata normal form. 3/93 useless extension candidates. Maximal degree in co-relation 146. Up to 60 conditions per place. [2025-03-04 15:09:14,872 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 16 selfloop transitions, 13 changer transitions 0/39 dead transitions. [2025-03-04 15:09:14,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 39 transitions, 196 flow [2025-03-04 15:09:14,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:09:14,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:09:14,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 175 transitions. [2025-03-04 15:09:14,877 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40792540792540793 [2025-03-04 15:09:14,877 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 102 flow. Second operand 13 states and 175 transitions. [2025-03-04 15:09:14,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 39 transitions, 196 flow [2025-03-04 15:09:14,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 39 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:14,878 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 175 flow [2025-03-04 15:09:14,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=175, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2025-03-04 15:09:14,878 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 20 predicate places. [2025-03-04 15:09:14,879 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 175 flow [2025-03-04 15:09:14,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 12.333333333333334) internal successors, (185), 15 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:14,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:14,879 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1] [2025-03-04 15:09:14,886 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-04 15:09:15,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:15,085 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-04 15:09:15,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:15,085 INFO L85 PathProgramCache]: Analyzing trace with hash 733158181, now seen corresponding path program 2 times [2025-03-04 15:09:15,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:15,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931887425] [2025-03-04 15:09:15,085 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:09:15,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:15,092 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 15:09:15,106 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:09:15,106 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:09:15,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:09:15,106 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:09:15,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 15:09:15,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:09:15,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:15,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:09:15,146 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:09:15,146 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:09:15,147 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-03-04 15:09:15,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 11 remaining) [2025-03-04 15:09:15,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 11 remaining) [2025-03-04 15:09:15,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 11 remaining) [2025-03-04 15:09:15,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 11 remaining) [2025-03-04 15:09:15,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 11 remaining) [2025-03-04 15:09:15,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 11 remaining) [2025-03-04 15:09:15,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 11 remaining) [2025-03-04 15:09:15,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 11 remaining) [2025-03-04 15:09:15,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 11 remaining) [2025-03-04 15:09:15,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 11 remaining) [2025-03-04 15:09:15,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:09:15,149 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2025-03-04 15:09:15,151 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:09:15,152 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 15:09:15,173 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:09:15,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 55 transitions, 120 flow [2025-03-04 15:09:15,179 INFO L124 PetriNetUnfolderBase]: 5/60 cut-off events. [2025-03-04 15:09:15,179 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:09:15,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 60 events. 5/60 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 123 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 45. Up to 3 conditions per place. [2025-03-04 15:09:15,180 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 55 transitions, 120 flow [2025-03-04 15:09:15,180 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 55 transitions, 120 flow [2025-03-04 15:09:15,181 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:09:15,185 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;@51528996, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:09:15,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-04 15:09:15,186 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:09:15,186 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:09:15,187 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:09:15,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:15,187 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:09:15,187 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-04 15:09:15,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:15,187 INFO L85 PathProgramCache]: Analyzing trace with hash 298037, now seen corresponding path program 1 times [2025-03-04 15:09:15,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:15,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775001609] [2025-03-04 15:09:15,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:15,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:15,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:09:15,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:09:15,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:15,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:15,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:15,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:15,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775001609] [2025-03-04 15:09:15,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775001609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:15,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:15,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:15,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745633699] [2025-03-04 15:09:15,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:15,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:09:15,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:15,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:09:15,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:09:15,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-03-04 15:09:15,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 55 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:15,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:15,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-03-04 15:09:15,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:15,404 INFO L124 PetriNetUnfolderBase]: 640/1344 cut-off events. [2025-03-04 15:09:15,404 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-04 15:09:15,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2427 conditions, 1344 events. 640/1344 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7607 event pairs, 570 based on Foata normal form. 70/1297 useless extension candidates. Maximal degree in co-relation 1594. Up to 1043 conditions per place. [2025-03-04 15:09:15,412 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 31 selfloop transitions, 3 changer transitions 0/54 dead transitions. [2025-03-04 15:09:15,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 54 transitions, 186 flow [2025-03-04 15:09:15,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:09:15,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:09:15,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2025-03-04 15:09:15,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2025-03-04 15:09:15,414 INFO L175 Difference]: Start difference. First operand has 55 places, 55 transitions, 120 flow. Second operand 4 states and 120 transitions. [2025-03-04 15:09:15,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 54 transitions, 186 flow [2025-03-04 15:09:15,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 54 transitions, 186 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:09:15,415 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 138 flow [2025-03-04 15:09:15,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2025-03-04 15:09:15,416 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 4 predicate places. [2025-03-04 15:09:15,416 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 138 flow [2025-03-04 15:09:15,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:15,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:15,416 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:09:15,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:09:15,416 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-04 15:09:15,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:15,417 INFO L85 PathProgramCache]: Analyzing trace with hash 289133740, now seen corresponding path program 1 times [2025-03-04 15:09:15,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:15,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491055922] [2025-03-04 15:09:15,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:15,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:15,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:09:15,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:09:15,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:15,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:15,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:15,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:15,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491055922] [2025-03-04 15:09:15,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491055922] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:09:15,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726793724] [2025-03-04 15:09:15,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:15,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:15,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:09:15,469 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:09:15,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 15:09:15,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:09:15,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:09:15,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:15,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:15,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:09:15,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:09:15,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:15,543 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:09:15,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726793724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:15,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:09:15,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:09:15,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828504967] [2025-03-04 15:09:15,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:15,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:09:15,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:15,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:09:15,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:09:15,550 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-03-04 15:09:15,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:15,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:15,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-03-04 15:09:15,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:15,736 INFO L124 PetriNetUnfolderBase]: 640/1343 cut-off events. [2025-03-04 15:09:15,737 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-04 15:09:15,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2437 conditions, 1343 events. 640/1343 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7597 event pairs, 570 based on Foata normal form. 1/1227 useless extension candidates. Maximal degree in co-relation 2418. Up to 1038 conditions per place. [2025-03-04 15:09:15,742 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 27 selfloop transitions, 6 changer transitions 0/53 dead transitions. [2025-03-04 15:09:15,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 53 transitions, 200 flow [2025-03-04 15:09:15,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:09:15,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:09:15,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2025-03-04 15:09:15,743 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-03-04 15:09:15,743 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 138 flow. Second operand 6 states and 154 transitions. [2025-03-04 15:09:15,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 53 transitions, 200 flow [2025-03-04 15:09:15,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 53 transitions, 198 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:09:15,744 INFO L231 Difference]: Finished difference. Result has 62 places, 53 transitions, 144 flow [2025-03-04 15:09:15,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=144, PETRI_PLACES=62, PETRI_TRANSITIONS=53} [2025-03-04 15:09:15,745 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 7 predicate places. [2025-03-04 15:09:15,745 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 144 flow [2025-03-04 15:09:15,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:15,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:15,745 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:09:15,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 15:09:15,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:15,946 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-04 15:09:15,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:15,946 INFO L85 PathProgramCache]: Analyzing trace with hash 373211596, now seen corresponding path program 1 times [2025-03-04 15:09:15,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:15,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469164017] [2025-03-04 15:09:15,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:15,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:15,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:09:15,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:09:15,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:15,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:15,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:09:15,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:15,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469164017] [2025-03-04 15:09:15,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469164017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:15,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:15,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:15,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674885648] [2025-03-04 15:09:15,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:15,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:15,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:15,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:15,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:15,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-03-04 15:09:15,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:15,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:15,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-03-04 15:09:15,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:16,082 INFO L124 PetriNetUnfolderBase]: 640/1342 cut-off events. [2025-03-04 15:09:16,082 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-04 15:09:16,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2439 conditions, 1342 events. 640/1342 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7584 event pairs, 570 based on Foata normal form. 1/1227 useless extension candidates. Maximal degree in co-relation 2414. Up to 1041 conditions per place. [2025-03-04 15:09:16,088 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 28 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2025-03-04 15:09:16,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 52 transitions, 204 flow [2025-03-04 15:09:16,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:16,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:16,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2025-03-04 15:09:16,089 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5515151515151515 [2025-03-04 15:09:16,089 INFO L175 Difference]: Start difference. First operand has 62 places, 53 transitions, 144 flow. Second operand 3 states and 91 transitions. [2025-03-04 15:09:16,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 52 transitions, 204 flow [2025-03-04 15:09:16,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 52 transitions, 182 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-04 15:09:16,090 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 126 flow [2025-03-04 15:09:16,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2025-03-04 15:09:16,091 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 2 predicate places. [2025-03-04 15:09:16,091 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 126 flow [2025-03-04 15:09:16,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:16,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:16,091 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:16,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:09:16,091 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-04 15:09:16,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:16,091 INFO L85 PathProgramCache]: Analyzing trace with hash -2120403374, now seen corresponding path program 1 times [2025-03-04 15:09:16,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:16,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063921696] [2025-03-04 15:09:16,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:16,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:16,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:09:16,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:09:16,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:16,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:16,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:16,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:16,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063921696] [2025-03-04 15:09:16,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063921696] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:09:16,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000687905] [2025-03-04 15:09:16,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:16,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:16,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:09:16,137 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:09:16,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 15:09:16,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:09:16,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:09:16,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:16,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:16,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:09:16,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:09:16,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:16,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:09:16,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:16,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000687905] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:09:16,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:09:16,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 15:09:16,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572868436] [2025-03-04 15:09:16,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:09:16,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:09:16,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:16,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:09:16,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:09:16,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-03-04 15:09:16,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 126 flow. Second operand has 10 states, 10 states have (on average 21.4) internal successors, (214), 10 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-04 15:09:16,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:16,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-03-04 15:09:16,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:16,446 INFO L124 PetriNetUnfolderBase]: 640/1346 cut-off events. [2025-03-04 15:09:16,447 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-04 15:09:16,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2442 conditions, 1346 events. 640/1346 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7581 event pairs, 570 based on Foata normal form. 2/1233 useless extension candidates. Maximal degree in co-relation 2407. Up to 1039 conditions per place. [2025-03-04 15:09:16,452 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 28 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2025-03-04 15:09:16,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 55 transitions, 211 flow [2025-03-04 15:09:16,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:09:16,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:09:16,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions. [2025-03-04 15:09:16,454 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4597402597402597 [2025-03-04 15:09:16,454 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 126 flow. Second operand 7 states and 177 transitions. [2025-03-04 15:09:16,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 55 transitions, 211 flow [2025-03-04 15:09:16,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 55 transitions, 197 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:16,455 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 152 flow [2025-03-04 15:09:16,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=152, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2025-03-04 15:09:16,456 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 8 predicate places. [2025-03-04 15:09:16,456 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 152 flow [2025-03-04 15:09:16,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.4) internal successors, (214), 10 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-04 15:09:16,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:16,456 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:16,463 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-04 15:09:16,657 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,SelfDestructingSolverStorable10 [2025-03-04 15:09:16,657 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-04 15:09:16,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:16,657 INFO L85 PathProgramCache]: Analyzing trace with hash 2011256562, now seen corresponding path program 2 times [2025-03-04 15:09:16,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:16,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715079976] [2025-03-04 15:09:16,658 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:09:16,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:16,663 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 15:09:16,665 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 15 statements. [2025-03-04 15:09:16,666 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:09:16,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:16,685 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:09:16,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:16,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715079976] [2025-03-04 15:09:16,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715079976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:16,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:16,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:16,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379228462] [2025-03-04 15:09:16,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:16,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:16,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:16,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:16,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:16,691 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-03-04 15:09:16,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:16,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:16,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-03-04 15:09:16,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:16,840 INFO L124 PetriNetUnfolderBase]: 698/1432 cut-off events. [2025-03-04 15:09:16,840 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-03-04 15:09:16,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2632 conditions, 1432 events. 698/1432 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8031 event pairs, 291 based on Foata normal form. 36/1390 useless extension candidates. Maximal degree in co-relation 2592. Up to 976 conditions per place. [2025-03-04 15:09:16,847 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 48 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2025-03-04 15:09:16,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 68 transitions, 283 flow [2025-03-04 15:09:16,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:16,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:16,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2025-03-04 15:09:16,848 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2025-03-04 15:09:16,848 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 152 flow. Second operand 3 states and 106 transitions. [2025-03-04 15:09:16,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 68 transitions, 283 flow [2025-03-04 15:09:16,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 68 transitions, 279 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:16,850 INFO L231 Difference]: Finished difference. Result has 62 places, 54 transitions, 150 flow [2025-03-04 15:09:16,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=62, PETRI_TRANSITIONS=54} [2025-03-04 15:09:16,850 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 7 predicate places. [2025-03-04 15:09:16,850 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 150 flow [2025-03-04 15:09:16,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:16,851 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:16,851 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:16,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:09:16,851 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-04 15:09:16,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:16,852 INFO L85 PathProgramCache]: Analyzing trace with hash -2075555736, now seen corresponding path program 1 times [2025-03-04 15:09:16,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:16,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942807950] [2025-03-04 15:09:16,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:16,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:16,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:09:16,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:09:16,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:16,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:16,910 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:09:16,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:16,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942807950] [2025-03-04 15:09:16,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942807950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:16,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:16,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:16,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238554892] [2025-03-04 15:09:16,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:16,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:16,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:16,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:16,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:16,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-03-04 15:09:16,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:16,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:16,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-03-04 15:09:16,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:17,050 INFO L124 PetriNetUnfolderBase]: 640/1326 cut-off events. [2025-03-04 15:09:17,050 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2025-03-04 15:09:17,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2500 conditions, 1326 events. 640/1326 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 7259 event pairs, 264 based on Foata normal form. 36/1290 useless extension candidates. Maximal degree in co-relation 2461. Up to 882 conditions per place. [2025-03-04 15:09:17,056 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 47 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2025-03-04 15:09:17,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 67 transitions, 279 flow [2025-03-04 15:09:17,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:17,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:17,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-03-04 15:09:17,057 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-03-04 15:09:17,057 INFO L175 Difference]: Start difference. First operand has 62 places, 54 transitions, 150 flow. Second operand 3 states and 105 transitions. [2025-03-04 15:09:17,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 67 transitions, 279 flow [2025-03-04 15:09:17,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 67 transitions, 275 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:17,058 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 148 flow [2025-03-04 15:09:17,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2025-03-04 15:09:17,058 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 6 predicate places. [2025-03-04 15:09:17,059 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 148 flow [2025-03-04 15:09:17,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:17,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:17,059 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:17,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 15:09:17,059 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-04 15:09:17,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:17,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1790773801, now seen corresponding path program 1 times [2025-03-04 15:09:17,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:17,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618299757] [2025-03-04 15:09:17,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:17,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:17,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:09:17,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:09:17,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:17,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:17,111 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:09:17,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:17,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618299757] [2025-03-04 15:09:17,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618299757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:17,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:17,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:17,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062318239] [2025-03-04 15:09:17,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:17,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:17,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:17,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:17,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:17,120 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-03-04 15:09:17,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:17,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:17,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-03-04 15:09:17,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:17,230 INFO L124 PetriNetUnfolderBase]: 695/1410 cut-off events. [2025-03-04 15:09:17,231 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2025-03-04 15:09:17,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2678 conditions, 1410 events. 695/1410 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7814 event pairs, 102 based on Foata normal form. 33/1396 useless extension candidates. Maximal degree in co-relation 2639. Up to 913 conditions per place. [2025-03-04 15:09:17,238 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 47 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2025-03-04 15:09:17,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 65 transitions, 274 flow [2025-03-04 15:09:17,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:17,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:17,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-03-04 15:09:17,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-03-04 15:09:17,241 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 148 flow. Second operand 3 states and 105 transitions. [2025-03-04 15:09:17,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 65 transitions, 274 flow [2025-03-04 15:09:17,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 65 transitions, 266 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:17,243 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 146 flow [2025-03-04 15:09:17,243 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2025-03-04 15:09:17,243 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 5 predicate places. [2025-03-04 15:09:17,244 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 146 flow [2025-03-04 15:09:17,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:17,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:17,246 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-03-04 15:09:17,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 15:09:17,246 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-04 15:09:17,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:17,246 INFO L85 PathProgramCache]: Analyzing trace with hash 320559694, now seen corresponding path program 1 times [2025-03-04 15:09:17,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:17,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31363592] [2025-03-04 15:09:17,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:17,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:17,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:09:17,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:09:17,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:17,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:17,359 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:17,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:17,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31363592] [2025-03-04 15:09:17,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31363592] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:09:17,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679096799] [2025-03-04 15:09:17,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:17,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:17,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:09:17,361 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:09:17,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 15:09:17,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:09:17,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:09:17,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:17,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:17,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:09:17,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:09:17,447 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:17,447 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:09:17,503 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:17,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679096799] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:09:17,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:09:17,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-04 15:09:17,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403888875] [2025-03-04 15:09:17,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:09:17,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 15:09:17,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:17,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 15:09:17,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-04 15:09:17,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-03-04 15:09:17,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 146 flow. Second operand has 15 states, 15 states have (on average 21.4) internal successors, (321), 15 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:17,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:17,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-03-04 15:09:17,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:17,721 INFO L124 PetriNetUnfolderBase]: 640/1331 cut-off events. [2025-03-04 15:09:17,721 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-03-04 15:09:17,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2517 conditions, 1331 events. 640/1331 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7435 event pairs, 570 based on Foata normal form. 3/1239 useless extension candidates. Maximal degree in co-relation 2451. Up to 1039 conditions per place. [2025-03-04 15:09:17,727 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 28 selfloop transitions, 13 changer transitions 0/58 dead transitions. [2025-03-04 15:09:17,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 58 transitions, 264 flow [2025-03-04 15:09:17,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:09:17,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:09:17,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 304 transitions. [2025-03-04 15:09:17,729 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4251748251748252 [2025-03-04 15:09:17,729 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 146 flow. Second operand 13 states and 304 transitions. [2025-03-04 15:09:17,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 58 transitions, 264 flow [2025-03-04 15:09:17,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 58 transitions, 260 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:17,731 INFO L231 Difference]: Finished difference. Result has 73 places, 58 transitions, 219 flow [2025-03-04 15:09:17,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=219, PETRI_PLACES=73, PETRI_TRANSITIONS=58} [2025-03-04 15:09:17,731 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 18 predicate places. [2025-03-04 15:09:17,731 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 58 transitions, 219 flow [2025-03-04 15:09:17,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 21.4) internal successors, (321), 15 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:17,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:17,732 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 3, 2, 1, 1, 1, 1, 1] [2025-03-04 15:09:17,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 15:09:17,932 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,SelfDestructingSolverStorable14 [2025-03-04 15:09:17,933 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-04 15:09:17,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:17,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1472641061, now seen corresponding path program 2 times [2025-03-04 15:09:17,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:17,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017208367] [2025-03-04 15:09:17,933 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:09:17,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:17,942 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 15:09:17,957 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 15:09:17,957 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:09:17,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:09:17,957 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:09:17,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 15:09:17,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 15:09:17,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:17,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:09:17,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:09:17,981 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:09:17,981 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-03-04 15:09:17,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 15 remaining) [2025-03-04 15:09:17,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 15 remaining) [2025-03-04 15:09:17,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 15 remaining) [2025-03-04 15:09:17,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 15 remaining) [2025-03-04 15:09:17,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 15 remaining) [2025-03-04 15:09:17,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 15 remaining) [2025-03-04 15:09:17,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 15 remaining) [2025-03-04 15:09:17,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 15 remaining) [2025-03-04 15:09:17,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 15 remaining) [2025-03-04 15:09:17,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 15 remaining) [2025-03-04 15:09:17,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 15 remaining) [2025-03-04 15:09:17,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 15 remaining) [2025-03-04 15:09:17,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 15 remaining) [2025-03-04 15:09:17,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 15 remaining) [2025-03-04 15:09:17,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 15:09:17,983 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:09:17,984 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:09:17,984 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 15:09:18,011 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:09:18,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 77 transitions, 172 flow [2025-03-04 15:09:18,021 INFO L124 PetriNetUnfolderBase]: 7/85 cut-off events. [2025-03-04 15:09:18,021 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 15:09:18,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 85 events. 7/85 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 221 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 66. Up to 4 conditions per place. [2025-03-04 15:09:18,021 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 77 transitions, 172 flow [2025-03-04 15:09:18,022 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 77 transitions, 172 flow [2025-03-04 15:09:18,023 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:09:18,024 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;@51528996, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:09:18,024 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-03-04 15:09:18,025 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:09:18,025 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:09:18,025 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:09:18,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:18,025 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:09:18,025 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:09:18,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:18,025 INFO L85 PathProgramCache]: Analyzing trace with hash 374498, now seen corresponding path program 1 times [2025-03-04 15:09:18,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:18,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520677376] [2025-03-04 15:09:18,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:18,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:18,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:09:18,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:09:18,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:18,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:18,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:18,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:18,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520677376] [2025-03-04 15:09:18,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520677376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:18,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:18,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:18,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849235630] [2025-03-04 15:09:18,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:18,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:09:18,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:18,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:09:18,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:09:18,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-03-04 15:09:18,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 77 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:18,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:18,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-03-04 15:09:18,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:19,388 INFO L124 PetriNetUnfolderBase]: 11409/19193 cut-off events. [2025-03-04 15:09:19,389 INFO L125 PetriNetUnfolderBase]: For 799/799 co-relation queries the response was YES. [2025-03-04 15:09:19,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35523 conditions, 19193 events. 11409/19193 cut-off events. For 799/799 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 146673 event pairs, 10250 based on Foata normal form. 1159/19041 useless extension candidates. Maximal degree in co-relation 15025. Up to 15805 conditions per place. [2025-03-04 15:09:19,508 INFO L140 encePairwiseOnDemand]: 67/77 looper letters, 43 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2025-03-04 15:09:19,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 75 transitions, 260 flow [2025-03-04 15:09:19,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:09:19,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:09:19,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2025-03-04 15:09:19,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5487012987012987 [2025-03-04 15:09:19,510 INFO L175 Difference]: Start difference. First operand has 77 places, 77 transitions, 172 flow. Second operand 4 states and 169 transitions. [2025-03-04 15:09:19,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 75 transitions, 260 flow [2025-03-04 15:09:19,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 75 transitions, 258 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-04 15:09:19,513 INFO L231 Difference]: Finished difference. Result has 81 places, 75 transitions, 186 flow [2025-03-04 15:09:19,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=81, PETRI_TRANSITIONS=75} [2025-03-04 15:09:19,515 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 4 predicate places. [2025-03-04 15:09:19,515 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 75 transitions, 186 flow [2025-03-04 15:09:19,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:19,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:19,515 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:09:19,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 15:09:19,516 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:09:19,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:19,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1727907444, now seen corresponding path program 1 times [2025-03-04 15:09:19,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:19,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269224035] [2025-03-04 15:09:19,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:19,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:19,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:09:19,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:09:19,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:19,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:19,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:19,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:19,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269224035] [2025-03-04 15:09:19,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269224035] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:09:19,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553529272] [2025-03-04 15:09:19,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:19,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:19,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:09:19,571 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-04 15:09:19,573 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-04 15:09:19,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:09:19,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:09:19,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:19,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:19,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:09:19,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:09:19,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:19,658 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:09:19,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553529272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:19,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:09:19,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:09:19,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540529349] [2025-03-04 15:09:19,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:19,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:09:19,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:19,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:09:19,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:09:19,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-03-04 15:09:19,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 75 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:19,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:19,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-03-04 15:09:19,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:20,854 INFO L124 PetriNetUnfolderBase]: 11409/19192 cut-off events. [2025-03-04 15:09:20,855 INFO L125 PetriNetUnfolderBase]: For 442/442 co-relation queries the response was YES. [2025-03-04 15:09:20,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35412 conditions, 19192 events. 11409/19192 cut-off events. For 442/442 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 146644 event pairs, 10250 based on Foata normal form. 1/17882 useless extension candidates. Maximal degree in co-relation 35392. Up to 15800 conditions per place. [2025-03-04 15:09:20,942 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 39 selfloop transitions, 6 changer transitions 0/74 dead transitions. [2025-03-04 15:09:20,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 74 transitions, 272 flow [2025-03-04 15:09:20,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:09:20,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:09:20,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 220 transitions. [2025-03-04 15:09:20,944 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2025-03-04 15:09:20,944 INFO L175 Difference]: Start difference. First operand has 81 places, 75 transitions, 186 flow. Second operand 6 states and 220 transitions. [2025-03-04 15:09:20,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 74 transitions, 272 flow [2025-03-04 15:09:20,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 74 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:09:20,946 INFO L231 Difference]: Finished difference. Result has 84 places, 74 transitions, 192 flow [2025-03-04 15:09:20,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=84, PETRI_TRANSITIONS=74} [2025-03-04 15:09:20,946 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 7 predicate places. [2025-03-04 15:09:20,946 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 74 transitions, 192 flow [2025-03-04 15:09:20,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:20,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:20,946 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:09:20,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 15:09:21,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:21,148 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:09:21,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:21,148 INFO L85 PathProgramCache]: Analyzing trace with hash -2025522887, now seen corresponding path program 1 times [2025-03-04 15:09:21,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:21,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840030915] [2025-03-04 15:09:21,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:21,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:21,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:09:21,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:09:21,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:21,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:21,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:09:21,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:21,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840030915] [2025-03-04 15:09:21,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840030915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:21,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:21,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:21,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524534921] [2025-03-04 15:09:21,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:21,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:21,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:21,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:21,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:21,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-03-04 15:09:21,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 74 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:21,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:21,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-03-04 15:09:21,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:22,326 INFO L124 PetriNetUnfolderBase]: 11409/19191 cut-off events. [2025-03-04 15:09:22,326 INFO L125 PetriNetUnfolderBase]: For 447/447 co-relation queries the response was YES. [2025-03-04 15:09:22,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35414 conditions, 19191 events. 11409/19191 cut-off events. For 447/447 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 146683 event pairs, 10250 based on Foata normal form. 1/17882 useless extension candidates. Maximal degree in co-relation 35388. Up to 15803 conditions per place. [2025-03-04 15:09:22,423 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 40 selfloop transitions, 4 changer transitions 0/73 dead transitions. [2025-03-04 15:09:22,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 73 transitions, 276 flow [2025-03-04 15:09:22,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:22,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:22,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2025-03-04 15:09:22,424 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5627705627705628 [2025-03-04 15:09:22,424 INFO L175 Difference]: Start difference. First operand has 84 places, 74 transitions, 192 flow. Second operand 3 states and 130 transitions. [2025-03-04 15:09:22,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 73 transitions, 276 flow [2025-03-04 15:09:22,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 73 transitions, 254 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-04 15:09:22,426 INFO L231 Difference]: Finished difference. Result has 79 places, 73 transitions, 174 flow [2025-03-04 15:09:22,426 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=79, PETRI_TRANSITIONS=73} [2025-03-04 15:09:22,426 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 2 predicate places. [2025-03-04 15:09:22,426 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 73 transitions, 174 flow [2025-03-04 15:09:22,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:22,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:22,427 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:22,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 15:09:22,427 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:09:22,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:22,427 INFO L85 PathProgramCache]: Analyzing trace with hash -906780940, now seen corresponding path program 1 times [2025-03-04 15:09:22,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:22,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188477138] [2025-03-04 15:09:22,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:22,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:22,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:09:22,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:09:22,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:22,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:22,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:22,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:22,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188477138] [2025-03-04 15:09:22,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188477138] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:09:22,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988332293] [2025-03-04 15:09:22,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:22,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:22,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:09:22,462 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-04 15:09:22,463 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-04 15:09:22,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:09:22,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:09:22,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:22,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:22,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:09:22,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:09:22,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:22,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:09:22,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:22,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988332293] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:09:22,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:09:22,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 15:09:22,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367321574] [2025-03-04 15:09:22,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:09:22,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:09:22,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:22,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:09:22,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:09:22,569 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-03-04 15:09:22,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 73 transitions, 174 flow. Second operand has 10 states, 10 states have (on average 30.4) internal successors, (304), 10 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:22,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:22,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-03-04 15:09:22,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:23,444 INFO L124 PetriNetUnfolderBase]: 11409/19195 cut-off events. [2025-03-04 15:09:23,445 INFO L125 PetriNetUnfolderBase]: For 449/449 co-relation queries the response was YES. [2025-03-04 15:09:23,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35417 conditions, 19195 events. 11409/19195 cut-off events. For 449/449 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 146528 event pairs, 10250 based on Foata normal form. 2/17888 useless extension candidates. Maximal degree in co-relation 35381. Up to 15801 conditions per place. [2025-03-04 15:09:23,522 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 40 selfloop transitions, 7 changer transitions 0/76 dead transitions. [2025-03-04 15:09:23,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 76 transitions, 283 flow [2025-03-04 15:09:23,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:09:23,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:09:23,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 252 transitions. [2025-03-04 15:09:23,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4675324675324675 [2025-03-04 15:09:23,523 INFO L175 Difference]: Start difference. First operand has 79 places, 73 transitions, 174 flow. Second operand 7 states and 252 transitions. [2025-03-04 15:09:23,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 76 transitions, 283 flow [2025-03-04 15:09:23,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 76 transitions, 269 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:23,525 INFO L231 Difference]: Finished difference. Result has 85 places, 76 transitions, 200 flow [2025-03-04 15:09:23,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=200, PETRI_PLACES=85, PETRI_TRANSITIONS=76} [2025-03-04 15:09:23,525 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 8 predicate places. [2025-03-04 15:09:23,525 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 76 transitions, 200 flow [2025-03-04 15:09:23,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 30.4) internal successors, (304), 10 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:23,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:23,525 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:23,531 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-04 15:09:23,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:23,729 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:09:23,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:23,730 INFO L85 PathProgramCache]: Analyzing trace with hash 128243380, now seen corresponding path program 2 times [2025-03-04 15:09:23,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:23,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692868568] [2025-03-04 15:09:23,730 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:09:23,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:23,734 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 15:09:23,736 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 15 statements. [2025-03-04 15:09:23,736 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:09:23,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:23,775 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:09:23,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:23,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692868568] [2025-03-04 15:09:23,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692868568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:23,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:23,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:23,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84689331] [2025-03-04 15:09:23,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:23,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:23,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:23,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:23,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:23,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-03-04 15:09:23,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 76 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:23,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:23,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-03-04 15:09:23,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:24,768 INFO L124 PetriNetUnfolderBase]: 12446/20635 cut-off events. [2025-03-04 15:09:24,769 INFO L125 PetriNetUnfolderBase]: For 463/463 co-relation queries the response was YES. [2025-03-04 15:09:24,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38336 conditions, 20635 events. 12446/20635 cut-off events. For 463/463 co-relation queries the response was YES. Maximal size of possible extension queue 753. Compared 159204 event pairs, 1538 based on Foata normal form. 399/20377 useless extension candidates. Maximal degree in co-relation 38295. Up to 14759 conditions per place. [2025-03-04 15:09:24,867 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 72 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2025-03-04 15:09:24,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 101 transitions, 408 flow [2025-03-04 15:09:24,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:24,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:24,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2025-03-04 15:09:24,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6796536796536796 [2025-03-04 15:09:24,869 INFO L175 Difference]: Start difference. First operand has 85 places, 76 transitions, 200 flow. Second operand 3 states and 157 transitions. [2025-03-04 15:09:24,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 101 transitions, 408 flow [2025-03-04 15:09:24,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 101 transitions, 404 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:24,871 INFO L231 Difference]: Finished difference. Result has 84 places, 75 transitions, 198 flow [2025-03-04 15:09:24,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=84, PETRI_TRANSITIONS=75} [2025-03-04 15:09:24,871 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 7 predicate places. [2025-03-04 15:09:24,871 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 75 transitions, 198 flow [2025-03-04 15:09:24,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:24,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:24,871 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:24,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 15:09:24,872 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:09:24,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:24,872 INFO L85 PathProgramCache]: Analyzing trace with hash -319422157, now seen corresponding path program 1 times [2025-03-04 15:09:24,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:24,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855741851] [2025-03-04 15:09:24,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:24,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:24,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:09:24,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:09:24,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:24,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:24,915 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:09:24,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:24,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855741851] [2025-03-04 15:09:24,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855741851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:24,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:24,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:24,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646136076] [2025-03-04 15:09:24,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:24,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:24,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:24,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:24,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:24,923 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-03-04 15:09:24,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 75 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:24,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:24,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-03-04 15:09:24,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:26,087 INFO L124 PetriNetUnfolderBase]: 11409/19199 cut-off events. [2025-03-04 15:09:26,087 INFO L125 PetriNetUnfolderBase]: For 1221/1221 co-relation queries the response was YES. [2025-03-04 15:09:26,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36225 conditions, 19199 events. 11409/19199 cut-off events. For 1221/1221 co-relation queries the response was YES. Maximal size of possible extension queue 712. Compared 148682 event pairs, 1538 based on Foata normal form. 399/18956 useless extension candidates. Maximal degree in co-relation 36185. Up to 13323 conditions per place. [2025-03-04 15:09:26,220 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 71 selfloop transitions, 2 changer transitions 0/100 dead transitions. [2025-03-04 15:09:26,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 100 transitions, 404 flow [2025-03-04 15:09:26,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:26,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:26,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2025-03-04 15:09:26,222 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6753246753246753 [2025-03-04 15:09:26,222 INFO L175 Difference]: Start difference. First operand has 84 places, 75 transitions, 198 flow. Second operand 3 states and 156 transitions. [2025-03-04 15:09:26,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 100 transitions, 404 flow [2025-03-04 15:09:26,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 100 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:26,225 INFO L231 Difference]: Finished difference. Result has 83 places, 74 transitions, 196 flow [2025-03-04 15:09:26,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=83, PETRI_TRANSITIONS=74} [2025-03-04 15:09:26,225 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 6 predicate places. [2025-03-04 15:09:26,225 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 74 transitions, 196 flow [2025-03-04 15:09:26,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:26,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:26,226 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:26,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 15:09:26,226 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:09:26,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:26,226 INFO L85 PathProgramCache]: Analyzing trace with hash -2068527721, now seen corresponding path program 1 times [2025-03-04 15:09:26,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:26,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269477328] [2025-03-04 15:09:26,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:26,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:26,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:09:26,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:09:26,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:26,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:26,312 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:26,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:26,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269477328] [2025-03-04 15:09:26,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269477328] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:09:26,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284868951] [2025-03-04 15:09:26,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:26,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:26,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:09:26,315 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-04 15:09:26,316 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-04 15:09:26,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:09:26,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:09:26,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:26,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:26,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:09:26,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:09:26,413 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:26,413 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:09:26,480 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:26,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284868951] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:09:26,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:09:26,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-04 15:09:26,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933543804] [2025-03-04 15:09:26,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:09:26,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 15:09:26,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:26,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 15:09:26,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-04 15:09:26,493 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-03-04 15:09:26,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 74 transitions, 196 flow. Second operand has 15 states, 15 states have (on average 30.466666666666665) internal successors, (457), 15 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:26,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:26,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-03-04 15:09:26,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:27,488 INFO L124 PetriNetUnfolderBase]: 11409/19208 cut-off events. [2025-03-04 15:09:27,489 INFO L125 PetriNetUnfolderBase]: For 1264/1264 co-relation queries the response was YES. [2025-03-04 15:09:27,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36252 conditions, 19208 events. 11409/19208 cut-off events. For 1264/1264 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 146526 event pairs, 10250 based on Foata normal form. 3/17902 useless extension candidates. Maximal degree in co-relation 36185. Up to 15801 conditions per place. [2025-03-04 15:09:27,620 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 40 selfloop transitions, 13 changer transitions 0/80 dead transitions. [2025-03-04 15:09:27,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 80 transitions, 338 flow [2025-03-04 15:09:27,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:09:27,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:09:27,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 433 transitions. [2025-03-04 15:09:27,621 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4325674325674326 [2025-03-04 15:09:27,621 INFO L175 Difference]: Start difference. First operand has 83 places, 74 transitions, 196 flow. Second operand 13 states and 433 transitions. [2025-03-04 15:09:27,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 80 transitions, 338 flow [2025-03-04 15:09:27,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 80 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:27,624 INFO L231 Difference]: Finished difference. Result has 96 places, 80 transitions, 269 flow [2025-03-04 15:09:27,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=269, PETRI_PLACES=96, PETRI_TRANSITIONS=80} [2025-03-04 15:09:27,624 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 19 predicate places. [2025-03-04 15:09:27,624 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 80 transitions, 269 flow [2025-03-04 15:09:27,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 30.466666666666665) internal successors, (457), 15 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:27,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:27,625 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:27,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 15:09:27,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:27,825 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:09:27,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:27,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1989996909, now seen corresponding path program 2 times [2025-03-04 15:09:27,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:27,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871826644] [2025-03-04 15:09:27,826 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:09:27,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:27,832 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 15:09:27,834 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 27 statements. [2025-03-04 15:09:27,834 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:09:27,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:27,851 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-04 15:09:27,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:27,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871826644] [2025-03-04 15:09:27,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871826644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:27,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:27,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:27,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239288961] [2025-03-04 15:09:27,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:27,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:27,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:27,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:27,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:27,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-03-04 15:09:27,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 80 transitions, 269 flow. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:27,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:27,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-03-04 15:09:27,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:28,837 INFO L124 PetriNetUnfolderBase]: 12443/20448 cut-off events. [2025-03-04 15:09:28,838 INFO L125 PetriNetUnfolderBase]: For 498/498 co-relation queries the response was YES. [2025-03-04 15:09:28,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38180 conditions, 20448 events. 12443/20448 cut-off events. For 498/498 co-relation queries the response was YES. Maximal size of possible extension queue 796. Compared 151637 event pairs, 3941 based on Foata normal form. 396/19981 useless extension candidates. Maximal degree in co-relation 38093. Up to 14696 conditions per place. [2025-03-04 15:09:28,912 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 77 selfloop transitions, 2 changer transitions 0/104 dead transitions. [2025-03-04 15:09:28,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 104 transitions, 480 flow [2025-03-04 15:09:28,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:28,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:28,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2025-03-04 15:09:28,913 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6753246753246753 [2025-03-04 15:09:28,913 INFO L175 Difference]: Start difference. First operand has 96 places, 80 transitions, 269 flow. Second operand 3 states and 156 transitions. [2025-03-04 15:09:28,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 104 transitions, 480 flow [2025-03-04 15:09:28,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 104 transitions, 470 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 15:09:28,915 INFO L231 Difference]: Finished difference. Result has 93 places, 79 transitions, 261 flow [2025-03-04 15:09:28,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=261, PETRI_PLACES=93, PETRI_TRANSITIONS=79} [2025-03-04 15:09:28,915 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 16 predicate places. [2025-03-04 15:09:28,915 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 79 transitions, 261 flow [2025-03-04 15:09:28,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:28,915 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:28,915 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:28,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 15:09:28,916 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:09:28,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:28,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1560362415, now seen corresponding path program 1 times [2025-03-04 15:09:28,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:28,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62423558] [2025-03-04 15:09:28,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:28,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:28,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 15:09:28,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 15:09:28,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:28,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:28,971 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-04 15:09:28,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:28,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62423558] [2025-03-04 15:09:28,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62423558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:28,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:28,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:28,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351671240] [2025-03-04 15:09:28,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:28,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:28,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:28,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:28,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:28,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-03-04 15:09:28,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 79 transitions, 261 flow. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:28,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:28,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-03-04 15:09:28,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:29,817 INFO L124 PetriNetUnfolderBase]: 11409/18886 cut-off events. [2025-03-04 15:09:29,818 INFO L125 PetriNetUnfolderBase]: For 1246/1246 co-relation queries the response was YES. [2025-03-04 15:09:29,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35943 conditions, 18886 events. 11409/18886 cut-off events. For 1246/1246 co-relation queries the response was YES. Maximal size of possible extension queue 737. Compared 138908 event pairs, 3644 based on Foata normal form. 396/18470 useless extension candidates. Maximal degree in co-relation 35860. Up to 13266 conditions per place. [2025-03-04 15:09:29,949 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 76 selfloop transitions, 2 changer transitions 0/103 dead transitions. [2025-03-04 15:09:29,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 103 transitions, 470 flow [2025-03-04 15:09:29,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:29,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:29,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2025-03-04 15:09:29,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.670995670995671 [2025-03-04 15:09:29,950 INFO L175 Difference]: Start difference. First operand has 93 places, 79 transitions, 261 flow. Second operand 3 states and 155 transitions. [2025-03-04 15:09:29,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 103 transitions, 470 flow [2025-03-04 15:09:29,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 103 transitions, 466 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:29,953 INFO L231 Difference]: Finished difference. Result has 92 places, 78 transitions, 259 flow [2025-03-04 15:09:29,953 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=259, PETRI_PLACES=92, PETRI_TRANSITIONS=78} [2025-03-04 15:09:29,953 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 15 predicate places. [2025-03-04 15:09:29,953 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 78 transitions, 259 flow [2025-03-04 15:09:29,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:29,953 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:29,953 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:29,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 15:09:29,954 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:09:29,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:29,954 INFO L85 PathProgramCache]: Analyzing trace with hash 498141535, now seen corresponding path program 1 times [2025-03-04 15:09:29,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:29,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798905325] [2025-03-04 15:09:29,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:29,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:29,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:09:29,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:09:29,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:29,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:29,992 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-04 15:09:29,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:29,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798905325] [2025-03-04 15:09:29,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798905325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:29,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:29,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:29,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117951224] [2025-03-04 15:09:29,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:29,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:29,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:29,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:29,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:29,998 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 77 [2025-03-04 15:09:29,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 78 transitions, 259 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:29,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:29,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 77 [2025-03-04 15:09:29,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:30,943 INFO L124 PetriNetUnfolderBase]: 12377/20383 cut-off events. [2025-03-04 15:09:30,944 INFO L125 PetriNetUnfolderBase]: For 1342/1342 co-relation queries the response was YES. [2025-03-04 15:09:30,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38837 conditions, 20383 events. 12377/20383 cut-off events. For 1342/1342 co-relation queries the response was YES. Maximal size of possible extension queue 759. Compared 152927 event pairs, 2132 based on Foata normal form. 363/20142 useless extension candidates. Maximal degree in co-relation 38754. Up to 13673 conditions per place. [2025-03-04 15:09:31,049 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 76 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2025-03-04 15:09:31,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 101 transitions, 465 flow [2025-03-04 15:09:31,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:31,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:31,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2025-03-04 15:09:31,050 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.670995670995671 [2025-03-04 15:09:31,050 INFO L175 Difference]: Start difference. First operand has 92 places, 78 transitions, 259 flow. Second operand 3 states and 155 transitions. [2025-03-04 15:09:31,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 101 transitions, 465 flow [2025-03-04 15:09:31,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 101 transitions, 457 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:31,053 INFO L231 Difference]: Finished difference. Result has 91 places, 77 transitions, 257 flow [2025-03-04 15:09:31,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=257, PETRI_PLACES=91, PETRI_TRANSITIONS=77} [2025-03-04 15:09:31,053 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 14 predicate places. [2025-03-04 15:09:31,053 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 77 transitions, 257 flow [2025-03-04 15:09:31,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:31,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:31,053 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 4, 3, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:31,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 15:09:31,053 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:09:31,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:31,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1737508824, now seen corresponding path program 1 times [2025-03-04 15:09:31,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:31,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659373601] [2025-03-04 15:09:31,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:31,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:31,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 15:09:31,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 15:09:31,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:31,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:09:31,069 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:09:31,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 15:09:31,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 15:09:31,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:31,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:09:31,091 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:09:31,091 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:09:31,092 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 19 remaining) [2025-03-04 15:09:31,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 19 remaining) [2025-03-04 15:09:31,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 19 remaining) [2025-03-04 15:09:31,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 19 remaining) [2025-03-04 15:09:31,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 19 remaining) [2025-03-04 15:09:31,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 19 remaining) [2025-03-04 15:09:31,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 19 remaining) [2025-03-04 15:09:31,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 19 remaining) [2025-03-04 15:09:31,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 19 remaining) [2025-03-04 15:09:31,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 19 remaining) [2025-03-04 15:09:31,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 19 remaining) [2025-03-04 15:09:31,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 19 remaining) [2025-03-04 15:09:31,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 19 remaining) [2025-03-04 15:09:31,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 19 remaining) [2025-03-04 15:09:31,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 19 remaining) [2025-03-04 15:09:31,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 19 remaining) [2025-03-04 15:09:31,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 19 remaining) [2025-03-04 15:09:31,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 19 remaining) [2025-03-04 15:09:31,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 19 remaining) [2025-03-04 15:09:31,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 15:09:31,093 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:31,094 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:09:31,094 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-04 15:09:31,119 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:09:31,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 99 transitions, 226 flow [2025-03-04 15:09:31,127 INFO L124 PetriNetUnfolderBase]: 9/110 cut-off events. [2025-03-04 15:09:31,127 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 15:09:31,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 110 events. 9/110 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 331 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 93. Up to 5 conditions per place. [2025-03-04 15:09:31,128 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 99 transitions, 226 flow [2025-03-04 15:09:31,131 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 99 transitions, 226 flow [2025-03-04 15:09:31,131 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:09:31,131 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;@51528996, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:09:31,131 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-04 15:09:31,132 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:09:31,132 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:09:31,132 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:09:31,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:31,132 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:09:31,132 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:09:31,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:31,132 INFO L85 PathProgramCache]: Analyzing trace with hash 472805, now seen corresponding path program 1 times [2025-03-04 15:09:31,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:31,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754656923] [2025-03-04 15:09:31,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:31,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:31,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:09:31,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:09:31,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:31,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:31,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:31,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:31,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754656923] [2025-03-04 15:09:31,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754656923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:31,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:31,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:31,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262903543] [2025-03-04 15:09:31,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:31,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:09:31,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:31,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:09:31,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:09:31,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 99 [2025-03-04 15:09:31,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 99 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:31,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:31,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 99 [2025-03-04 15:09:31,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:44,580 INFO L124 PetriNetUnfolderBase]: 173791/260043 cut-off events. [2025-03-04 15:09:44,580 INFO L125 PetriNetUnfolderBase]: For 14935/14935 co-relation queries the response was YES. [2025-03-04 15:09:45,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489334 conditions, 260043 events. 173791/260043 cut-off events. For 14935/14935 co-relation queries the response was YES. Maximal size of possible extension queue 8058. Compared 2290267 event pairs, 156660 based on Foata normal form. 17131/262292 useless extension candidates. Maximal degree in co-relation 75190. Up to 222110 conditions per place. [2025-03-04 15:09:46,303 INFO L140 encePairwiseOnDemand]: 88/99 looper letters, 55 selfloop transitions, 3 changer transitions 0/96 dead transitions. [2025-03-04 15:09:46,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 96 transitions, 336 flow [2025-03-04 15:09:46,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:09:46,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:09:46,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 218 transitions. [2025-03-04 15:09:46,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5505050505050505 [2025-03-04 15:09:46,304 INFO L175 Difference]: Start difference. First operand has 99 places, 99 transitions, 226 flow. Second operand 4 states and 218 transitions. [2025-03-04 15:09:46,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 96 transitions, 336 flow [2025-03-04 15:09:46,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 96 transitions, 330 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-04 15:09:46,311 INFO L231 Difference]: Finished difference. Result has 103 places, 96 transitions, 234 flow [2025-03-04 15:09:46,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=103, PETRI_TRANSITIONS=96} [2025-03-04 15:09:46,311 INFO L279 CegarLoopForPetriNet]: 99 programPoint places, 4 predicate places. [2025-03-04 15:09:46,311 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 96 transitions, 234 flow [2025-03-04 15:09:46,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:46,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:46,312 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:09:46,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 15:09:46,312 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:09:46,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:46,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1200854700, now seen corresponding path program 1 times [2025-03-04 15:09:46,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:46,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603758539] [2025-03-04 15:09:46,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:46,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:46,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:09:46,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:09:46,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:46,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:46,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:46,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:46,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603758539] [2025-03-04 15:09:46,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603758539] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:09:46,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014638428] [2025-03-04 15:09:46,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:46,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:46,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:09:46,346 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-04 15:09:46,347 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-04 15:09:46,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:09:46,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:09:46,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:46,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:46,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:09:46,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:09:46,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:46,427 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:09:46,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014638428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:46,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:09:46,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:09:46,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027586808] [2025-03-04 15:09:46,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:46,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:09:46,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:46,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:09:46,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:09:46,433 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 99 [2025-03-04 15:09:46,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 96 transitions, 234 flow. Second operand has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 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-04 15:09:46,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:46,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 99 [2025-03-04 15:09:46,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand