./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-more-sorted.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-more-sorted.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 39e987e3198040ef6af9e29359b0ab7bee89306d1945f6e4e7a9286ebbe2a705 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:29:40,514 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:29:40,566 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:29:40,570 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:29:40,570 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:29:40,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:29:40,591 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:29:40,591 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:29:40,591 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:29:40,591 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:29:40,591 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:29:40,591 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:29:40,591 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:29:40,591 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:29:40,592 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:29:40,592 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:29:40,592 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:29:40,592 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:29:40,593 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:29:40,593 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:29:40,593 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:29:40,593 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:29:40,594 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:29:40,594 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:29:40,594 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:29:40,594 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:29:40,594 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:29:40,594 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:29:40,594 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:29:40,594 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:29:40,594 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:29:40,594 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:29:40,595 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:29:40,595 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:29:40,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:29:40,595 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:29:40,595 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:29:40,595 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:29:40,595 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:29:40,595 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:29:40,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:29:40,595 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:29:40,595 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:29:40,595 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:29:40,595 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:29:40,596 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 -> 39e987e3198040ef6af9e29359b0ab7bee89306d1945f6e4e7a9286ebbe2a705 [2025-03-04 15:29:40,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:29:40,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:29:40,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:29:40,827 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:29:40,827 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:29:40,828 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c [2025-03-04 15:29:41,928 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/740e536dc/8b7d1397ce5a4a039d46a425a89b03df/FLAGa256d92fc [2025-03-04 15:29:42,159 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:29:42,159 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c [2025-03-04 15:29:42,166 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/740e536dc/8b7d1397ce5a4a039d46a425a89b03df/FLAGa256d92fc [2025-03-04 15:29:42,200 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/740e536dc/8b7d1397ce5a4a039d46a425a89b03df [2025-03-04 15:29:42,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:29:42,204 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:29:42,204 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:29:42,205 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:29:42,209 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:29:42,210 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:29:42" (1/1) ... [2025-03-04 15:29:42,211 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@129497ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:42, skipping insertion in model container [2025-03-04 15:29:42,211 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:29:42" (1/1) ... [2025-03-04 15:29:42,228 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:29:42,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:29:42,371 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:29:42,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:29:42,408 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:29:42,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:42 WrapperNode [2025-03-04 15:29:42,409 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:29:42,410 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:29:42,410 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:29:42,410 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:29:42,414 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:29:42" (1/1) ... [2025-03-04 15:29:42,423 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:29:42" (1/1) ... [2025-03-04 15:29:42,438 INFO L138 Inliner]: procedures = 23, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2025-03-04 15:29:42,440 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:29:42,440 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:29:42,441 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:29:42,441 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:29:42,446 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:42" (1/1) ... [2025-03-04 15:29:42,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:42" (1/1) ... [2025-03-04 15:29:42,450 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:42" (1/1) ... [2025-03-04 15:29:42,463 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-04 15:29:42,466 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:42" (1/1) ... [2025-03-04 15:29:42,466 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:42" (1/1) ... [2025-03-04 15:29:42,474 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:42" (1/1) ... [2025-03-04 15:29:42,474 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:42" (1/1) ... [2025-03-04 15:29:42,475 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:42" (1/1) ... [2025-03-04 15:29:42,476 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:42" (1/1) ... [2025-03-04 15:29:42,477 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:29:42,481 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:29:42,481 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:29:42,481 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:29:42,482 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:42" (1/1) ... [2025-03-04 15:29:42,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:29:42,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:42,511 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:29:42,513 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:29:42,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:29:42,531 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:29:42,531 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:29:42,531 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:29:42,531 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:29:42,531 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 15:29:42,531 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 15:29:42,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:29:42,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:29:42,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:29:42,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:29:42,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:29:42,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:29:42,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:29:42,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:29:42,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:29:42,533 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:29:42,622 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:29:42,624 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:29:42,887 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:29:42,887 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:29:43,027 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:29:43,027 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:29:43,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:29:43 BoogieIcfgContainer [2025-03-04 15:29:43,028 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:29:43,030 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:29:43,030 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:29:43,033 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:29:43,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:29:42" (1/3) ... [2025-03-04 15:29:43,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51206727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:29:43, skipping insertion in model container [2025-03-04 15:29:43,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:42" (2/3) ... [2025-03-04 15:29:43,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51206727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:29:43, skipping insertion in model container [2025-03-04 15:29:43,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:29:43" (3/3) ... [2025-03-04 15:29:43,036 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-sorted.wvr.c [2025-03-04 15:29:43,049 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:29:43,050 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-sorted.wvr.c that has 4 procedures, 66 locations, 1 initial locations, 4 loop locations, and 18 error locations. [2025-03-04 15:29:43,050 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:29:43,120 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:29:43,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 74 transitions, 169 flow [2025-03-04 15:29:43,180 INFO L124 PetriNetUnfolderBase]: 9/71 cut-off events. [2025-03-04 15:29:43,183 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 15:29:43,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 71 events. 9/71 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 242 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2025-03-04 15:29:43,186 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 74 transitions, 169 flow [2025-03-04 15:29:43,189 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 69 transitions, 153 flow [2025-03-04 15:29:43,197 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:29:43,204 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;@6189112c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:29:43,204 INFO L334 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2025-03-04 15:29:43,208 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:29:43,209 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:29:43,209 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:29:43,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:43,210 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:29:43,210 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-03-04 15:29:43,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:43,213 INFO L85 PathProgramCache]: Analyzing trace with hash 431793, now seen corresponding path program 1 times [2025-03-04 15:29:43,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:43,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065978526] [2025-03-04 15:29:43,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:43,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:43,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:29:43,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:29:43,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:43,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:43,412 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:29:43,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:43,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065978526] [2025-03-04 15:29:43,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065978526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:43,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:43,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:29:43,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070956013] [2025-03-04 15:29:43,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:43,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:43,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:43,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:43,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:43,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-04 15:29:43,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 69 transitions, 153 flow. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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:29:43,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:43,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-04 15:29:43,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:43,944 INFO L124 PetriNetUnfolderBase]: 2188/3889 cut-off events. [2025-03-04 15:29:43,945 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2025-03-04 15:29:43,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7043 conditions, 3889 events. 2188/3889 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 26915 event pairs, 1538 based on Foata normal form. 212/3430 useless extension candidates. Maximal degree in co-relation 6606. Up to 2988 conditions per place. [2025-03-04 15:29:43,971 INFO L140 encePairwiseOnDemand]: 66/74 looper letters, 34 selfloop transitions, 4 changer transitions 0/70 dead transitions. [2025-03-04 15:29:43,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 70 transitions, 231 flow [2025-03-04 15:29:43,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:43,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:43,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 182 transitions. [2025-03-04 15:29:43,981 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6148648648648649 [2025-03-04 15:29:43,982 INFO L175 Difference]: Start difference. First operand has 70 places, 69 transitions, 153 flow. Second operand 4 states and 182 transitions. [2025-03-04 15:29:43,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 70 transitions, 231 flow [2025-03-04 15:29:43,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 70 transitions, 222 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 15:29:43,988 INFO L231 Difference]: Finished difference. Result has 70 places, 70 transitions, 169 flow [2025-03-04 15:29:43,990 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=70, PETRI_TRANSITIONS=70} [2025-03-04 15:29:43,992 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 0 predicate places. [2025-03-04 15:29:43,993 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 70 transitions, 169 flow [2025-03-04 15:29:43,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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:29:43,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:43,993 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:29:43,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:29:43,994 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-03-04 15:29:43,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:43,994 INFO L85 PathProgramCache]: Analyzing trace with hash 415079080, now seen corresponding path program 1 times [2025-03-04 15:29:43,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:43,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925975651] [2025-03-04 15:29:43,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:43,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:44,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:29:44,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:29:44,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:44,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:44,075 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:29:44,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:44,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925975651] [2025-03-04 15:29:44,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925975651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:44,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:44,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:29:44,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586155811] [2025-03-04 15:29:44,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:44,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:29:44,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:44,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:29:44,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:29:44,094 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 74 [2025-03-04 15:29:44,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 70 transitions, 169 flow. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:44,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:44,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 74 [2025-03-04 15:29:44,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:44,440 INFO L124 PetriNetUnfolderBase]: 2793/4727 cut-off events. [2025-03-04 15:29:44,440 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 15:29:44,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8670 conditions, 4727 events. 2793/4727 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 32276 event pairs, 2023 based on Foata normal form. 239/4250 useless extension candidates. Maximal degree in co-relation 8642. Up to 3812 conditions per place. [2025-03-04 15:29:44,463 INFO L140 encePairwiseOnDemand]: 71/74 looper letters, 36 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2025-03-04 15:29:44,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 68 transitions, 241 flow [2025-03-04 15:29:44,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:29:44,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:29:44,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2025-03-04 15:29:44,464 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6126126126126126 [2025-03-04 15:29:44,465 INFO L175 Difference]: Start difference. First operand has 70 places, 70 transitions, 169 flow. Second operand 3 states and 136 transitions. [2025-03-04 15:29:44,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 68 transitions, 241 flow [2025-03-04 15:29:44,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 68 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:29:44,466 INFO L231 Difference]: Finished difference. Result has 69 places, 68 transitions, 166 flow [2025-03-04 15:29:44,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=69, PETRI_TRANSITIONS=68} [2025-03-04 15:29:44,467 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, -1 predicate places. [2025-03-04 15:29:44,467 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 68 transitions, 166 flow [2025-03-04 15:29:44,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:44,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:44,467 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:29:44,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:29:44,467 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-03-04 15:29:44,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:44,468 INFO L85 PathProgramCache]: Analyzing trace with hash -20990180, now seen corresponding path program 1 times [2025-03-04 15:29:44,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:44,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708705540] [2025-03-04 15:29:44,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:44,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:44,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:29:44,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:29:44,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:44,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:44,577 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:29:44,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:44,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708705540] [2025-03-04 15:29:44,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708705540] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:44,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273382799] [2025-03-04 15:29:44,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:44,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:44,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:44,581 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:29:44,583 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:29:44,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:29:44,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:29:44,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:44,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:44,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:29:44,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:44,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:44,694 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:29:44,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273382799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:44,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:29:44,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:29:44,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421414538] [2025-03-04 15:29:44,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:44,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:29:44,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:44,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:29:44,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:29:44,704 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-04 15:29:44,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 68 transitions, 166 flow. Second operand has 6 states, 6 states have (on average 35.833333333333336) internal successors, (215), 6 states have internal predecessors, (215), 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:29:44,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:44,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-04 15:29:44,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:45,020 INFO L124 PetriNetUnfolderBase]: 2188/3838 cut-off events. [2025-03-04 15:29:45,022 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-04 15:29:45,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6938 conditions, 3838 events. 2188/3838 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 26154 event pairs, 1538 based on Foata normal form. 1/3220 useless extension candidates. Maximal degree in co-relation 6911. Up to 2983 conditions per place. [2025-03-04 15:29:45,048 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 30 selfloop transitions, 7 changer transitions 0/67 dead transitions. [2025-03-04 15:29:45,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 67 transitions, 236 flow [2025-03-04 15:29:45,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:29:45,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:29:45,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 248 transitions. [2025-03-04 15:29:45,050 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5585585585585585 [2025-03-04 15:29:45,050 INFO L175 Difference]: Start difference. First operand has 69 places, 68 transitions, 166 flow. Second operand 6 states and 248 transitions. [2025-03-04 15:29:45,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 67 transitions, 236 flow [2025-03-04 15:29:45,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 67 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:29:45,052 INFO L231 Difference]: Finished difference. Result has 72 places, 67 transitions, 174 flow [2025-03-04 15:29:45,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=72, PETRI_TRANSITIONS=67} [2025-03-04 15:29:45,053 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 2 predicate places. [2025-03-04 15:29:45,053 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 67 transitions, 174 flow [2025-03-04 15:29:45,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.833333333333336) internal successors, (215), 6 states have internal predecessors, (215), 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:29:45,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:45,053 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:29:45,060 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:29:45,257 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:29:45,257 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-03-04 15:29:45,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:45,258 INFO L85 PathProgramCache]: Analyzing trace with hash -17450010, now seen corresponding path program 1 times [2025-03-04 15:29:45,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:45,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942098091] [2025-03-04 15:29:45,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:45,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:45,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:29:45,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:29:45,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:45,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:45,307 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:29:45,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:45,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942098091] [2025-03-04 15:29:45,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942098091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:45,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:45,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:29:45,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435625813] [2025-03-04 15:29:45,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:45,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:29:45,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:45,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:29:45,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:29:45,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 74 [2025-03-04 15:29:45,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 67 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:45,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:45,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 74 [2025-03-04 15:29:45,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:45,613 INFO L124 PetriNetUnfolderBase]: 2188/3788 cut-off events. [2025-03-04 15:29:45,613 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-04 15:29:45,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6894 conditions, 3788 events. 2188/3788 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 25350 event pairs, 1538 based on Foata normal form. 161/3380 useless extension candidates. Maximal degree in co-relation 6863. Up to 2987 conditions per place. [2025-03-04 15:29:45,625 INFO L140 encePairwiseOnDemand]: 71/74 looper letters, 35 selfloop transitions, 1 changer transitions 0/65 dead transitions. [2025-03-04 15:29:45,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 65 transitions, 242 flow [2025-03-04 15:29:45,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:29:45,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:29:45,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2025-03-04 15:29:45,626 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6036036036036037 [2025-03-04 15:29:45,626 INFO L175 Difference]: Start difference. First operand has 72 places, 67 transitions, 174 flow. Second operand 3 states and 134 transitions. [2025-03-04 15:29:45,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 65 transitions, 242 flow [2025-03-04 15:29:45,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 65 transitions, 220 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-03-04 15:29:45,627 INFO L231 Difference]: Finished difference. Result has 67 places, 65 transitions, 150 flow [2025-03-04 15:29:45,627 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=67, PETRI_TRANSITIONS=65} [2025-03-04 15:29:45,628 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, -3 predicate places. [2025-03-04 15:29:45,628 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 65 transitions, 150 flow [2025-03-04 15:29:45,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:45,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:45,628 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:29:45,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:29:45,628 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-03-04 15:29:45,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:45,629 INFO L85 PathProgramCache]: Analyzing trace with hash -650695213, now seen corresponding path program 1 times [2025-03-04 15:29:45,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:45,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302908333] [2025-03-04 15:29:45,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:45,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:45,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:29:45,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:29:45,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:45,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:45,690 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:29:45,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:45,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302908333] [2025-03-04 15:29:45,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302908333] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:45,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643736829] [2025-03-04 15:29:45,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:45,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:45,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:45,693 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:29:45,695 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:29:45,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:29:45,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:29:45,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:45,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:45,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:29:45,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:45,759 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:29:45,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:45,790 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:29:45,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643736829] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:45,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:45,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 15:29:45,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714257265] [2025-03-04 15:29:45,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:45,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:29:45,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:45,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:29:45,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:29:45,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-04 15:29:45,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 65 transitions, 150 flow. Second operand has 12 states, 12 states have (on average 36.083333333333336) internal successors, (433), 12 states have internal predecessors, (433), 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:29:45,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:45,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-04 15:29:45,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:46,059 INFO L124 PetriNetUnfolderBase]: 2191/3800 cut-off events. [2025-03-04 15:29:46,060 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-04 15:29:46,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6914 conditions, 3800 events. 2191/3800 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 25549 event pairs, 1538 based on Foata normal form. 3/3231 useless extension candidates. Maximal degree in co-relation 6907. Up to 2990 conditions per place. [2025-03-04 15:29:46,078 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 33 selfloop transitions, 13 changer transitions 0/74 dead transitions. [2025-03-04 15:29:46,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 74 transitions, 275 flow [2025-03-04 15:29:46,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:29:46,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:29:46,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 399 transitions. [2025-03-04 15:29:46,084 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5391891891891892 [2025-03-04 15:29:46,085 INFO L175 Difference]: Start difference. First operand has 67 places, 65 transitions, 150 flow. Second operand 10 states and 399 transitions. [2025-03-04 15:29:46,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 74 transitions, 275 flow [2025-03-04 15:29:46,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 74 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:29:46,087 INFO L231 Difference]: Finished difference. Result has 78 places, 74 transitions, 226 flow [2025-03-04 15:29:46,087 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=226, PETRI_PLACES=78, PETRI_TRANSITIONS=74} [2025-03-04 15:29:46,089 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 8 predicate places. [2025-03-04 15:29:46,089 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 74 transitions, 226 flow [2025-03-04 15:29:46,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 36.083333333333336) internal successors, (433), 12 states have internal predecessors, (433), 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:29:46,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:46,090 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:46,096 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:29:46,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:46,294 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-03-04 15:29:46,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:46,294 INFO L85 PathProgramCache]: Analyzing trace with hash -161805842, now seen corresponding path program 1 times [2025-03-04 15:29:46,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:46,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265627924] [2025-03-04 15:29:46,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:46,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:46,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:29:46,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:29:46,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:46,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:46,328 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:29:46,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:46,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265627924] [2025-03-04 15:29:46,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265627924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:46,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:46,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:29:46,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764689169] [2025-03-04 15:29:46,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:46,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:29:46,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:46,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:29:46,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:29:46,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-04 15:29:46,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 74 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 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:29:46,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:46,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-04 15:29:46,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:46,719 INFO L124 PetriNetUnfolderBase]: 4376/7512 cut-off events. [2025-03-04 15:29:46,719 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-03-04 15:29:46,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13660 conditions, 7512 events. 4376/7512 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 51887 event pairs, 1846 based on Foata normal form. 100/6634 useless extension candidates. Maximal degree in co-relation 13649. Up to 4045 conditions per place. [2025-03-04 15:29:46,791 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 69 selfloop transitions, 3 changer transitions 0/99 dead transitions. [2025-03-04 15:29:46,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 99 transitions, 423 flow [2025-03-04 15:29:46,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:29:46,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:29:46,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2025-03-04 15:29:46,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7522522522522522 [2025-03-04 15:29:46,793 INFO L175 Difference]: Start difference. First operand has 78 places, 74 transitions, 226 flow. Second operand 3 states and 167 transitions. [2025-03-04 15:29:46,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 99 transitions, 423 flow [2025-03-04 15:29:46,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 99 transitions, 412 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 15:29:46,794 INFO L231 Difference]: Finished difference. Result has 79 places, 76 transitions, 236 flow [2025-03-04 15:29:46,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=79, PETRI_TRANSITIONS=76} [2025-03-04 15:29:46,795 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 9 predicate places. [2025-03-04 15:29:46,795 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 76 transitions, 236 flow [2025-03-04 15:29:46,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 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:29:46,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:46,795 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:46,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:29:46,795 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-03-04 15:29:46,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:46,796 INFO L85 PathProgramCache]: Analyzing trace with hash -367261428, now seen corresponding path program 1 times [2025-03-04 15:29:46,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:46,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495652239] [2025-03-04 15:29:46,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:46,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:46,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:29:46,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:29:46,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:46,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:46,832 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:29:46,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:46,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495652239] [2025-03-04 15:29:46,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495652239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:46,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:46,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:29:46,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380955738] [2025-03-04 15:29:46,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:46,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:29:46,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:46,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:29:46,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:29:46,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-04 15:29:46,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 76 transitions, 236 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 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:29:46,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:46,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-04 15:29:46,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:47,483 INFO L124 PetriNetUnfolderBase]: 7385/12287 cut-off events. [2025-03-04 15:29:47,483 INFO L125 PetriNetUnfolderBase]: For 1463/1463 co-relation queries the response was YES. [2025-03-04 15:29:47,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23927 conditions, 12287 events. 7385/12287 cut-off events. For 1463/1463 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 91186 event pairs, 3403 based on Foata normal form. 199/11086 useless extension candidates. Maximal degree in co-relation 23915. Up to 6609 conditions per place. [2025-03-04 15:29:47,544 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 72 selfloop transitions, 3 changer transitions 0/102 dead transitions. [2025-03-04 15:29:47,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 102 transitions, 454 flow [2025-03-04 15:29:47,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:29:47,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:29:47,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2025-03-04 15:29:47,546 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7477477477477478 [2025-03-04 15:29:47,546 INFO L175 Difference]: Start difference. First operand has 79 places, 76 transitions, 236 flow. Second operand 3 states and 166 transitions. [2025-03-04 15:29:47,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 102 transitions, 454 flow [2025-03-04 15:29:47,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 102 transitions, 448 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:29:47,548 INFO L231 Difference]: Finished difference. Result has 81 places, 78 transitions, 254 flow [2025-03-04 15:29:47,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=254, PETRI_PLACES=81, PETRI_TRANSITIONS=78} [2025-03-04 15:29:47,552 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 11 predicate places. [2025-03-04 15:29:47,553 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 78 transitions, 254 flow [2025-03-04 15:29:47,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 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:29:47,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:47,554 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:47,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:29:47,554 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-03-04 15:29:47,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:47,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1499797050, now seen corresponding path program 1 times [2025-03-04 15:29:47,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:47,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48666906] [2025-03-04 15:29:47,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:47,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:47,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:29:47,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:29:47,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:47,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:47,614 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:29:47,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:47,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48666906] [2025-03-04 15:29:47,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48666906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:47,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:47,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:29:47,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766607344] [2025-03-04 15:29:47,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:47,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:47,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:47,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:47,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:47,627 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 74 [2025-03-04 15:29:47,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 78 transitions, 254 flow. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 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:29:47,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:47,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 74 [2025-03-04 15:29:47,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:48,498 INFO L124 PetriNetUnfolderBase]: 8495/13205 cut-off events. [2025-03-04 15:29:48,499 INFO L125 PetriNetUnfolderBase]: For 2598/2598 co-relation queries the response was YES. [2025-03-04 15:29:48,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27945 conditions, 13205 events. 8495/13205 cut-off events. For 2598/2598 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 90881 event pairs, 4277 based on Foata normal form. 398/13103 useless extension candidates. Maximal degree in co-relation 27932. Up to 8117 conditions per place. [2025-03-04 15:29:48,555 INFO L140 encePairwiseOnDemand]: 68/74 looper letters, 93 selfloop transitions, 4 changer transitions 0/122 dead transitions. [2025-03-04 15:29:48,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 122 transitions, 562 flow [2025-03-04 15:29:48,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:48,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:48,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 213 transitions. [2025-03-04 15:29:48,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7195945945945946 [2025-03-04 15:29:48,560 INFO L175 Difference]: Start difference. First operand has 81 places, 78 transitions, 254 flow. Second operand 4 states and 213 transitions. [2025-03-04 15:29:48,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 122 transitions, 562 flow [2025-03-04 15:29:48,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 122 transitions, 559 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:29:48,563 INFO L231 Difference]: Finished difference. Result has 85 places, 79 transitions, 272 flow [2025-03-04 15:29:48,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=272, PETRI_PLACES=85, PETRI_TRANSITIONS=79} [2025-03-04 15:29:48,564 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 15 predicate places. [2025-03-04 15:29:48,564 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 79 transitions, 272 flow [2025-03-04 15:29:48,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 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:29:48,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:48,565 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:48,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:29:48,565 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-03-04 15:29:48,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:48,565 INFO L85 PathProgramCache]: Analyzing trace with hash -721014390, now seen corresponding path program 1 times [2025-03-04 15:29:48,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:48,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552099517] [2025-03-04 15:29:48,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:48,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:48,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:29:48,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:29:48,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:48,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:48,617 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:29:48,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:48,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552099517] [2025-03-04 15:29:48,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552099517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:48,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:48,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:29:48,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698570562] [2025-03-04 15:29:48,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:48,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:48,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:48,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:48,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:48,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 74 [2025-03-04 15:29:48,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 79 transitions, 272 flow. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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:29:48,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:48,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 74 [2025-03-04 15:29:48,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:49,308 INFO L124 PetriNetUnfolderBase]: 8658/13946 cut-off events. [2025-03-04 15:29:49,309 INFO L125 PetriNetUnfolderBase]: For 6353/6353 co-relation queries the response was YES. [2025-03-04 15:29:49,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31147 conditions, 13946 events. 8658/13946 cut-off events. For 6353/6353 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 97700 event pairs, 4448 based on Foata normal form. 388/13583 useless extension candidates. Maximal degree in co-relation 31132. Up to 8404 conditions per place. [2025-03-04 15:29:49,382 INFO L140 encePairwiseOnDemand]: 68/74 looper letters, 98 selfloop transitions, 4 changer transitions 0/127 dead transitions. [2025-03-04 15:29:49,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 127 transitions, 628 flow [2025-03-04 15:29:49,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:49,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:49,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 215 transitions. [2025-03-04 15:29:49,384 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7263513513513513 [2025-03-04 15:29:49,384 INFO L175 Difference]: Start difference. First operand has 85 places, 79 transitions, 272 flow. Second operand 4 states and 215 transitions. [2025-03-04 15:29:49,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 127 transitions, 628 flow [2025-03-04 15:29:49,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 127 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:29:49,391 INFO L231 Difference]: Finished difference. Result has 88 places, 80 transitions, 287 flow [2025-03-04 15:29:49,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=287, PETRI_PLACES=88, PETRI_TRANSITIONS=80} [2025-03-04 15:29:49,391 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 18 predicate places. [2025-03-04 15:29:49,392 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 80 transitions, 287 flow [2025-03-04 15:29:49,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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:29:49,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:49,392 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:49,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:29:49,392 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-03-04 15:29:49,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:49,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1457906151, now seen corresponding path program 1 times [2025-03-04 15:29:49,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:49,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929889112] [2025-03-04 15:29:49,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:49,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:49,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:29:49,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:29:49,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:49,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:49,435 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:29:49,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:49,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929889112] [2025-03-04 15:29:49,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929889112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:49,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:49,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:29:49,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219493385] [2025-03-04 15:29:49,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:49,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:49,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:49,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:49,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:49,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-04 15:29:49,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 80 transitions, 287 flow. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:49,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:49,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-04 15:29:49,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:50,517 INFO L124 PetriNetUnfolderBase]: 12974/21111 cut-off events. [2025-03-04 15:29:50,517 INFO L125 PetriNetUnfolderBase]: For 12035/12035 co-relation queries the response was YES. [2025-03-04 15:29:50,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48112 conditions, 21111 events. 12974/21111 cut-off events. For 12035/12035 co-relation queries the response was YES. Maximal size of possible extension queue 711. Compared 158602 event pairs, 5340 based on Foata normal form. 301/19647 useless extension candidates. Maximal degree in co-relation 48095. Up to 10454 conditions per place. [2025-03-04 15:29:50,660 INFO L140 encePairwiseOnDemand]: 68/74 looper letters, 74 selfloop transitions, 9 changer transitions 0/110 dead transitions. [2025-03-04 15:29:50,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 110 transitions, 559 flow [2025-03-04 15:29:50,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:50,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:50,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 200 transitions. [2025-03-04 15:29:50,661 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6756756756756757 [2025-03-04 15:29:50,661 INFO L175 Difference]: Start difference. First operand has 88 places, 80 transitions, 287 flow. Second operand 4 states and 200 transitions. [2025-03-04 15:29:50,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 110 transitions, 559 flow [2025-03-04 15:29:50,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 110 transitions, 547 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:29:50,675 INFO L231 Difference]: Finished difference. Result has 91 places, 83 transitions, 326 flow [2025-03-04 15:29:50,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=326, PETRI_PLACES=91, PETRI_TRANSITIONS=83} [2025-03-04 15:29:50,675 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 21 predicate places. [2025-03-04 15:29:50,676 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 83 transitions, 326 flow [2025-03-04 15:29:50,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:50,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:50,676 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:50,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:29:50,676 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-03-04 15:29:50,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:50,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1491324368, now seen corresponding path program 1 times [2025-03-04 15:29:50,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:50,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144771433] [2025-03-04 15:29:50,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:50,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:50,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:29:50,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:29:50,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:50,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:50,731 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:29:50,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:50,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144771433] [2025-03-04 15:29:50,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144771433] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:50,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426334375] [2025-03-04 15:29:50,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:50,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:50,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:50,737 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:29:50,746 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:29:50,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:29:50,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:29:50,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:50,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:50,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:29:50,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:50,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:29:50,817 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:29:50,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426334375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:50,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:29:50,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 6 [2025-03-04 15:29:50,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62493563] [2025-03-04 15:29:50,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:50,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:29:50,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:50,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:29:50,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:29:50,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 74 [2025-03-04 15:29:50,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 83 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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:29:50,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:50,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 74 [2025-03-04 15:29:50,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:52,033 INFO L124 PetriNetUnfolderBase]: 11564/18707 cut-off events. [2025-03-04 15:29:52,033 INFO L125 PetriNetUnfolderBase]: For 12107/12107 co-relation queries the response was YES. [2025-03-04 15:29:52,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45214 conditions, 18707 events. 11564/18707 cut-off events. For 12107/12107 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 137087 event pairs, 7716 based on Foata normal form. 1/17062 useless extension candidates. Maximal degree in co-relation 45195. Up to 14888 conditions per place. [2025-03-04 15:29:52,136 INFO L140 encePairwiseOnDemand]: 71/74 looper letters, 50 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2025-03-04 15:29:52,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 82 transitions, 423 flow [2025-03-04 15:29:52,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:29:52,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:29:52,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2025-03-04 15:29:52,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6621621621621622 [2025-03-04 15:29:52,138 INFO L175 Difference]: Start difference. First operand has 91 places, 83 transitions, 326 flow. Second operand 3 states and 147 transitions. [2025-03-04 15:29:52,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 82 transitions, 423 flow [2025-03-04 15:29:52,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 82 transitions, 419 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:29:52,152 INFO L231 Difference]: Finished difference. Result has 92 places, 82 transitions, 319 flow [2025-03-04 15:29:52,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=319, PETRI_PLACES=92, PETRI_TRANSITIONS=82} [2025-03-04 15:29:52,152 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 22 predicate places. [2025-03-04 15:29:52,153 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 82 transitions, 319 flow [2025-03-04 15:29:52,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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:29:52,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:52,153 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-03-04 15:29:52,159 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:29:52,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:52,353 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-03-04 15:29:52,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:52,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1502386334, now seen corresponding path program 2 times [2025-03-04 15:29:52,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:52,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107567966] [2025-03-04 15:29:52,354 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:29:52,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:52,360 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:29:52,363 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 15:29:52,363 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:29:52,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:52,385 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:29:52,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:52,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107567966] [2025-03-04 15:29:52,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107567966] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:52,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840024374] [2025-03-04 15:29:52,385 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:29:52,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:52,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:52,387 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:29:52,389 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:29:52,428 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:29:52,434 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 15:29:52,434 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:29:52,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:52,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:29:52,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:52,459 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:29:52,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:52,480 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:29:52,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840024374] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:52,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:52,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-03-04 15:29:52,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645678732] [2025-03-04 15:29:52,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:52,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:52,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:52,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:52,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:52,485 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-04 15:29:52,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 82 transitions, 319 flow. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 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:29:52,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:52,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-04 15:29:52,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:53,464 INFO L124 PetriNetUnfolderBase]: 11564/18706 cut-off events. [2025-03-04 15:29:53,464 INFO L125 PetriNetUnfolderBase]: For 12108/12108 co-relation queries the response was YES. [2025-03-04 15:29:53,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45211 conditions, 18706 events. 11564/18706 cut-off events. For 12108/12108 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 137091 event pairs, 7716 based on Foata normal form. 1/17061 useless extension candidates. Maximal degree in co-relation 45191. Up to 14879 conditions per place. [2025-03-04 15:29:53,595 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 37 selfloop transitions, 15 changer transitions 0/81 dead transitions. [2025-03-04 15:29:53,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 81 transitions, 413 flow [2025-03-04 15:29:53,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:53,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:53,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2025-03-04 15:29:53,597 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5878378378378378 [2025-03-04 15:29:53,597 INFO L175 Difference]: Start difference. First operand has 92 places, 82 transitions, 319 flow. Second operand 4 states and 174 transitions. [2025-03-04 15:29:53,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 81 transitions, 413 flow [2025-03-04 15:29:53,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 81 transitions, 399 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-03-04 15:29:53,613 INFO L231 Difference]: Finished difference. Result has 88 places, 81 transitions, 325 flow [2025-03-04 15:29:53,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=325, PETRI_PLACES=88, PETRI_TRANSITIONS=81} [2025-03-04 15:29:53,613 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 18 predicate places. [2025-03-04 15:29:53,613 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 81 transitions, 325 flow [2025-03-04 15:29:53,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 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:29:53,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:53,614 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:53,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 15:29:53,814 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:29:53,814 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-03-04 15:29:53,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:53,815 INFO L85 PathProgramCache]: Analyzing trace with hash -2005480315, now seen corresponding path program 1 times [2025-03-04 15:29:53,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:53,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454319239] [2025-03-04 15:29:53,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:53,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:53,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:29:53,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:29:53,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:53,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:53,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:53,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:53,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454319239] [2025-03-04 15:29:53,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454319239] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:53,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465014327] [2025-03-04 15:29:53,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:53,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:53,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:53,862 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:29:53,864 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:29:53,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:29:53,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:29:53,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:53,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:53,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:29:53,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:53,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:53,980 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:54,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:54,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465014327] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:54,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:54,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 15 [2025-03-04 15:29:54,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207895778] [2025-03-04 15:29:54,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:54,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 15:29:54,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:54,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 15:29:54,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-04 15:29:54,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 74 [2025-03-04 15:29:54,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 81 transitions, 325 flow. Second operand has 15 states, 15 states have (on average 29.466666666666665) internal successors, (442), 15 states have internal predecessors, (442), 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:29:54,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:54,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 74 [2025-03-04 15:29:54,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:56,720 INFO L124 PetriNetUnfolderBase]: 24145/37394 cut-off events. [2025-03-04 15:29:56,720 INFO L125 PetriNetUnfolderBase]: For 22775/22775 co-relation queries the response was YES. [2025-03-04 15:29:56,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91299 conditions, 37394 events. 24145/37394 cut-off events. For 22775/22775 co-relation queries the response was YES. Maximal size of possible extension queue 1113. Compared 281064 event pairs, 6986 based on Foata normal form. 648/36980 useless extension candidates. Maximal degree in co-relation 91283. Up to 12077 conditions per place. [2025-03-04 15:29:57,180 INFO L140 encePairwiseOnDemand]: 63/74 looper letters, 193 selfloop transitions, 20 changer transitions 0/238 dead transitions. [2025-03-04 15:29:57,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 238 transitions, 1315 flow [2025-03-04 15:29:57,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:29:57,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 15:29:57,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 498 transitions. [2025-03-04 15:29:57,182 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5608108108108109 [2025-03-04 15:29:57,182 INFO L175 Difference]: Start difference. First operand has 88 places, 81 transitions, 325 flow. Second operand 12 states and 498 transitions. [2025-03-04 15:29:57,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 238 transitions, 1315 flow [2025-03-04 15:29:57,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 238 transitions, 1285 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:29:57,219 INFO L231 Difference]: Finished difference. Result has 99 places, 86 transitions, 385 flow [2025-03-04 15:29:57,220 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=385, PETRI_PLACES=99, PETRI_TRANSITIONS=86} [2025-03-04 15:29:57,220 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 29 predicate places. [2025-03-04 15:29:57,220 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 86 transitions, 385 flow [2025-03-04 15:29:57,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 29.466666666666665) internal successors, (442), 15 states have internal predecessors, (442), 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:29:57,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:57,220 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:57,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 15:29:57,421 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:29:57,421 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-03-04 15:29:57,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:57,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1447255658, now seen corresponding path program 1 times [2025-03-04 15:29:57,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:57,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751842011] [2025-03-04 15:29:57,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:57,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:57,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:29:57,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:29:57,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:57,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:57,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:57,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:57,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751842011] [2025-03-04 15:29:57,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751842011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:57,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:57,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:29:57,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49178571] [2025-03-04 15:29:57,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:57,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:29:57,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:57,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:29:57,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:29:57,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 74 [2025-03-04 15:29:57,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 86 transitions, 385 flow. Second operand has 5 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 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:29:57,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:57,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 74 [2025-03-04 15:29:57,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:59,609 INFO L124 PetriNetUnfolderBase]: 22939/37080 cut-off events. [2025-03-04 15:29:59,609 INFO L125 PetriNetUnfolderBase]: For 37632/37632 co-relation queries the response was YES. [2025-03-04 15:29:59,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95059 conditions, 37080 events. 22939/37080 cut-off events. For 37632/37632 co-relation queries the response was YES. Maximal size of possible extension queue 1072. Compared 289876 event pairs, 2870 based on Foata normal form. 1584/38474 useless extension candidates. Maximal degree in co-relation 95040. Up to 16680 conditions per place. [2025-03-04 15:29:59,817 INFO L140 encePairwiseOnDemand]: 67/74 looper letters, 103 selfloop transitions, 10 changer transitions 0/138 dead transitions. [2025-03-04 15:29:59,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 138 transitions, 873 flow [2025-03-04 15:29:59,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:29:59,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:29:59,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 236 transitions. [2025-03-04 15:29:59,818 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6378378378378379 [2025-03-04 15:29:59,818 INFO L175 Difference]: Start difference. First operand has 99 places, 86 transitions, 385 flow. Second operand 5 states and 236 transitions. [2025-03-04 15:29:59,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 138 transitions, 873 flow [2025-03-04 15:29:59,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 138 transitions, 837 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 15:29:59,843 INFO L231 Difference]: Finished difference. Result has 95 places, 84 transitions, 377 flow [2025-03-04 15:29:59,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=377, PETRI_PLACES=95, PETRI_TRANSITIONS=84} [2025-03-04 15:29:59,843 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 25 predicate places. [2025-03-04 15:29:59,844 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 84 transitions, 377 flow [2025-03-04 15:29:59,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 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:29:59,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:59,844 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:59,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 15:29:59,844 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-03-04 15:29:59,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:59,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1447254665, now seen corresponding path program 1 times [2025-03-04 15:29:59,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:59,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701865299] [2025-03-04 15:29:59,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:59,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:59,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:29:59,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:29:59,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:59,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:59,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:59,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:59,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701865299] [2025-03-04 15:29:59,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701865299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:59,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:59,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:29:59,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533319394] [2025-03-04 15:29:59,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:59,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:59,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:59,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:59,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:59,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 74 [2025-03-04 15:29:59,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 84 transitions, 377 flow. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:59,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:59,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 74 [2025-03-04 15:29:59,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:02,034 INFO L124 PetriNetUnfolderBase]: 20158/32859 cut-off events. [2025-03-04 15:30:02,034 INFO L125 PetriNetUnfolderBase]: For 36987/36987 co-relation queries the response was YES. [2025-03-04 15:30:02,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86565 conditions, 32859 events. 20158/32859 cut-off events. For 36987/36987 co-relation queries the response was YES. Maximal size of possible extension queue 1012. Compared 256330 event pairs, 6975 based on Foata normal form. 1056/32677 useless extension candidates. Maximal degree in co-relation 86546. Up to 13662 conditions per place. [2025-03-04 15:30:02,196 INFO L140 encePairwiseOnDemand]: 70/74 looper letters, 80 selfloop transitions, 4 changer transitions 0/109 dead transitions. [2025-03-04 15:30:02,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 109 transitions, 662 flow [2025-03-04 15:30:02,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:30:02,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:30:02,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2025-03-04 15:30:02,197 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.581081081081081 [2025-03-04 15:30:02,197 INFO L175 Difference]: Start difference. First operand has 95 places, 84 transitions, 377 flow. Second operand 4 states and 172 transitions. [2025-03-04 15:30:02,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 109 transitions, 662 flow [2025-03-04 15:30:02,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 109 transitions, 628 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 15:30:02,244 INFO L231 Difference]: Finished difference. Result has 91 places, 82 transitions, 341 flow [2025-03-04 15:30:02,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=341, PETRI_PLACES=91, PETRI_TRANSITIONS=82} [2025-03-04 15:30:02,244 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 21 predicate places. [2025-03-04 15:30:02,244 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 82 transitions, 341 flow [2025-03-04 15:30:02,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:02,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:02,244 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:02,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 15:30:02,244 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-03-04 15:30:02,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:02,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1915251993, now seen corresponding path program 1 times [2025-03-04 15:30:02,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:02,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720421407] [2025-03-04 15:30:02,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:02,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:02,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:30:02,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:30:02,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:02,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:02,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:30:02,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:02,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720421407] [2025-03-04 15:30:02,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720421407] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:02,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834269560] [2025-03-04 15:30:02,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:02,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:02,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:02,347 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:02,348 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:02,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:30:02,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:30:02,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:02,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:02,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:30:02,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:02,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:30:02,492 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:30:02,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:30:02,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834269560] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:30:02,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:30:02,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-03-04 15:30:02,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692764328] [2025-03-04 15:30:02,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:30:02,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 15:30:02,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:02,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 15:30:02,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-03-04 15:30:02,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 74 [2025-03-04 15:30:02,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 82 transitions, 341 flow. Second operand has 18 states, 18 states have (on average 28.055555555555557) internal successors, (505), 18 states have internal predecessors, (505), 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:02,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:02,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 74 [2025-03-04 15:30:02,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:04,853 INFO L124 PetriNetUnfolderBase]: 22959/33800 cut-off events. [2025-03-04 15:30:04,854 INFO L125 PetriNetUnfolderBase]: For 30758/30758 co-relation queries the response was YES. [2025-03-04 15:30:04,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89569 conditions, 33800 events. 22959/33800 cut-off events. For 30758/30758 co-relation queries the response was YES. Maximal size of possible extension queue 948. Compared 231686 event pairs, 14250 based on Foata normal form. 76/31539 useless extension candidates. Maximal degree in co-relation 89550. Up to 25791 conditions per place. [2025-03-04 15:30:05,235 INFO L140 encePairwiseOnDemand]: 66/74 looper letters, 94 selfloop transitions, 16 changer transitions 9/143 dead transitions. [2025-03-04 15:30:05,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 143 transitions, 824 flow [2025-03-04 15:30:05,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 15:30:05,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 15:30:05,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 324 transitions. [2025-03-04 15:30:05,237 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2025-03-04 15:30:05,237 INFO L175 Difference]: Start difference. First operand has 91 places, 82 transitions, 341 flow. Second operand 9 states and 324 transitions. [2025-03-04 15:30:05,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 143 transitions, 824 flow [2025-03-04 15:30:05,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 143 transitions, 816 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:30:05,289 INFO L231 Difference]: Finished difference. Result has 99 places, 85 transitions, 397 flow [2025-03-04 15:30:05,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=397, PETRI_PLACES=99, PETRI_TRANSITIONS=85} [2025-03-04 15:30:05,290 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 29 predicate places. [2025-03-04 15:30:05,290 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 85 transitions, 397 flow [2025-03-04 15:30:05,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 28.055555555555557) internal successors, (505), 18 states have internal predecessors, (505), 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:05,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:05,290 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:05,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 15:30:05,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 15:30:05,492 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-03-04 15:30:05,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:05,492 INFO L85 PathProgramCache]: Analyzing trace with hash 2080524115, now seen corresponding path program 1 times [2025-03-04 15:30:05,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:05,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278399155] [2025-03-04 15:30:05,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:05,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:05,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:30:05,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:30:05,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:05,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:05,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:30:05,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:05,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278399155] [2025-03-04 15:30:05,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278399155] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:05,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054467545] [2025-03-04 15:30:05,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:05,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:05,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:05,550 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:05,551 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:05,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:30:05,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:30:05,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:05,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:05,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:30:05,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:05,671 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:30:05,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:30:05,743 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:30:05,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054467545] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:30:05,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:30:05,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2025-03-04 15:30:05,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735816928] [2025-03-04 15:30:05,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:30:05,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 15:30:05,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:05,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 15:30:05,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-04 15:30:05,923 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 74 [2025-03-04 15:30:05,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 85 transitions, 397 flow. Second operand has 14 states, 14 states have (on average 28.142857142857142) internal successors, (394), 14 states have internal predecessors, (394), 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:05,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:05,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 74 [2025-03-04 15:30:05,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:09,917 INFO L124 PetriNetUnfolderBase]: 36842/56925 cut-off events. [2025-03-04 15:30:09,918 INFO L125 PetriNetUnfolderBase]: For 48682/48682 co-relation queries the response was YES. [2025-03-04 15:30:10,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146216 conditions, 56925 events. 36842/56925 cut-off events. For 48682/48682 co-relation queries the response was YES. Maximal size of possible extension queue 1382. Compared 434573 event pairs, 11731 based on Foata normal form. 470/54591 useless extension candidates. Maximal degree in co-relation 146194. Up to 19127 conditions per place. [2025-03-04 15:30:10,306 INFO L140 encePairwiseOnDemand]: 62/74 looper letters, 235 selfloop transitions, 21 changer transitions 13/290 dead transitions. [2025-03-04 15:30:10,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 290 transitions, 1838 flow [2025-03-04 15:30:10,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:30:10,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:30:10,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 538 transitions. [2025-03-04 15:30:10,307 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5592515592515592 [2025-03-04 15:30:10,307 INFO L175 Difference]: Start difference. First operand has 99 places, 85 transitions, 397 flow. Second operand 13 states and 538 transitions. [2025-03-04 15:30:10,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 290 transitions, 1838 flow [2025-03-04 15:30:10,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 290 transitions, 1825 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:30:10,429 INFO L231 Difference]: Finished difference. Result has 110 places, 84 transitions, 428 flow [2025-03-04 15:30:10,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=428, PETRI_PLACES=110, PETRI_TRANSITIONS=84} [2025-03-04 15:30:10,429 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 40 predicate places. [2025-03-04 15:30:10,429 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 84 transitions, 428 flow [2025-03-04 15:30:10,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 28.142857142857142) internal successors, (394), 14 states have internal predecessors, (394), 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:10,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:10,430 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:10,435 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:10,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:10,634 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-03-04 15:30:10,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:10,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1573036522, now seen corresponding path program 1 times [2025-03-04 15:30:10,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:10,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452698490] [2025-03-04 15:30:10,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:10,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:10,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:30:10,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:30:10,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:10,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:10,858 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:30:10,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:10,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452698490] [2025-03-04 15:30:10,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452698490] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:10,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141827472] [2025-03-04 15:30:10,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:10,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:10,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:10,861 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:10,862 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:10,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:30:10,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:30:10,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:10,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:10,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 15:30:10,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:11,062 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:30:11,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:30:11,212 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:30:11,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141827472] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:30:11,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:30:11,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 24 [2025-03-04 15:30:11,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215661681] [2025-03-04 15:30:11,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:30:11,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 15:30:11,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:11,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 15:30:11,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2025-03-04 15:30:11,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 74 [2025-03-04 15:30:11,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 84 transitions, 428 flow. Second operand has 24 states, 24 states have (on average 28.833333333333332) internal successors, (692), 24 states have internal predecessors, (692), 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:11,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:11,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 74 [2025-03-04 15:30:11,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:16,323 INFO L124 PetriNetUnfolderBase]: 39648/60798 cut-off events. [2025-03-04 15:30:16,323 INFO L125 PetriNetUnfolderBase]: For 76370/76370 co-relation queries the response was YES. [2025-03-04 15:30:16,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170057 conditions, 60798 events. 39648/60798 cut-off events. For 76370/76370 co-relation queries the response was YES. Maximal size of possible extension queue 1653. Compared 479994 event pairs, 4704 based on Foata normal form. 1968/61679 useless extension candidates. Maximal degree in co-relation 170031. Up to 15338 conditions per place. [2025-03-04 15:30:16,762 INFO L140 encePairwiseOnDemand]: 63/74 looper letters, 274 selfloop transitions, 25 changer transitions 0/323 dead transitions. [2025-03-04 15:30:16,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 323 transitions, 2169 flow [2025-03-04 15:30:16,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 15:30:16,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 15:30:16,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 685 transitions. [2025-03-04 15:30:16,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5445151033386327 [2025-03-04 15:30:16,766 INFO L175 Difference]: Start difference. First operand has 110 places, 84 transitions, 428 flow. Second operand 17 states and 685 transitions. [2025-03-04 15:30:16,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 323 transitions, 2169 flow [2025-03-04 15:30:17,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 323 transitions, 1907 flow, removed 53 selfloop flow, removed 13 redundant places. [2025-03-04 15:30:17,134 INFO L231 Difference]: Finished difference. Result has 108 places, 87 transitions, 455 flow [2025-03-04 15:30:17,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=455, PETRI_PLACES=108, PETRI_TRANSITIONS=87} [2025-03-04 15:30:17,134 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 38 predicate places. [2025-03-04 15:30:17,134 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 87 transitions, 455 flow [2025-03-04 15:30:17,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 28.833333333333332) internal successors, (692), 24 states have internal predecessors, (692), 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:17,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:17,134 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:17,140 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:17,335 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,SelfDestructingSolverStorable17 [2025-03-04 15:30:17,335 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-03-04 15:30:17,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:17,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1447940324, now seen corresponding path program 2 times [2025-03-04 15:30:17,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:17,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486206093] [2025-03-04 15:30:17,336 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:30:17,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:17,340 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 15:30:17,346 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 21 statements. [2025-03-04 15:30:17,347 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:30:17,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:17,378 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:30:17,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:17,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486206093] [2025-03-04 15:30:17,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486206093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:30:17,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:30:17,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:30:17,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960071084] [2025-03-04 15:30:17,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:30:17,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:30:17,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:17,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:30:17,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:30:17,405 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 74 [2025-03-04 15:30:17,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 87 transitions, 455 flow. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 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:17,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:17,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 74 [2025-03-04 15:30:17,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:21,450 INFO L124 PetriNetUnfolderBase]: 39368/61875 cut-off events. [2025-03-04 15:30:21,450 INFO L125 PetriNetUnfolderBase]: For 80998/80998 co-relation queries the response was YES. [2025-03-04 15:30:21,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170389 conditions, 61875 events. 39368/61875 cut-off events. For 80998/80998 co-relation queries the response was YES. Maximal size of possible extension queue 1693. Compared 502766 event pairs, 13942 based on Foata normal form. 2068/62740 useless extension candidates. Maximal degree in co-relation 170366. Up to 25682 conditions per place. [2025-03-04 15:30:21,960 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 117 selfloop transitions, 5 changer transitions 3/150 dead transitions. [2025-03-04 15:30:21,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 150 transitions, 1093 flow [2025-03-04 15:30:21,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:30:21,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:30:21,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 209 transitions. [2025-03-04 15:30:21,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5648648648648649 [2025-03-04 15:30:21,961 INFO L175 Difference]: Start difference. First operand has 108 places, 87 transitions, 455 flow. Second operand 5 states and 209 transitions. [2025-03-04 15:30:21,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 150 transitions, 1093 flow [2025-03-04 15:30:22,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 150 transitions, 1004 flow, removed 12 selfloop flow, removed 9 redundant places. [2025-03-04 15:30:22,139 INFO L231 Difference]: Finished difference. Result has 102 places, 85 transitions, 419 flow [2025-03-04 15:30:22,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=419, PETRI_PLACES=102, PETRI_TRANSITIONS=85} [2025-03-04 15:30:22,139 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 32 predicate places. [2025-03-04 15:30:22,139 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 85 transitions, 419 flow [2025-03-04 15:30:22,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 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:22,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:22,139 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:22,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 15:30:22,139 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-03-04 15:30:22,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:22,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1813314630, now seen corresponding path program 1 times [2025-03-04 15:30:22,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:22,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465629259] [2025-03-04 15:30:22,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:22,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:22,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:30:22,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:30:22,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:22,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:22,200 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:30:22,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:22,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465629259] [2025-03-04 15:30:22,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465629259] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:22,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663893056] [2025-03-04 15:30:22,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:22,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:22,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:22,202 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:22,204 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:22,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:30:22,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:30:22,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:22,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:22,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 15:30:22,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:22,379 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:30:22,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:30:22,518 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:30:22,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663893056] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:30:22,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:30:22,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 23 [2025-03-04 15:30:22,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977031469] [2025-03-04 15:30:22,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:30:22,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 15:30:22,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:22,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 15:30:22,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2025-03-04 15:30:22,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 74 [2025-03-04 15:30:22,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 85 transitions, 419 flow. Second operand has 23 states, 23 states have (on average 27.608695652173914) internal successors, (635), 23 states have internal predecessors, (635), 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:22,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:22,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 74 [2025-03-04 15:30:22,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:27,121 INFO L124 PetriNetUnfolderBase]: 38668/61270 cut-off events. [2025-03-04 15:30:27,121 INFO L125 PetriNetUnfolderBase]: For 69530/69530 co-relation queries the response was YES. [2025-03-04 15:30:27,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166256 conditions, 61270 events. 38668/61270 cut-off events. For 69530/69530 co-relation queries the response was YES. Maximal size of possible extension queue 1403. Compared 487445 event pairs, 4735 based on Foata normal form. 1646/62208 useless extension candidates. Maximal degree in co-relation 166233. Up to 14732 conditions per place. [2025-03-04 15:30:27,478 INFO L140 encePairwiseOnDemand]: 62/74 looper letters, 214 selfloop transitions, 22 changer transitions 96/350 dead transitions. [2025-03-04 15:30:27,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 350 transitions, 2290 flow [2025-03-04 15:30:27,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 15:30:27,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 15:30:27,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 721 transitions. [2025-03-04 15:30:27,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5412912912912913 [2025-03-04 15:30:27,480 INFO L175 Difference]: Start difference. First operand has 102 places, 85 transitions, 419 flow. Second operand 18 states and 721 transitions. [2025-03-04 15:30:27,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 350 transitions, 2290 flow [2025-03-04 15:30:27,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 350 transitions, 2200 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:30:27,816 INFO L231 Difference]: Finished difference. Result has 113 places, 77 transitions, 403 flow [2025-03-04 15:30:27,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=403, PETRI_PLACES=113, PETRI_TRANSITIONS=77} [2025-03-04 15:30:27,816 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 43 predicate places. [2025-03-04 15:30:27,816 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 77 transitions, 403 flow [2025-03-04 15:30:27,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 27.608695652173914) internal successors, (635), 23 states have internal predecessors, (635), 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:27,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:27,817 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:27,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 15:30:28,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:28,017 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-03-04 15:30:28,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:28,018 INFO L85 PathProgramCache]: Analyzing trace with hash 119889314, now seen corresponding path program 1 times [2025-03-04 15:30:28,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:28,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935752273] [2025-03-04 15:30:28,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:28,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:28,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:30:28,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:30:28,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:28,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:28,070 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:30:28,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:28,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935752273] [2025-03-04 15:30:28,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935752273] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:28,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938066957] [2025-03-04 15:30:28,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:28,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:28,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:28,072 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:28,074 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:28,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:30:28,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:30:28,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:28,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:28,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:30:28,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:28,148 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:30:28,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:30:28,172 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:30:28,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938066957] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:30:28,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:30:28,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 15:30:28,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138348585] [2025-03-04 15:30:28,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:30:28,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:30:28,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:28,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:30:28,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:30:28,192 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 74 [2025-03-04 15:30:28,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 77 transitions, 403 flow. Second operand has 10 states, 10 states have (on average 35.5) internal successors, (355), 10 states have internal predecessors, (355), 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:28,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:28,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 74 [2025-03-04 15:30:28,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand