./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c1d27b7f98ac68d2da6120346c107c87df7f6f708200f0d5d2c806741122116e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:30:35,215 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:30:35,253 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:30:35,256 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:30:35,257 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:30:35,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:30:35,278 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:30:35,278 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:30:35,278 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:30:35,278 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:30:35,279 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:30:35,279 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:30:35,279 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:30:35,279 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:30:35,279 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:30:35,280 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:30:35,280 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:30:35,280 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:30:35,280 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:30:35,280 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:30:35,280 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:30:35,280 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:30:35,280 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:30:35,280 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:30:35,280 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:30:35,280 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:30:35,280 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:30:35,280 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:30:35,280 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:30:35,280 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:30:35,281 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:30:35,281 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:30:35,281 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:30:35,281 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:30:35,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:30:35,281 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:30:35,281 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:30:35,281 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:30:35,281 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:30:35,281 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:30:35,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:30:35,281 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:30:35,281 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:30:35,281 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:30:35,281 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:30:35,281 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 -> c1d27b7f98ac68d2da6120346c107c87df7f6f708200f0d5d2c806741122116e [2025-03-04 15:30:35,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:30:35,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:30:35,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:30:35,490 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:30:35,490 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:30:35,493 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2025-03-04 15:30:36,658 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1b0041bc/3b9b3ebbe5fb4f43973731307996f7eb/FLAG80a02077e [2025-03-04 15:30:36,893 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:30:36,893 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2025-03-04 15:30:36,901 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1b0041bc/3b9b3ebbe5fb4f43973731307996f7eb/FLAG80a02077e [2025-03-04 15:30:37,216 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1b0041bc/3b9b3ebbe5fb4f43973731307996f7eb [2025-03-04 15:30:37,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:30:37,219 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:30:37,220 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:30:37,220 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:30:37,223 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:30:37,223 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:30:37" (1/1) ... [2025-03-04 15:30:37,224 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ac688c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:37, skipping insertion in model container [2025-03-04 15:30:37,224 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:30:37" (1/1) ... [2025-03-04 15:30:37,240 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:30:37,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:30:37,376 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:30:37,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:30:37,412 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:30:37,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:37 WrapperNode [2025-03-04 15:30:37,412 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:30:37,413 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:30:37,414 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:30:37,414 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:30:37,420 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:30:37" (1/1) ... [2025-03-04 15:30:37,425 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:30:37" (1/1) ... [2025-03-04 15:30:37,444 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 137 [2025-03-04 15:30:37,446 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:30:37,447 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:30:37,447 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:30:37,447 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:30:37,453 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:37" (1/1) ... [2025-03-04 15:30:37,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:37" (1/1) ... [2025-03-04 15:30:37,456 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:37" (1/1) ... [2025-03-04 15:30:37,472 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-03-04 15:30:37,472 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:37" (1/1) ... [2025-03-04 15:30:37,472 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:37" (1/1) ... [2025-03-04 15:30:37,478 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:37" (1/1) ... [2025-03-04 15:30:37,479 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:37" (1/1) ... [2025-03-04 15:30:37,480 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:37" (1/1) ... [2025-03-04 15:30:37,481 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:37" (1/1) ... [2025-03-04 15:30:37,483 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:30:37,484 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:30:37,484 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:30:37,485 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:30:37,487 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:37" (1/1) ... [2025-03-04 15:30:37,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:30:37,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:37,516 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:30:37,522 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:30:37,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:30:37,535 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:30:37,535 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:30:37,535 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:30:37,535 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:30:37,535 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 15:30:37,535 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 15:30:37,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:30:37,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:30:37,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:30:37,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:30:37,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 15:30:37,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 15:30:37,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:30:37,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:30:37,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:30:37,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:30:37,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:30:37,536 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:30:37,616 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:30:37,617 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:30:37,847 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:30:37,847 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:30:38,006 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:30:38,007 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:30:38,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:30:38 BoogieIcfgContainer [2025-03-04 15:30:38,007 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:30:38,008 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:30:38,009 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:30:38,013 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:30:38,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:30:37" (1/3) ... [2025-03-04 15:30:38,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec86f37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:30:38, skipping insertion in model container [2025-03-04 15:30:38,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:37" (2/3) ... [2025-03-04 15:30:38,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec86f37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:30:38, skipping insertion in model container [2025-03-04 15:30:38,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:30:38" (3/3) ... [2025-03-04 15:30:38,017 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-sum.wvr.c [2025-03-04 15:30:38,027 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:30:38,028 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-three-array-sum.wvr.c that has 4 procedures, 57 locations, 1 initial locations, 6 loop locations, and 14 error locations. [2025-03-04 15:30:38,029 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:30:38,077 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:30:38,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 63 transitions, 147 flow [2025-03-04 15:30:38,126 INFO L124 PetriNetUnfolderBase]: 7/60 cut-off events. [2025-03-04 15:30:38,127 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 15:30:38,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 60 events. 7/60 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 149 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2025-03-04 15:30:38,129 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 63 transitions, 147 flow [2025-03-04 15:30:38,131 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 58 transitions, 131 flow [2025-03-04 15:30:38,137 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:30:38,147 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;@268760c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:30:38,147 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-03-04 15:30:38,150 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:30:38,151 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:30:38,151 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:30:38,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:38,151 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:30:38,151 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:30:38,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:38,156 INFO L85 PathProgramCache]: Analyzing trace with hash 529530, now seen corresponding path program 1 times [2025-03-04 15:30:38,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:38,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415301176] [2025-03-04 15:30:38,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:38,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:38,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:30:38,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:30:38,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:38,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:38,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:30:38,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:38,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415301176] [2025-03-04 15:30:38,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415301176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:30:38,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:30:38,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:30:38,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682070218] [2025-03-04 15:30:38,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:30:38,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:30:38,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:38,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:30:38,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:30:38,402 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 63 [2025-03-04 15:30:38,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 58 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:38,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:38,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 63 [2025-03-04 15:30:38,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:38,634 INFO L124 PetriNetUnfolderBase]: 827/1560 cut-off events. [2025-03-04 15:30:38,634 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2025-03-04 15:30:38,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2780 conditions, 1560 events. 827/1560 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9072 event pairs, 594 based on Foata normal form. 3/1239 useless extension candidates. Maximal degree in co-relation 2486. Up to 1110 conditions per place. [2025-03-04 15:30:38,651 INFO L140 encePairwiseOnDemand]: 52/63 looper letters, 28 selfloop transitions, 8 changer transitions 0/55 dead transitions. [2025-03-04 15:30:38,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 55 transitions, 197 flow [2025-03-04 15:30:38,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:30:38,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:30:38,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2025-03-04 15:30:38,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.503968253968254 [2025-03-04 15:30:38,664 INFO L175 Difference]: Start difference. First operand has 61 places, 58 transitions, 131 flow. Second operand 4 states and 127 transitions. [2025-03-04 15:30:38,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 55 transitions, 197 flow [2025-03-04 15:30:38,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 55 transitions, 188 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 15:30:38,672 INFO L231 Difference]: Finished difference. Result has 56 places, 55 transitions, 132 flow [2025-03-04 15:30:38,674 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=56, PETRI_TRANSITIONS=55} [2025-03-04 15:30:38,676 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -5 predicate places. [2025-03-04 15:30:38,677 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 55 transitions, 132 flow [2025-03-04 15:30:38,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:38,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:38,678 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:30:38,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:30:38,678 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:30:38,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:38,679 INFO L85 PathProgramCache]: Analyzing trace with hash 16415863, now seen corresponding path program 1 times [2025-03-04 15:30:38,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:38,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959367147] [2025-03-04 15:30:38,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:38,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:38,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:30:38,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:30:38,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:38,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:38,744 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:30:38,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:38,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959367147] [2025-03-04 15:30:38,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959367147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:30:38,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:30:38,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:30:38,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029358929] [2025-03-04 15:30:38,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:30:38,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:30:38,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:38,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:30:38,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:30:38,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 63 [2025-03-04 15:30:38,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 55 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:38,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:38,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 63 [2025-03-04 15:30:38,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:38,943 INFO L124 PetriNetUnfolderBase]: 854/1452 cut-off events. [2025-03-04 15:30:38,943 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-04 15:30:38,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2707 conditions, 1452 events. 854/1452 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 7494 event pairs, 638 based on Foata normal form. 3/1104 useless extension candidates. Maximal degree in co-relation 2639. Up to 1177 conditions per place. [2025-03-04 15:30:38,953 INFO L140 encePairwiseOnDemand]: 50/63 looper letters, 35 selfloop transitions, 10 changer transitions 0/64 dead transitions. [2025-03-04 15:30:38,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 64 transitions, 254 flow [2025-03-04 15:30:38,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:30:38,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:30:38,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2025-03-04 15:30:38,955 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5396825396825397 [2025-03-04 15:30:38,955 INFO L175 Difference]: Start difference. First operand has 56 places, 55 transitions, 132 flow. Second operand 4 states and 136 transitions. [2025-03-04 15:30:38,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 64 transitions, 254 flow [2025-03-04 15:30:38,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 64 transitions, 224 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:30:38,957 INFO L231 Difference]: Finished difference. Result has 59 places, 64 transitions, 198 flow [2025-03-04 15:30:38,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=198, PETRI_PLACES=59, PETRI_TRANSITIONS=64} [2025-03-04 15:30:38,957 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -2 predicate places. [2025-03-04 15:30:38,958 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 64 transitions, 198 flow [2025-03-04 15:30:38,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:38,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:38,958 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:30:38,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:30:38,958 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:30:38,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:38,958 INFO L85 PathProgramCache]: Analyzing trace with hash -580789642, now seen corresponding path program 1 times [2025-03-04 15:30:38,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:38,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165417738] [2025-03-04 15:30:38,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:38,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:38,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:30:38,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:30:38,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:38,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:39,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:30:39,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:39,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165417738] [2025-03-04 15:30:39,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165417738] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:39,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452920567] [2025-03-04 15:30:39,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:39,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:39,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:39,080 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:30:39,081 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:30:39,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:30:39,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:30:39,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:39,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:39,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:30:39,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:39,156 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:30:39,156 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:30:39,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:30:39,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452920567] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:30:39,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:30:39,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-04 15:30:39,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975691789] [2025-03-04 15:30:39,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:30:39,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:30:39,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:39,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:30:39,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:30:39,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 63 [2025-03-04 15:30:39,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 64 transitions, 198 flow. Second operand has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 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:30:39,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:39,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 63 [2025-03-04 15:30:39,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:39,502 INFO L124 PetriNetUnfolderBase]: 863/1488 cut-off events. [2025-03-04 15:30:39,502 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-03-04 15:30:39,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2822 conditions, 1488 events. 863/1488 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 7824 event pairs, 638 based on Foata normal form. 0/1132 useless extension candidates. Maximal degree in co-relation 2653. Up to 1180 conditions per place. [2025-03-04 15:30:39,511 INFO L140 encePairwiseOnDemand]: 50/63 looper letters, 35 selfloop transitions, 37 changer transitions 0/91 dead transitions. [2025-03-04 15:30:39,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 91 transitions, 462 flow [2025-03-04 15:30:39,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:30:39,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:30:39,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 301 transitions. [2025-03-04 15:30:39,513 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2025-03-04 15:30:39,513 INFO L175 Difference]: Start difference. First operand has 59 places, 64 transitions, 198 flow. Second operand 10 states and 301 transitions. [2025-03-04 15:30:39,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 91 transitions, 462 flow [2025-03-04 15:30:39,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 91 transitions, 462 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:30:39,518 INFO L231 Difference]: Finished difference. Result has 71 places, 91 transitions, 442 flow [2025-03-04 15:30:39,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=442, PETRI_PLACES=71, PETRI_TRANSITIONS=91} [2025-03-04 15:30:39,519 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 10 predicate places. [2025-03-04 15:30:39,520 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 91 transitions, 442 flow [2025-03-04 15:30:39,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 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:30:39,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:39,520 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:39,526 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:30:39,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:39,726 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:30:39,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:39,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1047794466, now seen corresponding path program 1 times [2025-03-04 15:30:39,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:39,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416149561] [2025-03-04 15:30:39,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:39,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:39,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:30:39,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:30:39,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:39,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:39,826 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:30:39,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:39,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416149561] [2025-03-04 15:30:39,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416149561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:30:39,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:30:39,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:30:39,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93737695] [2025-03-04 15:30:39,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:30:39,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:30:39,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:39,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:30:39,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:30:39,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 63 [2025-03-04 15:30:39,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 91 transitions, 442 flow. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:39,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:39,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 63 [2025-03-04 15:30:39,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:40,110 INFO L124 PetriNetUnfolderBase]: 1722/2851 cut-off events. [2025-03-04 15:30:40,110 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2025-03-04 15:30:40,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5482 conditions, 2851 events. 1722/2851 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 16678 event pairs, 732 based on Foata normal form. 86/2258 useless extension candidates. Maximal degree in co-relation 5387. Up to 1837 conditions per place. [2025-03-04 15:30:40,126 INFO L140 encePairwiseOnDemand]: 57/63 looper letters, 102 selfloop transitions, 4 changer transitions 0/126 dead transitions. [2025-03-04 15:30:40,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 126 transitions, 730 flow [2025-03-04 15:30:40,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:30:40,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:30:40,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2025-03-04 15:30:40,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6984126984126984 [2025-03-04 15:30:40,129 INFO L175 Difference]: Start difference. First operand has 71 places, 91 transitions, 442 flow. Second operand 4 states and 176 transitions. [2025-03-04 15:30:40,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 126 transitions, 730 flow [2025-03-04 15:30:40,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 126 transitions, 635 flow, removed 25 selfloop flow, removed 4 redundant places. [2025-03-04 15:30:40,133 INFO L231 Difference]: Finished difference. Result has 72 places, 94 transitions, 376 flow [2025-03-04 15:30:40,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=376, PETRI_PLACES=72, PETRI_TRANSITIONS=94} [2025-03-04 15:30:40,134 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 11 predicate places. [2025-03-04 15:30:40,135 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 94 transitions, 376 flow [2025-03-04 15:30:40,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:40,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:40,135 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:40,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:30:40,136 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:30:40,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:40,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1863825399, now seen corresponding path program 1 times [2025-03-04 15:30:40,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:40,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279418534] [2025-03-04 15:30:40,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:40,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:40,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:30:40,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:30:40,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:40,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:40,205 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:30:40,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:40,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279418534] [2025-03-04 15:30:40,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279418534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:30:40,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:30:40,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:30:40,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527209265] [2025-03-04 15:30:40,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:30:40,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:30:40,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:40,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:30:40,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:30:40,210 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 63 [2025-03-04 15:30:40,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 94 transitions, 376 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:40,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:40,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 63 [2025-03-04 15:30:40,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:40,467 INFO L124 PetriNetUnfolderBase]: 1896/3536 cut-off events. [2025-03-04 15:30:40,467 INFO L125 PetriNetUnfolderBase]: For 1158/1306 co-relation queries the response was YES. [2025-03-04 15:30:40,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7391 conditions, 3536 events. 1896/3536 cut-off events. For 1158/1306 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 23150 event pairs, 957 based on Foata normal form. 0/2954 useless extension candidates. Maximal degree in co-relation 7307. Up to 1978 conditions per place. [2025-03-04 15:30:40,486 INFO L140 encePairwiseOnDemand]: 58/63 looper letters, 88 selfloop transitions, 3 changer transitions 0/113 dead transitions. [2025-03-04 15:30:40,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 113 transitions, 618 flow [2025-03-04 15:30:40,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:30:40,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:30:40,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2025-03-04 15:30:40,487 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2025-03-04 15:30:40,487 INFO L175 Difference]: Start difference. First operand has 72 places, 94 transitions, 376 flow. Second operand 3 states and 135 transitions. [2025-03-04 15:30:40,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 113 transitions, 618 flow [2025-03-04 15:30:40,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 113 transitions, 612 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:30:40,490 INFO L231 Difference]: Finished difference. Result has 74 places, 96 transitions, 394 flow [2025-03-04 15:30:40,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=71, 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=3, PETRI_FLOW=394, PETRI_PLACES=74, PETRI_TRANSITIONS=96} [2025-03-04 15:30:40,491 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 13 predicate places. [2025-03-04 15:30:40,491 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 96 transitions, 394 flow [2025-03-04 15:30:40,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:40,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:40,491 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:40,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:30:40,491 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:30:40,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:40,492 INFO L85 PathProgramCache]: Analyzing trace with hash -976876366, now seen corresponding path program 1 times [2025-03-04 15:30:40,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:40,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708191355] [2025-03-04 15:30:40,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:40,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:40,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:30:40,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:30:40,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:40,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:40,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:30:40,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:40,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708191355] [2025-03-04 15:30:40,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708191355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:30:40,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:30:40,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:30:40,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516540197] [2025-03-04 15:30:40,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:30:40,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:30:40,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:40,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:30:40,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:30:40,601 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 63 [2025-03-04 15:30:40,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 96 transitions, 394 flow. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:40,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:40,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 63 [2025-03-04 15:30:40,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:40,968 INFO L124 PetriNetUnfolderBase]: 2672/4492 cut-off events. [2025-03-04 15:30:40,968 INFO L125 PetriNetUnfolderBase]: For 2085/2213 co-relation queries the response was YES. [2025-03-04 15:30:40,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10740 conditions, 4492 events. 2672/4492 cut-off events. For 2085/2213 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 26738 event pairs, 1732 based on Foata normal form. 114/4062 useless extension candidates. Maximal degree in co-relation 10606. Up to 2458 conditions per place. [2025-03-04 15:30:40,993 INFO L140 encePairwiseOnDemand]: 51/63 looper letters, 105 selfloop transitions, 40 changer transitions 0/167 dead transitions. [2025-03-04 15:30:40,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 167 transitions, 960 flow [2025-03-04 15:30:40,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:30:40,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:30:40,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 258 transitions. [2025-03-04 15:30:40,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6825396825396826 [2025-03-04 15:30:40,995 INFO L175 Difference]: Start difference. First operand has 74 places, 96 transitions, 394 flow. Second operand 6 states and 258 transitions. [2025-03-04 15:30:40,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 167 transitions, 960 flow [2025-03-04 15:30:41,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 167 transitions, 951 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:30:41,004 INFO L231 Difference]: Finished difference. Result has 82 places, 122 transitions, 708 flow [2025-03-04 15:30:41,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=708, PETRI_PLACES=82, PETRI_TRANSITIONS=122} [2025-03-04 15:30:41,005 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 21 predicate places. [2025-03-04 15:30:41,005 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 122 transitions, 708 flow [2025-03-04 15:30:41,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:41,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:41,005 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:41,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:30:41,005 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:30:41,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:41,006 INFO L85 PathProgramCache]: Analyzing trace with hash 134865051, now seen corresponding path program 1 times [2025-03-04 15:30:41,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:41,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204747707] [2025-03-04 15:30:41,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:41,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:41,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:30:41,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:30:41,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:41,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:41,065 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:30:41,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:41,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204747707] [2025-03-04 15:30:41,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204747707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:30:41,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:30:41,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:30:41,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243023274] [2025-03-04 15:30:41,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:30:41,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:30:41,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:41,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:30:41,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:30:41,076 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 63 [2025-03-04 15:30:41,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 122 transitions, 708 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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:30:41,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:41,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 63 [2025-03-04 15:30:41,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:41,608 INFO L124 PetriNetUnfolderBase]: 3936/6698 cut-off events. [2025-03-04 15:30:41,608 INFO L125 PetriNetUnfolderBase]: For 4654/4710 co-relation queries the response was YES. [2025-03-04 15:30:41,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16790 conditions, 6698 events. 3936/6698 cut-off events. For 4654/4710 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 42909 event pairs, 2364 based on Foata normal form. 276/6496 useless extension candidates. Maximal degree in co-relation 16624. Up to 4245 conditions per place. [2025-03-04 15:30:41,645 INFO L140 encePairwiseOnDemand]: 57/63 looper letters, 137 selfloop transitions, 4 changer transitions 0/160 dead transitions. [2025-03-04 15:30:41,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 160 transitions, 1140 flow [2025-03-04 15:30:41,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:30:41,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:30:41,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2025-03-04 15:30:41,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-04 15:30:41,647 INFO L175 Difference]: Start difference. First operand has 82 places, 122 transitions, 708 flow. Second operand 4 states and 168 transitions. [2025-03-04 15:30:41,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 160 transitions, 1140 flow [2025-03-04 15:30:41,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 160 transitions, 1136 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-03-04 15:30:41,658 INFO L231 Difference]: Finished difference. Result has 87 places, 123 transitions, 725 flow [2025-03-04 15:30:41,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=725, PETRI_PLACES=87, PETRI_TRANSITIONS=123} [2025-03-04 15:30:41,659 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 26 predicate places. [2025-03-04 15:30:41,659 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 123 transitions, 725 flow [2025-03-04 15:30:41,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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:30:41,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:41,659 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:41,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:30:41,659 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:30:41,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:41,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1970817732, now seen corresponding path program 1 times [2025-03-04 15:30:41,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:41,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994769487] [2025-03-04 15:30:41,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:41,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:41,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:30:41,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:30:41,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:41,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:41,744 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:30:41,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:41,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994769487] [2025-03-04 15:30:41,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994769487] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:41,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772247950] [2025-03-04 15:30:41,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:41,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:41,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:41,747 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:30:41,749 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:30:41,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:30:41,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:30:41,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:41,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:41,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:30:41,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:41,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:30:41,855 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:30:41,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772247950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:30:41,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:30:41,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 8 [2025-03-04 15:30:41,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263969697] [2025-03-04 15:30:41,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:30:41,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:30:41,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:41,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:30:41,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:30:41,864 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 63 [2025-03-04 15:30:41,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 123 transitions, 725 flow. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 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:30:41,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:41,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 63 [2025-03-04 15:30:41,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:42,213 INFO L124 PetriNetUnfolderBase]: 2585/4361 cut-off events. [2025-03-04 15:30:42,213 INFO L125 PetriNetUnfolderBase]: For 4239/4465 co-relation queries the response was YES. [2025-03-04 15:30:42,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11738 conditions, 4361 events. 2585/4361 cut-off events. For 4239/4465 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 24748 event pairs, 1883 based on Foata normal form. 48/4030 useless extension candidates. Maximal degree in co-relation 11569. Up to 3154 conditions per place. [2025-03-04 15:30:42,234 INFO L140 encePairwiseOnDemand]: 53/63 looper letters, 107 selfloop transitions, 24 changer transitions 2/155 dead transitions. [2025-03-04 15:30:42,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 155 transitions, 1100 flow [2025-03-04 15:30:42,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:30:42,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:30:42,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 246 transitions. [2025-03-04 15:30:42,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6507936507936508 [2025-03-04 15:30:42,236 INFO L175 Difference]: Start difference. First operand has 87 places, 123 transitions, 725 flow. Second operand 6 states and 246 transitions. [2025-03-04 15:30:42,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 155 transitions, 1100 flow [2025-03-04 15:30:42,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 155 transitions, 1090 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:30:42,244 INFO L231 Difference]: Finished difference. Result has 92 places, 125 transitions, 795 flow [2025-03-04 15:30:42,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=719, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=795, PETRI_PLACES=92, PETRI_TRANSITIONS=125} [2025-03-04 15:30:42,247 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 31 predicate places. [2025-03-04 15:30:42,247 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 125 transitions, 795 flow [2025-03-04 15:30:42,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 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:30:42,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:42,247 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:42,253 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:30:42,451 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,SelfDestructingSolverStorable7 [2025-03-04 15:30:42,451 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:30:42,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:42,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1962974817, now seen corresponding path program 1 times [2025-03-04 15:30:42,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:42,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745450855] [2025-03-04 15:30:42,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:42,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:42,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:30:42,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:30:42,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:42,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:42,506 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:30:42,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:42,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745450855] [2025-03-04 15:30:42,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745450855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:30:42,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:30:42,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:30:42,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615955913] [2025-03-04 15:30:42,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:30:42,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:30:42,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:42,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:30:42,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:30:42,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 63 [2025-03-04 15:30:42,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 125 transitions, 795 flow. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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:30:42,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:42,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 63 [2025-03-04 15:30:42,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:43,029 INFO L124 PetriNetUnfolderBase]: 4650/8008 cut-off events. [2025-03-04 15:30:43,029 INFO L125 PetriNetUnfolderBase]: For 8524/8821 co-relation queries the response was YES. [2025-03-04 15:30:43,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21066 conditions, 8008 events. 4650/8008 cut-off events. For 8524/8821 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 51969 event pairs, 2213 based on Foata normal form. 127/7339 useless extension candidates. Maximal degree in co-relation 20891. Up to 4089 conditions per place. [2025-03-04 15:30:43,115 INFO L140 encePairwiseOnDemand]: 58/63 looper letters, 151 selfloop transitions, 3 changer transitions 0/174 dead transitions. [2025-03-04 15:30:43,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 174 transitions, 1343 flow [2025-03-04 15:30:43,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:30:43,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:30:43,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2025-03-04 15:30:43,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6706349206349206 [2025-03-04 15:30:43,117 INFO L175 Difference]: Start difference. First operand has 92 places, 125 transitions, 795 flow. Second operand 4 states and 169 transitions. [2025-03-04 15:30:43,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 174 transitions, 1343 flow [2025-03-04 15:30:43,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 174 transitions, 1316 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:30:43,125 INFO L231 Difference]: Finished difference. Result has 95 places, 127 transitions, 790 flow [2025-03-04 15:30:43,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=790, PETRI_PLACES=95, PETRI_TRANSITIONS=127} [2025-03-04 15:30:43,126 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 34 predicate places. [2025-03-04 15:30:43,126 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 127 transitions, 790 flow [2025-03-04 15:30:43,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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:30:43,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:43,126 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-03-04 15:30:43,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:30:43,127 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:30:43,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:43,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1324295241, now seen corresponding path program 2 times [2025-03-04 15:30:43,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:43,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687081464] [2025-03-04 15:30:43,127 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:30:43,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:43,135 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:30:43,138 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 15:30:43,139 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:30:43,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:43,168 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:30:43,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:43,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687081464] [2025-03-04 15:30:43,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687081464] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:43,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277531471] [2025-03-04 15:30:43,169 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:30:43,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:43,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:43,171 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:30:43,173 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:30:43,218 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:30:43,226 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 15:30:43,227 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:30:43,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:43,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:30:43,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:43,251 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:30:43,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:30:43,280 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:30:43,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277531471] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:30:43,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:30:43,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-03-04 15:30:43,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882865809] [2025-03-04 15:30:43,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:30:43,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:30:43,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:43,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:30:43,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:30:43,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 63 [2025-03-04 15:30:43,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 127 transitions, 790 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:43,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:43,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 63 [2025-03-04 15:30:43,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:43,763 INFO L124 PetriNetUnfolderBase]: 3253/6229 cut-off events. [2025-03-04 15:30:43,763 INFO L125 PetriNetUnfolderBase]: For 6363/6657 co-relation queries the response was YES. [2025-03-04 15:30:43,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16897 conditions, 6229 events. 3253/6229 cut-off events. For 6363/6657 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 43298 event pairs, 2480 based on Foata normal form. 100/5900 useless extension candidates. Maximal degree in co-relation 16723. Up to 4534 conditions per place. [2025-03-04 15:30:43,803 INFO L140 encePairwiseOnDemand]: 58/63 looper letters, 89 selfloop transitions, 16 changer transitions 0/126 dead transitions. [2025-03-04 15:30:43,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 126 transitions, 990 flow [2025-03-04 15:30:43,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:30:43,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:30:43,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2025-03-04 15:30:43,804 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49206349206349204 [2025-03-04 15:30:43,804 INFO L175 Difference]: Start difference. First operand has 95 places, 127 transitions, 790 flow. Second operand 4 states and 124 transitions. [2025-03-04 15:30:43,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 126 transitions, 990 flow [2025-03-04 15:30:43,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 126 transitions, 988 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:30:43,819 INFO L231 Difference]: Finished difference. Result has 96 places, 126 transitions, 810 flow [2025-03-04 15:30:43,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=810, PETRI_PLACES=96, PETRI_TRANSITIONS=126} [2025-03-04 15:30:43,819 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 35 predicate places. [2025-03-04 15:30:43,819 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 126 transitions, 810 flow [2025-03-04 15:30:43,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:43,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:43,820 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1] [2025-03-04 15:30:43,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:30:44,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:44,024 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:30:44,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:44,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1425033367, now seen corresponding path program 1 times [2025-03-04 15:30:44,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:44,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987875214] [2025-03-04 15:30:44,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:44,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:44,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:30:44,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:30:44,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:44,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:44,116 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 15:30:44,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:44,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987875214] [2025-03-04 15:30:44,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987875214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:30:44,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:30:44,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:30:44,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561282929] [2025-03-04 15:30:44,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:30:44,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:30:44,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:44,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:30:44,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:30:44,123 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 63 [2025-03-04 15:30:44,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 126 transitions, 810 flow. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 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:30:44,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:44,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 63 [2025-03-04 15:30:44,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:44,557 INFO L124 PetriNetUnfolderBase]: 3243/6189 cut-off events. [2025-03-04 15:30:44,557 INFO L125 PetriNetUnfolderBase]: For 5993/6281 co-relation queries the response was YES. [2025-03-04 15:30:44,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16610 conditions, 6189 events. 3243/6189 cut-off events. For 5993/6281 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 43200 event pairs, 2480 based on Foata normal form. 95/5849 useless extension candidates. Maximal degree in co-relation 16504. Up to 4498 conditions per place. [2025-03-04 15:30:44,593 INFO L140 encePairwiseOnDemand]: 54/63 looper letters, 65 selfloop transitions, 16 changer transitions 0/104 dead transitions. [2025-03-04 15:30:44,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 104 transitions, 754 flow [2025-03-04 15:30:44,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:30:44,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:30:44,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2025-03-04 15:30:44,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.626984126984127 [2025-03-04 15:30:44,594 INFO L175 Difference]: Start difference. First operand has 96 places, 126 transitions, 810 flow. Second operand 4 states and 158 transitions. [2025-03-04 15:30:44,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 104 transitions, 754 flow [2025-03-04 15:30:44,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 104 transitions, 684 flow, removed 16 selfloop flow, removed 5 redundant places. [2025-03-04 15:30:44,605 INFO L231 Difference]: Finished difference. Result has 95 places, 104 transitions, 561 flow [2025-03-04 15:30:44,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=561, PETRI_PLACES=95, PETRI_TRANSITIONS=104} [2025-03-04 15:30:44,605 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 34 predicate places. [2025-03-04 15:30:44,606 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 104 transitions, 561 flow [2025-03-04 15:30:44,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 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:30:44,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:44,606 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:44,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:30:44,606 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:30:44,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:44,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1862717215, now seen corresponding path program 1 times [2025-03-04 15:30:44,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:44,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070995696] [2025-03-04 15:30:44,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:44,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:44,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:30:44,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:30:44,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:44,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:44,677 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:30:44,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:44,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070995696] [2025-03-04 15:30:44,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070995696] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:44,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63825950] [2025-03-04 15:30:44,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:44,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:44,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:44,681 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:30:44,682 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:30:44,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:30:44,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:30:44,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:44,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:44,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:30:44,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:44,768 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:30:44,768 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:30:44,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63825950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:30:44,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:30:44,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 15:30:44,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796243991] [2025-03-04 15:30:44,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:30:44,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:30:44,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:44,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:30:44,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:30:44,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 63 [2025-03-04 15:30:44,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 104 transitions, 561 flow. Second operand has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 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:30:44,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:44,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 63 [2025-03-04 15:30:44,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:45,296 INFO L124 PetriNetUnfolderBase]: 3645/6017 cut-off events. [2025-03-04 15:30:45,296 INFO L125 PetriNetUnfolderBase]: For 4974/5370 co-relation queries the response was YES. [2025-03-04 15:30:45,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16671 conditions, 6017 events. 3645/6017 cut-off events. For 4974/5370 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 36843 event pairs, 925 based on Foata normal form. 271/5752 useless extension candidates. Maximal degree in co-relation 16576. Up to 1856 conditions per place. [2025-03-04 15:30:45,319 INFO L140 encePairwiseOnDemand]: 58/63 looper letters, 151 selfloop transitions, 9 changer transitions 0/181 dead transitions. [2025-03-04 15:30:45,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 181 transitions, 1167 flow [2025-03-04 15:30:45,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:30:45,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:30:45,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 258 transitions. [2025-03-04 15:30:45,320 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6825396825396826 [2025-03-04 15:30:45,320 INFO L175 Difference]: Start difference. First operand has 95 places, 104 transitions, 561 flow. Second operand 6 states and 258 transitions. [2025-03-04 15:30:45,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 181 transitions, 1167 flow [2025-03-04 15:30:45,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 181 transitions, 1135 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:30:45,332 INFO L231 Difference]: Finished difference. Result has 96 places, 103 transitions, 543 flow [2025-03-04 15:30:45,332 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=543, PETRI_PLACES=96, PETRI_TRANSITIONS=103} [2025-03-04 15:30:45,332 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 35 predicate places. [2025-03-04 15:30:45,333 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 103 transitions, 543 flow [2025-03-04 15:30:45,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 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:30:45,333 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:45,333 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:45,339 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:30:45,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:45,534 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:30:45,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:45,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1508646664, now seen corresponding path program 1 times [2025-03-04 15:30:45,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:45,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004002550] [2025-03-04 15:30:45,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:45,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:45,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:30:45,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:30:45,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:45,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:45,655 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:30:45,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:45,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004002550] [2025-03-04 15:30:45,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004002550] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:45,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523762762] [2025-03-04 15:30:45,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:45,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:45,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:45,658 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:30:45,659 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:30:45,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:30:45,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:30:45,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:45,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:45,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 15:30:45,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:45,801 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 15:30:45,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:30:45,889 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 15:30:45,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523762762] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:30:45,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:30:45,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2025-03-04 15:30:45,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782501163] [2025-03-04 15:30:45,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:30:45,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 15:30:45,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:45,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 15:30:45,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2025-03-04 15:30:46,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 63 [2025-03-04 15:30:46,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 103 transitions, 543 flow. Second operand has 21 states, 21 states have (on average 23.285714285714285) internal successors, (489), 21 states have internal predecessors, (489), 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:30:46,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:46,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 63 [2025-03-04 15:30:46,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:46,965 INFO L124 PetriNetUnfolderBase]: 6245/11377 cut-off events. [2025-03-04 15:30:46,966 INFO L125 PetriNetUnfolderBase]: For 16407/16936 co-relation queries the response was YES. [2025-03-04 15:30:46,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32085 conditions, 11377 events. 6245/11377 cut-off events. For 16407/16936 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 82333 event pairs, 4602 based on Foata normal form. 96/10516 useless extension candidates. Maximal degree in co-relation 31990. Up to 4469 conditions per place. [2025-03-04 15:30:47,021 INFO L140 encePairwiseOnDemand]: 53/63 looper letters, 68 selfloop transitions, 52 changer transitions 0/140 dead transitions. [2025-03-04 15:30:47,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 140 transitions, 971 flow [2025-03-04 15:30:47,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:30:47,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 15:30:47,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 352 transitions. [2025-03-04 15:30:47,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4656084656084656 [2025-03-04 15:30:47,022 INFO L175 Difference]: Start difference. First operand has 96 places, 103 transitions, 543 flow. Second operand 12 states and 352 transitions. [2025-03-04 15:30:47,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 140 transitions, 971 flow [2025-03-04 15:30:47,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 140 transitions, 919 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-04 15:30:47,041 INFO L231 Difference]: Finished difference. Result has 102 places, 111 transitions, 678 flow [2025-03-04 15:30:47,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=678, PETRI_PLACES=102, PETRI_TRANSITIONS=111} [2025-03-04 15:30:47,041 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 41 predicate places. [2025-03-04 15:30:47,041 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 111 transitions, 678 flow [2025-03-04 15:30:47,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 23.285714285714285) internal successors, (489), 21 states have internal predecessors, (489), 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:30:47,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:47,042 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:47,047 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:30:47,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 15:30:47,242 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:30:47,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:47,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1909658321, now seen corresponding path program 1 times [2025-03-04 15:30:47,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:47,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76406692] [2025-03-04 15:30:47,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:47,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:47,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:30:47,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:30:47,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:47,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:47,315 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:30:47,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:47,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76406692] [2025-03-04 15:30:47,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76406692] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:47,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052056946] [2025-03-04 15:30:47,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:47,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:47,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:47,318 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:30:47,319 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:30:47,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:30:47,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:30:47,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:47,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:47,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:30:47,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:47,406 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:30:47,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:30:47,436 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:30:47,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052056946] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:30:47,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:30:47,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 15:30:47,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206308625] [2025-03-04 15:30:47,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:30:47,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:30:47,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:47,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:30:47,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:30:47,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 63 [2025-03-04 15:30:47,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 111 transitions, 678 flow. Second operand has 12 states, 12 states have (on average 28.0) internal successors, (336), 12 states have internal predecessors, (336), 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:30:47,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:47,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 63 [2025-03-04 15:30:47,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:49,018 INFO L124 PetriNetUnfolderBase]: 12813/20265 cut-off events. [2025-03-04 15:30:49,018 INFO L125 PetriNetUnfolderBase]: For 16361/17941 co-relation queries the response was YES. [2025-03-04 15:30:49,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51949 conditions, 20265 events. 12813/20265 cut-off events. For 16361/17941 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 137812 event pairs, 3523 based on Foata normal form. 1394/19673 useless extension candidates. Maximal degree in co-relation 51843. Up to 8012 conditions per place. [2025-03-04 15:30:49,141 INFO L140 encePairwiseOnDemand]: 58/63 looper letters, 238 selfloop transitions, 15 changer transitions 0/274 dead transitions. [2025-03-04 15:30:49,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 274 transitions, 1776 flow [2025-03-04 15:30:49,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:30:49,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:30:49,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 437 transitions. [2025-03-04 15:30:49,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6936507936507936 [2025-03-04 15:30:49,143 INFO L175 Difference]: Start difference. First operand has 102 places, 111 transitions, 678 flow. Second operand 10 states and 437 transitions. [2025-03-04 15:30:49,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 274 transitions, 1776 flow [2025-03-04 15:30:49,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 274 transitions, 1678 flow, removed 4 selfloop flow, removed 8 redundant places. [2025-03-04 15:30:49,182 INFO L231 Difference]: Finished difference. Result has 106 places, 120 transitions, 658 flow [2025-03-04 15:30:49,183 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=658, PETRI_PLACES=106, PETRI_TRANSITIONS=120} [2025-03-04 15:30:49,183 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 45 predicate places. [2025-03-04 15:30:49,183 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 120 transitions, 658 flow [2025-03-04 15:30:49,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 28.0) internal successors, (336), 12 states have internal predecessors, (336), 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:30:49,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:49,183 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 2, 2, 2, 1, 1, 1] [2025-03-04 15:30:49,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 15:30:49,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:49,388 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:30:49,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:49,388 INFO L85 PathProgramCache]: Analyzing trace with hash -480943881, now seen corresponding path program 2 times [2025-03-04 15:30:49,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:49,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65872956] [2025-03-04 15:30:49,389 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:30:49,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:49,396 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 15:30:49,401 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 23 statements. [2025-03-04 15:30:49,404 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:30:49,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:49,430 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 15:30:49,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:49,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65872956] [2025-03-04 15:30:49,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65872956] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:49,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136786259] [2025-03-04 15:30:49,431 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:30:49,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:49,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:49,433 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:30:49,435 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:30:49,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 15:30:49,490 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 23 statements. [2025-03-04 15:30:49,491 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:30:49,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:49,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:30:49,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:49,517 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 15:30:49,517 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:30:49,548 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 15:30:49,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136786259] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:30:49,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:30:49,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-04 15:30:49,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25985904] [2025-03-04 15:30:49,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:30:49,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:30:49,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:49,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:30:49,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:30:49,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 63 [2025-03-04 15:30:49,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 120 transitions, 658 flow. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:49,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:49,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 63 [2025-03-04 15:30:49,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:50,625 INFO L124 PetriNetUnfolderBase]: 11997/19999 cut-off events. [2025-03-04 15:30:50,625 INFO L125 PetriNetUnfolderBase]: For 25024/26428 co-relation queries the response was YES. [2025-03-04 15:30:50,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57751 conditions, 19999 events. 11997/19999 cut-off events. For 25024/26428 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 144427 event pairs, 8898 based on Foata normal form. 392/19349 useless extension candidates. Maximal degree in co-relation 57657. Up to 16218 conditions per place. [2025-03-04 15:30:50,764 INFO L140 encePairwiseOnDemand]: 53/63 looper letters, 55 selfloop transitions, 43 changer transitions 0/118 dead transitions. [2025-03-04 15:30:50,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 118 transitions, 834 flow [2025-03-04 15:30:50,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:30:50,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:30:50,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2025-03-04 15:30:50,764 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2025-03-04 15:30:50,764 INFO L175 Difference]: Start difference. First operand has 106 places, 120 transitions, 658 flow. Second operand 5 states and 145 transitions. [2025-03-04 15:30:50,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 118 transitions, 834 flow [2025-03-04 15:30:50,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 118 transitions, 787 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-04 15:30:50,826 INFO L231 Difference]: Finished difference. Result has 102 places, 118 transitions, 677 flow [2025-03-04 15:30:50,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=677, PETRI_PLACES=102, PETRI_TRANSITIONS=118} [2025-03-04 15:30:50,826 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 41 predicate places. [2025-03-04 15:30:50,826 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 118 transitions, 677 flow [2025-03-04 15:30:50,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:50,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:50,826 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:50,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 15:30:51,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:51,027 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:30:51,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:51,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1272279807, now seen corresponding path program 1 times [2025-03-04 15:30:51,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:51,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601165176] [2025-03-04 15:30:51,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:51,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:51,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:30:51,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:30:51,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:51,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:51,100 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:30:51,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:51,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601165176] [2025-03-04 15:30:51,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601165176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:30:51,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:30:51,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:30:51,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768678996] [2025-03-04 15:30:51,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:30:51,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:30:51,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:51,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:30:51,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:30:51,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 63 [2025-03-04 15:30:51,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 118 transitions, 677 flow. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 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:30:51,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:51,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 63 [2025-03-04 15:30:51,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:52,424 INFO L124 PetriNetUnfolderBase]: 14489/23499 cut-off events. [2025-03-04 15:30:52,424 INFO L125 PetriNetUnfolderBase]: For 25203/26123 co-relation queries the response was YES. [2025-03-04 15:30:52,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64542 conditions, 23499 events. 14489/23499 cut-off events. For 25203/26123 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 168131 event pairs, 10410 based on Foata normal form. 128/21040 useless extension candidates. Maximal degree in co-relation 46484. Up to 18791 conditions per place. [2025-03-04 15:30:52,568 INFO L140 encePairwiseOnDemand]: 54/63 looper letters, 73 selfloop transitions, 15 changer transitions 28/135 dead transitions. [2025-03-04 15:30:52,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 135 transitions, 977 flow [2025-03-04 15:30:52,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:30:52,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:30:52,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 229 transitions. [2025-03-04 15:30:52,569 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6058201058201058 [2025-03-04 15:30:52,569 INFO L175 Difference]: Start difference. First operand has 102 places, 118 transitions, 677 flow. Second operand 6 states and 229 transitions. [2025-03-04 15:30:52,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 135 transitions, 977 flow [2025-03-04 15:30:52,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 135 transitions, 899 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:30:52,640 INFO L231 Difference]: Finished difference. Result has 106 places, 107 transitions, 545 flow [2025-03-04 15:30:52,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=545, PETRI_PLACES=106, PETRI_TRANSITIONS=107} [2025-03-04 15:30:52,641 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 45 predicate places. [2025-03-04 15:30:52,641 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 107 transitions, 545 flow [2025-03-04 15:30:52,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 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:30:52,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:52,641 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:52,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 15:30:52,641 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:30:52,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:52,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1829748594, now seen corresponding path program 1 times [2025-03-04 15:30:52,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:52,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58038673] [2025-03-04 15:30:52,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:52,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:52,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:30:52,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:30:52,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:52,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:52,700 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:30:52,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:52,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58038673] [2025-03-04 15:30:52,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58038673] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:52,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204348617] [2025-03-04 15:30:52,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:52,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:52,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:52,702 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:30:52,704 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:30:52,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:30:52,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:30:52,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:52,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:52,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 15:30:52,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:52,787 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:30:52,787 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:30:52,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204348617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:30:52,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:30:52,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-04 15:30:52,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083322356] [2025-03-04 15:30:52,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:30:52,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:30:52,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:52,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:30:52,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:30:52,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 63 [2025-03-04 15:30:52,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 107 transitions, 545 flow. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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:30:52,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:52,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 63 [2025-03-04 15:30:52,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:54,205 INFO L124 PetriNetUnfolderBase]: 17169/25290 cut-off events. [2025-03-04 15:30:54,205 INFO L125 PetriNetUnfolderBase]: For 26116/27934 co-relation queries the response was YES. [2025-03-04 15:30:54,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73330 conditions, 25290 events. 17169/25290 cut-off events. For 26116/27934 co-relation queries the response was YES. Maximal size of possible extension queue 619. Compared 162839 event pairs, 1808 based on Foata normal form. 996/25593 useless extension candidates. Maximal degree in co-relation 53318. Up to 9848 conditions per place. [2025-03-04 15:30:54,344 INFO L140 encePairwiseOnDemand]: 57/63 looper letters, 135 selfloop transitions, 7 changer transitions 0/157 dead transitions. [2025-03-04 15:30:54,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 157 transitions, 1053 flow [2025-03-04 15:30:54,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:30:54,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:30:54,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2025-03-04 15:30:54,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2025-03-04 15:30:54,345 INFO L175 Difference]: Start difference. First operand has 106 places, 107 transitions, 545 flow. Second operand 4 states and 159 transitions. [2025-03-04 15:30:54,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 157 transitions, 1053 flow [2025-03-04 15:30:54,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 157 transitions, 961 flow, removed 16 selfloop flow, removed 10 redundant places. [2025-03-04 15:30:54,482 INFO L231 Difference]: Finished difference. Result has 89 places, 105 transitions, 475 flow [2025-03-04 15:30:54,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=475, PETRI_PLACES=89, PETRI_TRANSITIONS=105} [2025-03-04 15:30:54,483 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 28 predicate places. [2025-03-04 15:30:54,483 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 105 transitions, 475 flow [2025-03-04 15:30:54,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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:30:54,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:54,483 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:54,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 15:30:54,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 15:30:54,685 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:30:54,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:54,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1829748595, now seen corresponding path program 1 times [2025-03-04 15:30:54,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:54,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412868471] [2025-03-04 15:30:54,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:54,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:54,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:30:54,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:30:54,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:54,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:54,742 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:30:54,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:54,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412868471] [2025-03-04 15:30:54,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412868471] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:54,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769286045] [2025-03-04 15:30:54,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:54,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:54,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:54,744 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:30:54,746 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:30:54,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:30:54,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:30:54,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:54,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:54,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:30:54,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:54,832 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:30:54,833 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:30:54,858 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:30:54,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769286045] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:30:54,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:30:54,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 15:30:54,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681927266] [2025-03-04 15:30:54,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:30:54,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:30:54,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:54,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:30:54,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:30:54,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 63 [2025-03-04 15:30:54,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 105 transitions, 475 flow. Second operand has 10 states, 10 states have (on average 27.7) internal successors, (277), 10 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:54,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:54,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 63 [2025-03-04 15:30:54,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:57,041 INFO L124 PetriNetUnfolderBase]: 21053/34032 cut-off events. [2025-03-04 15:30:57,041 INFO L125 PetriNetUnfolderBase]: For 37009/38493 co-relation queries the response was YES. [2025-03-04 15:30:57,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93649 conditions, 34032 events. 21053/34032 cut-off events. For 37009/38493 co-relation queries the response was YES. Maximal size of possible extension queue 748. Compared 250708 event pairs, 3598 based on Foata normal form. 1884/34987 useless extension candidates. Maximal degree in co-relation 67784. Up to 8676 conditions per place. [2025-03-04 15:30:57,261 INFO L140 encePairwiseOnDemand]: 56/63 looper letters, 216 selfloop transitions, 10 changer transitions 0/242 dead transitions. [2025-03-04 15:30:57,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 242 transitions, 1497 flow [2025-03-04 15:30:57,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:30:57,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:30:57,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 287 transitions. [2025-03-04 15:30:57,262 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6507936507936508 [2025-03-04 15:30:57,262 INFO L175 Difference]: Start difference. First operand has 89 places, 105 transitions, 475 flow. Second operand 7 states and 287 transitions. [2025-03-04 15:30:57,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 242 transitions, 1497 flow [2025-03-04 15:30:57,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 242 transitions, 1475 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:30:57,339 INFO L231 Difference]: Finished difference. Result has 96 places, 110 transitions, 526 flow [2025-03-04 15:30:57,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=526, PETRI_PLACES=96, PETRI_TRANSITIONS=110} [2025-03-04 15:30:57,339 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 35 predicate places. [2025-03-04 15:30:57,339 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 110 transitions, 526 flow [2025-03-04 15:30:57,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.7) internal successors, (277), 10 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:57,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:57,340 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:57,345 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:30:57,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 15:30:57,540 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:30:57,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:57,541 INFO L85 PathProgramCache]: Analyzing trace with hash 345611389, now seen corresponding path program 2 times [2025-03-04 15:30:57,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:57,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927754900] [2025-03-04 15:30:57,541 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:30:57,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:57,547 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 15:30:57,555 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 30 statements. [2025-03-04 15:30:57,555 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:30:57,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:57,591 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 15:30:57,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:57,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927754900] [2025-03-04 15:30:57,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927754900] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:57,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629322477] [2025-03-04 15:30:57,592 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:30:57,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:57,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:57,594 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:30:57,596 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:30:57,650 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 15:30:57,663 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 30 statements. [2025-03-04 15:30:57,664 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:30:57,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:57,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:30:57,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:57,697 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 15:30:57,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:30:57,729 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 15:30:57,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629322477] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:30:57,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:30:57,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-03-04 15:30:57,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003518260] [2025-03-04 15:30:57,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:30:57,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:30:57,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:57,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:30:57,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:30:57,739 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 63 [2025-03-04 15:30:57,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 110 transitions, 526 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 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:30:57,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:57,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 63 [2025-03-04 15:30:57,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:59,502 INFO L124 PetriNetUnfolderBase]: 15709/25406 cut-off events. [2025-03-04 15:30:59,502 INFO L125 PetriNetUnfolderBase]: For 44251/44691 co-relation queries the response was YES. [2025-03-04 15:30:59,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74200 conditions, 25406 events. 15709/25406 cut-off events. For 44251/44691 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 183996 event pairs, 6264 based on Foata normal form. 564/24909 useless extension candidates. Maximal degree in co-relation 54868. Up to 12853 conditions per place. [2025-03-04 15:30:59,623 INFO L140 encePairwiseOnDemand]: 59/63 looper letters, 101 selfloop transitions, 11 changer transitions 0/131 dead transitions. [2025-03-04 15:30:59,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 131 transitions, 851 flow [2025-03-04 15:30:59,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:30:59,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:30:59,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 152 transitions. [2025-03-04 15:30:59,624 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2025-03-04 15:30:59,624 INFO L175 Difference]: Start difference. First operand has 96 places, 110 transitions, 526 flow. Second operand 4 states and 152 transitions. [2025-03-04 15:30:59,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 131 transitions, 851 flow [2025-03-04 15:30:59,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 131 transitions, 815 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-03-04 15:30:59,724 INFO L231 Difference]: Finished difference. Result has 92 places, 109 transitions, 513 flow [2025-03-04 15:30:59,725 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=513, PETRI_PLACES=92, PETRI_TRANSITIONS=109} [2025-03-04 15:30:59,725 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 31 predicate places. [2025-03-04 15:30:59,725 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 109 transitions, 513 flow [2025-03-04 15:30:59,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 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:30:59,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:59,725 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:59,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 15:30:59,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:59,926 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:30:59,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:59,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1150321937, now seen corresponding path program 1 times [2025-03-04 15:30:59,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:59,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993374280] [2025-03-04 15:30:59,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:59,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:59,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 15:30:59,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:30:59,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:59,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:59,970 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:30:59,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:59,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993374280] [2025-03-04 15:30:59,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993374280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:30:59,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:30:59,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:30:59,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198727366] [2025-03-04 15:30:59,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:30:59,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:30:59,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:59,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:30:59,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:30:59,977 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 63 [2025-03-04 15:30:59,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 109 transitions, 513 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 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:30:59,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:59,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 63 [2025-03-04 15:30:59,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:01,809 INFO L124 PetriNetUnfolderBase]: 19881/32754 cut-off events. [2025-03-04 15:31:01,809 INFO L125 PetriNetUnfolderBase]: For 46175/46525 co-relation queries the response was YES. [2025-03-04 15:31:01,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94328 conditions, 32754 events. 19881/32754 cut-off events. For 46175/46525 co-relation queries the response was YES. Maximal size of possible extension queue 718. Compared 243407 event pairs, 5742 based on Foata normal form. 678/32823 useless extension candidates. Maximal degree in co-relation 55055. Up to 12416 conditions per place. [2025-03-04 15:31:01,994 INFO L140 encePairwiseOnDemand]: 57/63 looper letters, 136 selfloop transitions, 10 changer transitions 0/161 dead transitions. [2025-03-04 15:31:01,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 161 transitions, 1039 flow [2025-03-04 15:31:01,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:31:01,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:31:01,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 162 transitions. [2025-03-04 15:31:01,996 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2025-03-04 15:31:01,996 INFO L175 Difference]: Start difference. First operand has 92 places, 109 transitions, 513 flow. Second operand 4 states and 162 transitions. [2025-03-04 15:31:01,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 161 transitions, 1039 flow [2025-03-04 15:31:02,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 161 transitions, 973 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 15:31:02,132 INFO L231 Difference]: Finished difference. Result has 90 places, 109 transitions, 514 flow [2025-03-04 15:31:02,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=514, PETRI_PLACES=90, PETRI_TRANSITIONS=109} [2025-03-04 15:31:02,133 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 29 predicate places. [2025-03-04 15:31:02,133 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 109 transitions, 514 flow [2025-03-04 15:31:02,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 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:31:02,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:02,133 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:02,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 15:31:02,133 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:31:02,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:02,133 INFO L85 PathProgramCache]: Analyzing trace with hash 865391408, now seen corresponding path program 1 times [2025-03-04 15:31:02,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:02,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392010260] [2025-03-04 15:31:02,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:02,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:02,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 15:31:02,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 15:31:02,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:02,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:02,201 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:31:02,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:02,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392010260] [2025-03-04 15:31:02,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392010260] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:02,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285674498] [2025-03-04 15:31:02,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:02,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:02,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:02,204 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:31:02,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 15:31:02,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 15:31:02,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 15:31:02,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:02,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:02,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:31:02,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:31:02,377 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:31:02,378 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:31:02,487 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:31:02,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285674498] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:31:02,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:31:02,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 19 [2025-03-04 15:31:02,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999759421] [2025-03-04 15:31:02,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:31:02,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 15:31:02,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:02,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 15:31:02,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-03-04 15:31:02,629 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 63 [2025-03-04 15:31:02,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 109 transitions, 514 flow. Second operand has 19 states, 19 states have (on average 21.31578947368421) internal successors, (405), 19 states have internal predecessors, (405), 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:31:02,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:02,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 63 [2025-03-04 15:31:02,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:04,863 INFO L124 PetriNetUnfolderBase]: 19691/29195 cut-off events. [2025-03-04 15:31:04,863 INFO L125 PetriNetUnfolderBase]: For 60105/60105 co-relation queries the response was YES. [2025-03-04 15:31:04,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90654 conditions, 29195 events. 19691/29195 cut-off events. For 60105/60105 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 186946 event pairs, 1894 based on Foata normal form. 251/25060 useless extension candidates. Maximal degree in co-relation 54698. Up to 4359 conditions per place. [2025-03-04 15:31:05,090 INFO L140 encePairwiseOnDemand]: 47/63 looper letters, 342 selfloop transitions, 54 changer transitions 26/435 dead transitions. [2025-03-04 15:31:05,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 435 transitions, 3110 flow [2025-03-04 15:31:05,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 15:31:05,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 15:31:05,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 539 transitions. [2025-03-04 15:31:05,092 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4502923976608187 [2025-03-04 15:31:05,092 INFO L175 Difference]: Start difference. First operand has 90 places, 109 transitions, 514 flow. Second operand 19 states and 539 transitions. [2025-03-04 15:31:05,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 435 transitions, 3110 flow [2025-03-04 15:31:05,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 435 transitions, 3005 flow, removed 11 selfloop flow, removed 2 redundant places. [2025-03-04 15:31:05,186 INFO L231 Difference]: Finished difference. Result has 106 places, 114 transitions, 628 flow [2025-03-04 15:31:05,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=628, PETRI_PLACES=106, PETRI_TRANSITIONS=114} [2025-03-04 15:31:05,186 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 45 predicate places. [2025-03-04 15:31:05,186 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 114 transitions, 628 flow [2025-03-04 15:31:05,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 21.31578947368421) internal successors, (405), 19 states have internal predecessors, (405), 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:31:05,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:05,187 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:05,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 15:31:05,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 15:31:05,387 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:31:05,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:05,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1652768461, now seen corresponding path program 2 times [2025-03-04 15:31:05,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:05,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134166090] [2025-03-04 15:31:05,388 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:31:05,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:05,397 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-04 15:31:05,399 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 34 statements. [2025-03-04 15:31:05,399 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:31:05,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:05,423 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 15:31:05,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:05,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134166090] [2025-03-04 15:31:05,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134166090] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:05,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996374772] [2025-03-04 15:31:05,424 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:31:05,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:05,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:05,426 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:31:05,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 15:31:05,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-04 15:31:05,497 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 34 statements. [2025-03-04 15:31:05,497 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:31:05,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:05,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 15:31:05,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:31:05,530 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 15:31:05,530 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:31:05,563 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 15:31:05,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996374772] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:31:05,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:31:05,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-03-04 15:31:05,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867975510] [2025-03-04 15:31:05,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:31:05,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:31:05,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:05,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:31:05,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:31:05,569 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 63 [2025-03-04 15:31:05,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 114 transitions, 628 flow. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 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:31:05,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:05,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 63 [2025-03-04 15:31:05,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:06,996 INFO L124 PetriNetUnfolderBase]: 17587/28822 cut-off events. [2025-03-04 15:31:06,996 INFO L125 PetriNetUnfolderBase]: For 38223/38223 co-relation queries the response was YES. [2025-03-04 15:31:07,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83373 conditions, 28822 events. 17587/28822 cut-off events. For 38223/38223 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 206025 event pairs, 4819 based on Foata normal form. 448/26197 useless extension candidates. Maximal degree in co-relation 51724. Up to 13688 conditions per place. [2025-03-04 15:31:07,131 INFO L140 encePairwiseOnDemand]: 57/63 looper letters, 100 selfloop transitions, 7 changer transitions 22/145 dead transitions. [2025-03-04 15:31:07,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 145 transitions, 1009 flow [2025-03-04 15:31:07,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:31:07,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:31:07,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2025-03-04 15:31:07,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2025-03-04 15:31:07,132 INFO L175 Difference]: Start difference. First operand has 106 places, 114 transitions, 628 flow. Second operand 4 states and 156 transitions. [2025-03-04 15:31:07,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 145 transitions, 1009 flow [2025-03-04 15:31:07,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 145 transitions, 896 flow, removed 2 selfloop flow, removed 13 redundant places. [2025-03-04 15:31:07,245 INFO L231 Difference]: Finished difference. Result has 96 places, 98 transitions, 465 flow [2025-03-04 15:31:07,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=465, PETRI_PLACES=96, PETRI_TRANSITIONS=98} [2025-03-04 15:31:07,245 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 35 predicate places. [2025-03-04 15:31:07,246 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 98 transitions, 465 flow [2025-03-04 15:31:07,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 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:31:07,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:07,246 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:07,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 15:31:07,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 15:31:07,446 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:31:07,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:07,447 INFO L85 PathProgramCache]: Analyzing trace with hash -600824119, now seen corresponding path program 1 times [2025-03-04 15:31:07,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:07,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746701166] [2025-03-04 15:31:07,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:07,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:07,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 15:31:07,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 15:31:07,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:07,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:07,518 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 15:31:07,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:07,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746701166] [2025-03-04 15:31:07,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746701166] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:07,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391408768] [2025-03-04 15:31:07,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:07,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:07,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:07,520 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:31:07,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 15:31:07,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 15:31:07,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 15:31:07,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:07,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:07,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:31:07,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:31:07,624 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 15:31:07,625 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:31:07,656 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 15:31:07,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391408768] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:31:07,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:31:07,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 15:31:07,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450919668] [2025-03-04 15:31:07,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:31:07,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:31:07,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:07,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:31:07,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:31:07,674 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 63 [2025-03-04 15:31:07,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 98 transitions, 465 flow. Second operand has 12 states, 12 states have (on average 28.166666666666668) internal successors, (338), 12 states have internal predecessors, (338), 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:31:07,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:07,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 63 [2025-03-04 15:31:07,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:09,745 INFO L124 PetriNetUnfolderBase]: 17180/27015 cut-off events. [2025-03-04 15:31:09,745 INFO L125 PetriNetUnfolderBase]: For 64444/65008 co-relation queries the response was YES. [2025-03-04 15:31:09,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78776 conditions, 27015 events. 17180/27015 cut-off events. For 64444/65008 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 178353 event pairs, 3283 based on Foata normal form. 678/24463 useless extension candidates. Maximal degree in co-relation 78603. Up to 6482 conditions per place. [2025-03-04 15:31:09,939 INFO L140 encePairwiseOnDemand]: 59/63 looper letters, 328 selfloop transitions, 9 changer transitions 0/352 dead transitions. [2025-03-04 15:31:09,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 352 transitions, 2465 flow [2025-03-04 15:31:09,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:31:09,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:31:09,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 389 transitions. [2025-03-04 15:31:09,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6174603174603175 [2025-03-04 15:31:09,940 INFO L175 Difference]: Start difference. First operand has 96 places, 98 transitions, 465 flow. Second operand 10 states and 389 transitions. [2025-03-04 15:31:09,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 352 transitions, 2465 flow [2025-03-04 15:31:09,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 352 transitions, 2416 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-04 15:31:09,991 INFO L231 Difference]: Finished difference. Result has 94 places, 104 transitions, 520 flow [2025-03-04 15:31:09,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=520, PETRI_PLACES=94, PETRI_TRANSITIONS=104} [2025-03-04 15:31:09,992 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 33 predicate places. [2025-03-04 15:31:09,992 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 104 transitions, 520 flow [2025-03-04 15:31:09,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 28.166666666666668) internal successors, (338), 12 states have internal predecessors, (338), 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:31:09,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:09,992 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:09,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 15:31:10,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 15:31:10,192 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:31:10,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:10,193 INFO L85 PathProgramCache]: Analyzing trace with hash -427354455, now seen corresponding path program 2 times [2025-03-04 15:31:10,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:10,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102819517] [2025-03-04 15:31:10,193 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:31:10,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:10,201 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-03-04 15:31:10,205 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 67 statements. [2025-03-04 15:31:10,206 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:31:10,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:10,235 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-04 15:31:10,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:10,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102819517] [2025-03-04 15:31:10,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102819517] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:10,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90136352] [2025-03-04 15:31:10,235 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:31:10,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:10,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:10,237 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:31:10,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 15:31:10,302 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-03-04 15:31:10,318 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 67 statements. [2025-03-04 15:31:10,318 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:31:10,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:10,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:31:10,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:31:10,377 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-04 15:31:10,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:31:10,440 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-04 15:31:10,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90136352] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:31:10,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:31:10,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-04 15:31:10,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611155940] [2025-03-04 15:31:10,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:31:10,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:31:10,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:10,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:31:10,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:31:10,451 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 63 [2025-03-04 15:31:10,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 104 transitions, 520 flow. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:31:10,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:10,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 63 [2025-03-04 15:31:10,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:12,432 INFO L124 PetriNetUnfolderBase]: 20104/31223 cut-off events. [2025-03-04 15:31:12,432 INFO L125 PetriNetUnfolderBase]: For 67009/67673 co-relation queries the response was YES. [2025-03-04 15:31:12,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93205 conditions, 31223 events. 20104/31223 cut-off events. For 67009/67673 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 208828 event pairs, 2767 based on Foata normal form. 226/27525 useless extension candidates. Maximal degree in co-relation 93030. Up to 15816 conditions per place. [2025-03-04 15:31:12,500 INFO L140 encePairwiseOnDemand]: 57/63 looper letters, 0 selfloop transitions, 0 changer transitions 164/164 dead transitions. [2025-03-04 15:31:12,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 164 transitions, 1122 flow [2025-03-04 15:31:12,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:31:12,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:31:12,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2025-03-04 15:31:12,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5587301587301587 [2025-03-04 15:31:12,501 INFO L175 Difference]: Start difference. First operand has 94 places, 104 transitions, 520 flow. Second operand 5 states and 176 transitions. [2025-03-04 15:31:12,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 164 transitions, 1122 flow [2025-03-04 15:31:12,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 164 transitions, 1102 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-03-04 15:31:12,569 INFO L231 Difference]: Finished difference. Result has 91 places, 0 transitions, 0 flow [2025-03-04 15:31:12,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=91, PETRI_TRANSITIONS=0} [2025-03-04 15:31:12,570 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 30 predicate places. [2025-03-04 15:31:12,570 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 0 transitions, 0 flow [2025-03-04 15:31:12,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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:31:12,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 25 remaining) [2025-03-04 15:31:12,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 25 remaining) [2025-03-04 15:31:12,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 25 remaining) [2025-03-04 15:31:12,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 25 remaining) [2025-03-04 15:31:12,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 25 remaining) [2025-03-04 15:31:12,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 25 remaining) [2025-03-04 15:31:12,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 25 remaining) [2025-03-04 15:31:12,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 25 remaining) [2025-03-04 15:31:12,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 25 remaining) [2025-03-04 15:31:12,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 25 remaining) [2025-03-04 15:31:12,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 25 remaining) [2025-03-04 15:31:12,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 25 remaining) [2025-03-04 15:31:12,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 25 remaining) [2025-03-04 15:31:12,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 25 remaining) [2025-03-04 15:31:12,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 25 remaining) [2025-03-04 15:31:12,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 25 remaining) [2025-03-04 15:31:12,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 25 remaining) [2025-03-04 15:31:12,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 25 remaining) [2025-03-04 15:31:12,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 25 remaining) [2025-03-04 15:31:12,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 25 remaining) [2025-03-04 15:31:12,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 25 remaining) [2025-03-04 15:31:12,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 25 remaining) [2025-03-04 15:31:12,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 25 remaining) [2025-03-04 15:31:12,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 25 remaining) [2025-03-04 15:31:12,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 25 remaining) [2025-03-04 15:31:12,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 15:31:12,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:12,777 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:12,780 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 15:31:12,780 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 15:31:12,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 03:31:12 BasicIcfg [2025-03-04 15:31:12,785 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 15:31:12,785 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:31:12,785 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:31:12,786 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:31:12,786 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:30:38" (3/4) ... [2025-03-04 15:31:12,787 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 15:31:12,789 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 15:31:12,789 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 15:31:12,789 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-04 15:31:12,792 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 108 nodes and edges [2025-03-04 15:31:12,792 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 50 nodes and edges [2025-03-04 15:31:12,792 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2025-03-04 15:31:12,793 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 15:31:12,855 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 15:31:12,855 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 15:31:12,855 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:31:12,855 INFO L158 Benchmark]: Toolchain (without parser) took 35636.64ms. Allocated memory was 167.8MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 122.1MB in the beginning and 4.1GB in the end (delta: -4.0GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2025-03-04 15:31:12,856 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:31:12,856 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.12ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 110.1MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:31:12,856 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.37ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 108.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:31:12,856 INFO L158 Benchmark]: Boogie Preprocessor took 35.67ms. Allocated memory is still 167.8MB. Free memory was 108.5MB in the beginning and 106.7MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:31:12,856 INFO L158 Benchmark]: IcfgBuilder took 522.80ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 57.3MB in the end (delta: 49.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-04 15:31:12,856 INFO L158 Benchmark]: TraceAbstraction took 34776.53ms. Allocated memory was 167.8MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 56.8MB in the beginning and 4.1GB in the end (delta: -4.1GB). Peak memory consumption was 4.5GB. Max. memory is 16.1GB. [2025-03-04 15:31:12,856 INFO L158 Benchmark]: Witness Printer took 69.59ms. Allocated memory is still 5.6GB. Free memory was 4.1GB in the beginning and 4.1GB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:31:12,857 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 193.12ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 110.1MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.37ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 108.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.67ms. Allocated memory is still 167.8MB. Free memory was 108.5MB in the beginning and 106.7MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 522.80ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 57.3MB in the end (delta: 49.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 34776.53ms. Allocated memory was 167.8MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 56.8MB in the beginning and 4.1GB in the end (delta: -4.1GB). Peak memory consumption was 4.5GB. Max. memory is 16.1GB. * Witness Printer took 69.59ms. Allocated memory is still 5.6GB. Free memory was 4.1GB in the beginning and 4.1GB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 112]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 112]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 112]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 112]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 112]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 112]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 90 locations, 25 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 34.7s, OverallIterations: 24, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 27.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1896 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1721 mSDsluCounter, 1023 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 957 mSDsCounter, 279 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6135 IncrementalHoareTripleChecker+Invalid, 6414 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 279 mSolverCounterUnsat, 66 mSDtfsCounter, 6135 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 808 GetRequests, 627 SyntacticMatches, 8 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=810occurred in iteration=10, InterpolantAutomatonStates: 149, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 891 NumberOfCodeBlocks, 641 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1160 ConstructedInterpolants, 0 QuantifiedInterpolants, 2902 SizeOfPredicates, 42 NumberOfNonLiveVariables, 2340 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 49 InterpolantComputations, 13 PerfectInterpolantSequences, 714/947 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 15:31:12,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE