./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/array-eq-trans.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/array-eq-trans.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 e7f1528a4c77969c5bff279724a3ed43475460be047e2e4b141f1353c3ea9cfe --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:23:46,497 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:23:46,543 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:23:46,549 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:23:46,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:23:46,567 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:23:46,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:23:46,567 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:23:46,568 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:23:46,568 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:23:46,569 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:23:46,569 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:23:46,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:23:46,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:23:46,570 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:23:46,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:23:46,570 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:23:46,570 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:23:46,570 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:23:46,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:23:46,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:23:46,570 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:23:46,570 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:23:46,570 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:23:46,570 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:23:46,570 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:23:46,570 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:23:46,571 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:23:46,571 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:23:46,571 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:23:46,571 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:23:46,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:23:46,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:23:46,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:23:46,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:23:46,571 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:23:46,571 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:23:46,571 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:23:46,571 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:23:46,571 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:23:46,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:23:46,571 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:23:46,571 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:23:46,571 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:23:46,572 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:23:46,572 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 -> e7f1528a4c77969c5bff279724a3ed43475460be047e2e4b141f1353c3ea9cfe [2025-03-04 15:23:46,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:23:46,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:23:46,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:23:46,837 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:23:46,838 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:23:46,840 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/array-eq-trans.wvr.c [2025-03-04 15:23:48,001 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e18b9f5c/497d8722cea443a1b40e9efbeb81c7c1/FLAGfd5ce8749 [2025-03-04 15:23:48,268 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:23:48,269 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/array-eq-trans.wvr.c [2025-03-04 15:23:48,278 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e18b9f5c/497d8722cea443a1b40e9efbeb81c7c1/FLAGfd5ce8749 [2025-03-04 15:23:48,296 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e18b9f5c/497d8722cea443a1b40e9efbeb81c7c1 [2025-03-04 15:23:48,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:23:48,299 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:23:48,300 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:23:48,301 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:23:48,304 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:23:48,305 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:23:48" (1/1) ... [2025-03-04 15:23:48,306 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24eea893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:48, skipping insertion in model container [2025-03-04 15:23:48,307 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:23:48" (1/1) ... [2025-03-04 15:23:48,320 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:23:48,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:23:48,457 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:23:48,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:23:48,494 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:23:48,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:48 WrapperNode [2025-03-04 15:23:48,495 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:23:48,496 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:23:48,496 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:23:48,496 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:23:48,500 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:23:48" (1/1) ... [2025-03-04 15:23:48,506 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:23:48" (1/1) ... [2025-03-04 15:23:48,523 INFO L138 Inliner]: procedures = 23, calls = 32, calls flagged for inlining = 11, calls inlined = 15, statements flattened = 193 [2025-03-04 15:23:48,523 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:23:48,523 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:23:48,524 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:23:48,524 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:23:48,530 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:48" (1/1) ... [2025-03-04 15:23:48,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:48" (1/1) ... [2025-03-04 15:23:48,532 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:48" (1/1) ... [2025-03-04 15:23:48,548 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-04 15:23:48,549 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:48" (1/1) ... [2025-03-04 15:23:48,549 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:48" (1/1) ... [2025-03-04 15:23:48,556 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:48" (1/1) ... [2025-03-04 15:23:48,557 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:48" (1/1) ... [2025-03-04 15:23:48,558 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:48" (1/1) ... [2025-03-04 15:23:48,558 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:48" (1/1) ... [2025-03-04 15:23:48,560 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:23:48,560 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:23:48,560 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:23:48,560 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:23:48,561 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:48" (1/1) ... [2025-03-04 15:23:48,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:23:48,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:23:48,584 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:23:48,585 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:23:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:23:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:23:48,602 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:23:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:23:48,602 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:23:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 15:23:48,602 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 15:23:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:23:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:23:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:23:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:23:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:23:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:23:48,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:23:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:23:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:23:48,603 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:23:48,690 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:23:48,692 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:23:49,032 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:23:49,032 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:23:49,308 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:23:49,309 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:23:49,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:23:49 BoogieIcfgContainer [2025-03-04 15:23:49,310 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:23:49,312 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:23:49,312 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:23:49,315 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:23:49,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:23:48" (1/3) ... [2025-03-04 15:23:49,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@401e3449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:23:49, skipping insertion in model container [2025-03-04 15:23:49,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:48" (2/3) ... [2025-03-04 15:23:49,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@401e3449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:23:49, skipping insertion in model container [2025-03-04 15:23:49,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:23:49" (3/3) ... [2025-03-04 15:23:49,319 INFO L128 eAbstractionObserver]: Analyzing ICFG array-eq-trans.wvr.c [2025-03-04 15:23:49,330 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:23:49,332 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array-eq-trans.wvr.c that has 4 procedures, 54 locations, 1 initial locations, 6 loop locations, and 12 error locations. [2025-03-04 15:23:49,332 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:23:49,374 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:23:49,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 62 transitions, 145 flow [2025-03-04 15:23:49,430 INFO L124 PetriNetUnfolderBase]: 9/59 cut-off events. [2025-03-04 15:23:49,431 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 15:23:49,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 59 events. 9/59 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 138 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2025-03-04 15:23:49,434 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 62 transitions, 145 flow [2025-03-04 15:23:49,437 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 57 transitions, 129 flow [2025-03-04 15:23:49,445 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:23:49,452 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;@2e60f8c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:23:49,452 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-03-04 15:23:49,455 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:23:49,455 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:23:49,455 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:23:49,455 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:49,456 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:23:49,456 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:23:49,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:49,460 INFO L85 PathProgramCache]: Analyzing trace with hash 648626, now seen corresponding path program 1 times [2025-03-04 15:23:49,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:49,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451999072] [2025-03-04 15:23:49,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:49,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:49,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:23:49,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:23:49,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:49,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:49,642 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:23:49,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:49,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451999072] [2025-03-04 15:23:49,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451999072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:49,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:49,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:23:49,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982625145] [2025-03-04 15:23:49,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:49,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:49,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:49,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:49,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:49,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 62 [2025-03-04 15:23:49,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 129 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:49,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:49,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 62 [2025-03-04 15:23:49,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:50,044 INFO L124 PetriNetUnfolderBase]: 1540/2507 cut-off events. [2025-03-04 15:23:50,044 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-03-04 15:23:50,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4607 conditions, 2507 events. 1540/2507 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 14749 event pairs, 930 based on Foata normal form. 3/2056 useless extension candidates. Maximal degree in co-relation 4234. Up to 1960 conditions per place. [2025-03-04 15:23:50,076 INFO L140 encePairwiseOnDemand]: 46/62 looper letters, 38 selfloop transitions, 10 changer transitions 0/66 dead transitions. [2025-03-04 15:23:50,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 66 transitions, 243 flow [2025-03-04 15:23:50,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:50,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2025-03-04 15:23:50,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5564516129032258 [2025-03-04 15:23:50,089 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 129 flow. Second operand 4 states and 138 transitions. [2025-03-04 15:23:50,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 66 transitions, 243 flow [2025-03-04 15:23:50,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 66 transitions, 234 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 15:23:50,097 INFO L231 Difference]: Finished difference. Result has 59 places, 66 transitions, 208 flow [2025-03-04 15:23:50,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=59, PETRI_TRANSITIONS=66} [2025-03-04 15:23:50,103 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 1 predicate places. [2025-03-04 15:23:50,103 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 66 transitions, 208 flow [2025-03-04 15:23:50,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:50,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:50,103 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:23:50,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:23:50,103 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:23:50,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:50,104 INFO L85 PathProgramCache]: Analyzing trace with hash 2143898586, now seen corresponding path program 1 times [2025-03-04 15:23:50,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:50,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438685752] [2025-03-04 15:23:50,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:50,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:50,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:23:50,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:23:50,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:50,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:50,255 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:23:50,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:50,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438685752] [2025-03-04 15:23:50,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438685752] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:23:50,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223930966] [2025-03-04 15:23:50,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:50,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:50,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:23:50,258 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:23:50,260 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:23:50,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:23:50,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:23:50,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:50,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:50,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:23:50,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:23:50,370 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:23:50,371 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:23:50,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223930966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:50,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:23:50,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:23:50,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342516191] [2025-03-04 15:23:50,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:50,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:23:50,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:50,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:23:50,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:23:50,396 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 62 [2025-03-04 15:23:50,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 66 transitions, 208 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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:23:50,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:50,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 62 [2025-03-04 15:23:50,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:50,681 INFO L124 PetriNetUnfolderBase]: 1540/2504 cut-off events. [2025-03-04 15:23:50,681 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-03-04 15:23:50,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4584 conditions, 2504 events. 1540/2504 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 14698 event pairs, 930 based on Foata normal form. 3/2058 useless extension candidates. Maximal degree in co-relation 4511. Up to 1945 conditions per place. [2025-03-04 15:23:50,697 INFO L140 encePairwiseOnDemand]: 49/62 looper letters, 28 selfloop transitions, 17 changer transitions 0/63 dead transitions. [2025-03-04 15:23:50,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 63 transitions, 286 flow [2025-03-04 15:23:50,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:23:50,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:23:50,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 174 transitions. [2025-03-04 15:23:50,700 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46774193548387094 [2025-03-04 15:23:50,700 INFO L175 Difference]: Start difference. First operand has 59 places, 66 transitions, 208 flow. Second operand 6 states and 174 transitions. [2025-03-04 15:23:50,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 63 transitions, 286 flow [2025-03-04 15:23:50,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 63 transitions, 286 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:23:50,701 INFO L231 Difference]: Finished difference. Result has 61 places, 63 transitions, 230 flow [2025-03-04 15:23:50,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=230, PETRI_PLACES=61, PETRI_TRANSITIONS=63} [2025-03-04 15:23:50,702 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places. [2025-03-04 15:23:50,702 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 63 transitions, 230 flow [2025-03-04 15:23:50,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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:23:50,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:50,704 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:23:50,712 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:23:50,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:50,909 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:23:50,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:50,910 INFO L85 PathProgramCache]: Analyzing trace with hash 2036347278, now seen corresponding path program 1 times [2025-03-04 15:23:50,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:50,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001300950] [2025-03-04 15:23:50,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:50,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:50,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:23:50,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:23:50,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:50,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:51,000 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:23:51,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:51,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001300950] [2025-03-04 15:23:51,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001300950] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:23:51,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875240644] [2025-03-04 15:23:51,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:51,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:51,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:23:51,003 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:23:51,005 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:23:51,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:23:51,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:23:51,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:51,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:51,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:23:51,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:23:51,089 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:23:51,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:23:51,122 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:23:51,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875240644] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:23:51,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:23:51,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 15:23:51,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766907485] [2025-03-04 15:23:51,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:23:51,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:23:51,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:51,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:23:51,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:23:51,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 62 [2025-03-04 15:23:51,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 63 transitions, 230 flow. Second operand has 12 states, 12 states have (on average 22.083333333333332) internal successors, (265), 12 states have internal predecessors, (265), 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:23:51,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:51,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 62 [2025-03-04 15:23:51,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:51,496 INFO L124 PetriNetUnfolderBase]: 1549/2540 cut-off events. [2025-03-04 15:23:51,497 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2025-03-04 15:23:51,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4725 conditions, 2540 events. 1549/2540 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 14967 event pairs, 930 based on Foata normal form. 9/2100 useless extension candidates. Maximal degree in co-relation 4513. Up to 1960 conditions per place. [2025-03-04 15:23:51,514 INFO L140 encePairwiseOnDemand]: 49/62 looper letters, 35 selfloop transitions, 37 changer transitions 0/90 dead transitions. [2025-03-04 15:23:51,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 90 transitions, 548 flow [2025-03-04 15:23:51,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:23:51,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:23:51,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 291 transitions. [2025-03-04 15:23:51,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4693548387096774 [2025-03-04 15:23:51,517 INFO L175 Difference]: Start difference. First operand has 61 places, 63 transitions, 230 flow. Second operand 10 states and 291 transitions. [2025-03-04 15:23:51,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 90 transitions, 548 flow [2025-03-04 15:23:51,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 90 transitions, 465 flow, removed 16 selfloop flow, removed 5 redundant places. [2025-03-04 15:23:51,521 INFO L231 Difference]: Finished difference. Result has 68 places, 90 transitions, 445 flow [2025-03-04 15:23:51,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=445, PETRI_PLACES=68, PETRI_TRANSITIONS=90} [2025-03-04 15:23:51,522 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 10 predicate places. [2025-03-04 15:23:51,522 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 90 transitions, 445 flow [2025-03-04 15:23:51,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 22.083333333333332) internal successors, (265), 12 states have internal predecessors, (265), 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:23:51,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:51,522 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:51,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 15:23:51,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-04 15:23:51,723 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:23:51,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:51,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1110786779, now seen corresponding path program 1 times [2025-03-04 15:23:51,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:51,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751825254] [2025-03-04 15:23:51,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:51,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:51,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:23:51,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:23:51,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:51,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:51,793 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:23:51,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:51,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751825254] [2025-03-04 15:23:51,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751825254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:51,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:51,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:23:51,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510398535] [2025-03-04 15:23:51,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:51,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:51,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:51,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:51,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:51,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 62 [2025-03-04 15:23:51,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 90 transitions, 445 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:51,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:51,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 62 [2025-03-04 15:23:51,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:52,078 INFO L124 PetriNetUnfolderBase]: 2890/4460 cut-off events. [2025-03-04 15:23:52,080 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2025-03-04 15:23:52,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8592 conditions, 4460 events. 2890/4460 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 26558 event pairs, 613 based on Foata normal form. 86/3846 useless extension candidates. Maximal degree in co-relation 8494. Up to 2214 conditions per place. [2025-03-04 15:23:52,103 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 105 selfloop transitions, 3 changer transitions 0/127 dead transitions. [2025-03-04 15:23:52,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 127 transitions, 743 flow [2025-03-04 15:23:52,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:52,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:52,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2025-03-04 15:23:52,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7016129032258065 [2025-03-04 15:23:52,105 INFO L175 Difference]: Start difference. First operand has 68 places, 90 transitions, 445 flow. Second operand 4 states and 174 transitions. [2025-03-04 15:23:52,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 127 transitions, 743 flow [2025-03-04 15:23:52,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 127 transitions, 706 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-03-04 15:23:52,110 INFO L231 Difference]: Finished difference. Result has 71 places, 92 transitions, 430 flow [2025-03-04 15:23:52,110 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=430, PETRI_PLACES=71, PETRI_TRANSITIONS=92} [2025-03-04 15:23:52,111 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 13 predicate places. [2025-03-04 15:23:52,111 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 92 transitions, 430 flow [2025-03-04 15:23:52,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:52,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:52,111 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:52,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:23:52,111 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:23:52,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:52,112 INFO L85 PathProgramCache]: Analyzing trace with hash 977099304, now seen corresponding path program 1 times [2025-03-04 15:23:52,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:52,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109407212] [2025-03-04 15:23:52,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:52,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:52,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:23:52,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:23:52,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:52,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:52,181 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:23:52,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:52,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109407212] [2025-03-04 15:23:52,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109407212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:52,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:52,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:23:52,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225114586] [2025-03-04 15:23:52,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:52,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:52,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:52,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:52,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:52,187 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 62 [2025-03-04 15:23:52,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 92 transitions, 430 flow. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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:23:52,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:52,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 62 [2025-03-04 15:23:52,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:52,475 INFO L124 PetriNetUnfolderBase]: 3053/4809 cut-off events. [2025-03-04 15:23:52,476 INFO L125 PetriNetUnfolderBase]: For 694/732 co-relation queries the response was YES. [2025-03-04 15:23:52,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9736 conditions, 4809 events. 3053/4809 cut-off events. For 694/732 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 29567 event pairs, 1338 based on Foata normal form. 152/4302 useless extension candidates. Maximal degree in co-relation 9640. Up to 2851 conditions per place. [2025-03-04 15:23:52,504 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 85 selfloop transitions, 3 changer transitions 0/107 dead transitions. [2025-03-04 15:23:52,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 107 transitions, 650 flow [2025-03-04 15:23:52,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:52,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:52,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 149 transitions. [2025-03-04 15:23:52,505 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6008064516129032 [2025-03-04 15:23:52,505 INFO L175 Difference]: Start difference. First operand has 71 places, 92 transitions, 430 flow. Second operand 4 states and 149 transitions. [2025-03-04 15:23:52,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 107 transitions, 650 flow [2025-03-04 15:23:52,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 107 transitions, 647 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:23:52,508 INFO L231 Difference]: Finished difference. Result has 72 places, 91 transitions, 432 flow [2025-03-04 15:23:52,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=432, PETRI_PLACES=72, PETRI_TRANSITIONS=91} [2025-03-04 15:23:52,509 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 14 predicate places. [2025-03-04 15:23:52,509 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 91 transitions, 432 flow [2025-03-04 15:23:52,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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:23:52,509 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:52,509 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:52,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:23:52,509 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:23:52,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:52,509 INFO L85 PathProgramCache]: Analyzing trace with hash 225307981, now seen corresponding path program 1 times [2025-03-04 15:23:52,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:52,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294941690] [2025-03-04 15:23:52,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:52,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:52,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:23:52,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:23:52,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:52,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:52,558 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:23:52,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:52,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294941690] [2025-03-04 15:23:52,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294941690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:52,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:52,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:23:52,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531262917] [2025-03-04 15:23:52,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:52,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:52,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:52,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:52,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:52,563 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 62 [2025-03-04 15:23:52,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 91 transitions, 432 flow. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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:23:52,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:52,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 62 [2025-03-04 15:23:52,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:53,005 INFO L124 PetriNetUnfolderBase]: 4375/6810 cut-off events. [2025-03-04 15:23:53,005 INFO L125 PetriNetUnfolderBase]: For 1420/1570 co-relation queries the response was YES. [2025-03-04 15:23:53,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14364 conditions, 6810 events. 4375/6810 cut-off events. For 1420/1570 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 42796 event pairs, 1017 based on Foata normal form. 152/6541 useless extension candidates. Maximal degree in co-relation 14268. Up to 3161 conditions per place. [2025-03-04 15:23:53,031 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 107 selfloop transitions, 3 changer transitions 0/129 dead transitions. [2025-03-04 15:23:53,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 129 transitions, 759 flow [2025-03-04 15:23:53,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:53,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:53,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2025-03-04 15:23:53,033 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6814516129032258 [2025-03-04 15:23:53,033 INFO L175 Difference]: Start difference. First operand has 72 places, 91 transitions, 432 flow. Second operand 4 states and 169 transitions. [2025-03-04 15:23:53,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 129 transitions, 759 flow [2025-03-04 15:23:53,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 129 transitions, 749 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:23:53,039 INFO L231 Difference]: Finished difference. Result has 74 places, 93 transitions, 446 flow [2025-03-04 15:23:53,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=446, PETRI_PLACES=74, PETRI_TRANSITIONS=93} [2025-03-04 15:23:53,040 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 16 predicate places. [2025-03-04 15:23:53,040 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 93 transitions, 446 flow [2025-03-04 15:23:53,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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:23:53,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:53,041 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:53,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:23:53,041 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:23:53,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:53,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1680357029, now seen corresponding path program 1 times [2025-03-04 15:23:53,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:53,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737030096] [2025-03-04 15:23:53,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:53,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:53,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:23:53,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:23:53,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:53,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:53,109 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:23:53,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:53,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737030096] [2025-03-04 15:23:53,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737030096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:53,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:53,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:23:53,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6364699] [2025-03-04 15:23:53,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:53,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:53,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:53,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:53,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:53,123 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 62 [2025-03-04 15:23:53,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 93 transitions, 446 flow. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:53,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:53,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 62 [2025-03-04 15:23:53,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:53,775 INFO L124 PetriNetUnfolderBase]: 7559/11511 cut-off events. [2025-03-04 15:23:53,775 INFO L125 PetriNetUnfolderBase]: For 3146/3536 co-relation queries the response was YES. [2025-03-04 15:23:53,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24976 conditions, 11511 events. 7559/11511 cut-off events. For 3146/3536 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 73748 event pairs, 1880 based on Foata normal form. 224/10952 useless extension candidates. Maximal degree in co-relation 24878. Up to 5561 conditions per place. [2025-03-04 15:23:53,832 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 111 selfloop transitions, 3 changer transitions 0/132 dead transitions. [2025-03-04 15:23:53,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 132 transitions, 798 flow [2025-03-04 15:23:53,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:53,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:53,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2025-03-04 15:23:53,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6774193548387096 [2025-03-04 15:23:53,835 INFO L175 Difference]: Start difference. First operand has 74 places, 93 transitions, 446 flow. Second operand 4 states and 168 transitions. [2025-03-04 15:23:53,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 132 transitions, 798 flow [2025-03-04 15:23:53,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 132 transitions, 794 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:23:53,843 INFO L231 Difference]: Finished difference. Result has 78 places, 95 transitions, 466 flow [2025-03-04 15:23:53,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=466, PETRI_PLACES=78, PETRI_TRANSITIONS=95} [2025-03-04 15:23:53,844 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 20 predicate places. [2025-03-04 15:23:53,844 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 95 transitions, 466 flow [2025-03-04 15:23:53,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:53,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:53,844 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:53,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:23:53,844 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:23:53,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:53,845 INFO L85 PathProgramCache]: Analyzing trace with hash 860961536, now seen corresponding path program 1 times [2025-03-04 15:23:53,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:53,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055825286] [2025-03-04 15:23:53,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:53,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:53,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:23:53,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:23:53,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:53,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:53,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:23:53,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:53,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055825286] [2025-03-04 15:23:53,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055825286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:53,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:53,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:23:53,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567234557] [2025-03-04 15:23:53,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:53,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:53,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:53,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:53,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:53,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 62 [2025-03-04 15:23:53,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 95 transitions, 466 flow. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:53,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:53,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 62 [2025-03-04 15:23:53,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:54,475 INFO L124 PetriNetUnfolderBase]: 7653/12571 cut-off events. [2025-03-04 15:23:54,476 INFO L125 PetriNetUnfolderBase]: For 4400/4590 co-relation queries the response was YES. [2025-03-04 15:23:54,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28311 conditions, 12571 events. 7653/12571 cut-off events. For 4400/4590 co-relation queries the response was YES. Maximal size of possible extension queue 598. Compared 90999 event pairs, 5344 based on Foata normal form. 193/12653 useless extension candidates. Maximal degree in co-relation 28154. Up to 8724 conditions per place. [2025-03-04 15:23:54,529 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 118 selfloop transitions, 10 changer transitions 0/148 dead transitions. [2025-03-04 15:23:54,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 148 transitions, 984 flow [2025-03-04 15:23:54,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:23:54,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:23:54,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 203 transitions. [2025-03-04 15:23:54,530 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6548387096774193 [2025-03-04 15:23:54,530 INFO L175 Difference]: Start difference. First operand has 78 places, 95 transitions, 466 flow. Second operand 5 states and 203 transitions. [2025-03-04 15:23:54,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 148 transitions, 984 flow [2025-03-04 15:23:54,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 148 transitions, 981 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:23:54,535 INFO L231 Difference]: Finished difference. Result has 83 places, 102 transitions, 558 flow [2025-03-04 15:23:54,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=558, PETRI_PLACES=83, PETRI_TRANSITIONS=102} [2025-03-04 15:23:54,536 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 25 predicate places. [2025-03-04 15:23:54,536 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 102 transitions, 558 flow [2025-03-04 15:23:54,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:54,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:54,536 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-03-04 15:23:54,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:23:54,536 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:23:54,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:54,537 INFO L85 PathProgramCache]: Analyzing trace with hash 798291126, now seen corresponding path program 2 times [2025-03-04 15:23:54,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:54,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036072472] [2025-03-04 15:23:54,537 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:23:54,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:54,544 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:23:54,547 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 15:23:54,547 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:23:54,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:54,570 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:23:54,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:54,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036072472] [2025-03-04 15:23:54,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036072472] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:23:54,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752457302] [2025-03-04 15:23:54,570 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:23:54,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:54,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:23:54,572 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:23:54,574 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:23:54,615 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:23:54,621 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 15:23:54,622 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:23:54,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:54,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:23:54,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:23:54,641 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:23:54,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:23:54,672 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:23:54,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752457302] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:23:54,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:23:54,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-03-04 15:23:54,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057767753] [2025-03-04 15:23:54,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:23:54,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:54,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:54,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:54,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:54,687 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 62 [2025-03-04 15:23:54,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 102 transitions, 558 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:54,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:54,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 62 [2025-03-04 15:23:54,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:55,420 INFO L124 PetriNetUnfolderBase]: 7683/12888 cut-off events. [2025-03-04 15:23:55,420 INFO L125 PetriNetUnfolderBase]: For 4799/4829 co-relation queries the response was YES. [2025-03-04 15:23:55,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29017 conditions, 12888 events. 7683/12888 cut-off events. For 4799/4829 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 96630 event pairs, 5335 based on Foata normal form. 1/12709 useless extension candidates. Maximal degree in co-relation 28856. Up to 10455 conditions per place. [2025-03-04 15:23:55,479 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 68 selfloop transitions, 16 changer transitions 0/101 dead transitions. [2025-03-04 15:23:55,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 101 transitions, 716 flow [2025-03-04 15:23:55,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:55,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:55,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2025-03-04 15:23:55,481 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4838709677419355 [2025-03-04 15:23:55,481 INFO L175 Difference]: Start difference. First operand has 83 places, 102 transitions, 558 flow. Second operand 4 states and 120 transitions. [2025-03-04 15:23:55,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 101 transitions, 716 flow [2025-03-04 15:23:55,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 101 transitions, 712 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 15:23:55,486 INFO L231 Difference]: Finished difference. Result has 84 places, 101 transitions, 576 flow [2025-03-04 15:23:55,486 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=576, PETRI_PLACES=84, PETRI_TRANSITIONS=101} [2025-03-04 15:23:55,487 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 26 predicate places. [2025-03-04 15:23:55,487 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 101 transitions, 576 flow [2025-03-04 15:23:55,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:55,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:55,487 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:55,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 15:23:55,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:55,688 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:23:55,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:55,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1287319768, now seen corresponding path program 1 times [2025-03-04 15:23:55,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:55,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657802514] [2025-03-04 15:23:55,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:55,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:55,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:23:55,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:23:55,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:55,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:55,780 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:23:55,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:55,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657802514] [2025-03-04 15:23:55,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657802514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:55,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:55,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:23:55,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053704491] [2025-03-04 15:23:55,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:55,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:23:55,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:55,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:23:55,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:23:55,788 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 62 [2025-03-04 15:23:55,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 101 transitions, 576 flow. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:55,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:55,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 62 [2025-03-04 15:23:55,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:56,763 INFO L124 PetriNetUnfolderBase]: 9822/16302 cut-off events. [2025-03-04 15:23:56,763 INFO L125 PetriNetUnfolderBase]: For 5926/6234 co-relation queries the response was YES. [2025-03-04 15:23:56,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36668 conditions, 16302 events. 9822/16302 cut-off events. For 5926/6234 co-relation queries the response was YES. Maximal size of possible extension queue 720. Compared 123922 event pairs, 4782 based on Foata normal form. 193/16332 useless extension candidates. Maximal degree in co-relation 36450. Up to 5925 conditions per place. [2025-03-04 15:23:56,829 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 136 selfloop transitions, 10 changer transitions 0/165 dead transitions. [2025-03-04 15:23:56,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 165 transitions, 1132 flow [2025-03-04 15:23:56,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:23:56,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:23:56,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 216 transitions. [2025-03-04 15:23:56,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6967741935483871 [2025-03-04 15:23:56,830 INFO L175 Difference]: Start difference. First operand has 84 places, 101 transitions, 576 flow. Second operand 5 states and 216 transitions. [2025-03-04 15:23:56,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 165 transitions, 1132 flow [2025-03-04 15:23:56,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 165 transitions, 1100 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:23:56,837 INFO L231 Difference]: Finished difference. Result has 86 places, 101 transitions, 567 flow [2025-03-04 15:23:56,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=567, PETRI_PLACES=86, PETRI_TRANSITIONS=101} [2025-03-04 15:23:56,838 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 28 predicate places. [2025-03-04 15:23:56,838 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 101 transitions, 567 flow [2025-03-04 15:23:56,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:56,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:56,838 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:56,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:23:56,838 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:23:56,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:56,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1607609902, now seen corresponding path program 1 times [2025-03-04 15:23:56,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:56,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564993150] [2025-03-04 15:23:56,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:56,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:56,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:23:56,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:23:56,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:56,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:56,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:23:56,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:56,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564993150] [2025-03-04 15:23:56,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564993150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:56,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:56,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:23:56,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127436292] [2025-03-04 15:23:56,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:56,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:23:56,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:56,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:23:56,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:23:56,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 62 [2025-03-04 15:23:56,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 101 transitions, 567 flow. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:56,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:56,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 62 [2025-03-04 15:23:56,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:57,564 INFO L124 PetriNetUnfolderBase]: 7725/12606 cut-off events. [2025-03-04 15:23:57,564 INFO L125 PetriNetUnfolderBase]: For 5809/6194 co-relation queries the response was YES. [2025-03-04 15:23:57,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29150 conditions, 12606 events. 7725/12606 cut-off events. For 5809/6194 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 89521 event pairs, 2895 based on Foata normal form. 92/12576 useless extension candidates. Maximal degree in co-relation 28935. Up to 5043 conditions per place. [2025-03-04 15:23:57,616 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 127 selfloop transitions, 10 changer transitions 1/157 dead transitions. [2025-03-04 15:23:57,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 157 transitions, 1084 flow [2025-03-04 15:23:57,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:23:57,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:23:57,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 210 transitions. [2025-03-04 15:23:57,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6774193548387096 [2025-03-04 15:23:57,617 INFO L175 Difference]: Start difference. First operand has 86 places, 101 transitions, 567 flow. Second operand 5 states and 210 transitions. [2025-03-04 15:23:57,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 157 transitions, 1084 flow [2025-03-04 15:23:57,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 157 transitions, 1069 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 15:23:57,624 INFO L231 Difference]: Finished difference. Result has 89 places, 101 transitions, 577 flow [2025-03-04 15:23:57,625 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=577, PETRI_PLACES=89, PETRI_TRANSITIONS=101} [2025-03-04 15:23:57,625 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 31 predicate places. [2025-03-04 15:23:57,625 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 101 transitions, 577 flow [2025-03-04 15:23:57,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:57,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:57,625 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1] [2025-03-04 15:23:57,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:23:57,625 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:23:57,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:57,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1261675985, now seen corresponding path program 1 times [2025-03-04 15:23:57,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:57,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967039731] [2025-03-04 15:23:57,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:57,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:57,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:23:57,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:23:57,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:57,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:57,730 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:57,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:57,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967039731] [2025-03-04 15:23:57,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967039731] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:23:57,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460314340] [2025-03-04 15:23:57,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:57,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:57,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:23:57,732 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:23:57,734 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:23:57,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:23:57,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:23:57,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:57,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:57,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:23:57,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:23:57,831 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:57,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:23:57,944 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:57,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460314340] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:23:57,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:23:57,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-04 15:23:57,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314962220] [2025-03-04 15:23:57,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:23:57,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 15:23:57,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:57,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 15:23:57,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-04 15:23:58,000 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 62 [2025-03-04 15:23:58,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 101 transitions, 577 flow. Second operand has 24 states, 24 states have (on average 22.083333333333332) internal successors, (530), 24 states have internal predecessors, (530), 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:23:58,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:58,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 62 [2025-03-04 15:23:58,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:59,060 INFO L124 PetriNetUnfolderBase]: 8106/13771 cut-off events. [2025-03-04 15:23:59,060 INFO L125 PetriNetUnfolderBase]: For 7224/7258 co-relation queries the response was YES. [2025-03-04 15:23:59,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32434 conditions, 13771 events. 8106/13771 cut-off events. For 7224/7258 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 105153 event pairs, 5625 based on Foata normal form. 36/13529 useless extension candidates. Maximal degree in co-relation 31617. Up to 11057 conditions per place. [2025-03-04 15:23:59,123 INFO L140 encePairwiseOnDemand]: 50/62 looper letters, 40 selfloop transitions, 104 changer transitions 0/161 dead transitions. [2025-03-04 15:23:59,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 161 transitions, 1309 flow [2025-03-04 15:23:59,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 15:23:59,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 15:23:59,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 599 transitions. [2025-03-04 15:23:59,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43914956011730205 [2025-03-04 15:23:59,126 INFO L175 Difference]: Start difference. First operand has 89 places, 101 transitions, 577 flow. Second operand 22 states and 599 transitions. [2025-03-04 15:23:59,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 161 transitions, 1309 flow [2025-03-04 15:23:59,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 161 transitions, 1240 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:23:59,136 INFO L231 Difference]: Finished difference. Result has 112 places, 161 transitions, 1234 flow [2025-03-04 15:23:59,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1234, PETRI_PLACES=112, PETRI_TRANSITIONS=161} [2025-03-04 15:23:59,137 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 54 predicate places. [2025-03-04 15:23:59,137 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 161 transitions, 1234 flow [2025-03-04 15:23:59,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 22.083333333333332) internal successors, (530), 24 states have internal predecessors, (530), 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:23:59,138 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:59,138 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:59,143 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:23:59,338 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:23:59,338 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:23:59,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:59,339 INFO L85 PathProgramCache]: Analyzing trace with hash 325015936, now seen corresponding path program 1 times [2025-03-04 15:23:59,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:59,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021644681] [2025-03-04 15:23:59,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:59,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:59,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:23:59,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:23:59,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:59,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:59,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:23:59,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:59,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021644681] [2025-03-04 15:23:59,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021644681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:59,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:59,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:23:59,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103689846] [2025-03-04 15:23:59,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:59,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:59,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:59,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:59,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:59,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 62 [2025-03-04 15:23:59,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 161 transitions, 1234 flow. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 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:23:59,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:59,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 62 [2025-03-04 15:23:59,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:00,320 INFO L124 PetriNetUnfolderBase]: 7004/11861 cut-off events. [2025-03-04 15:24:00,321 INFO L125 PetriNetUnfolderBase]: For 6268/6317 co-relation queries the response was YES. [2025-03-04 15:24:00,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28179 conditions, 11861 events. 7004/11861 cut-off events. For 6268/6317 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 87415 event pairs, 4839 based on Foata normal form. 49/11776 useless extension candidates. Maximal degree in co-relation 27882. Up to 9139 conditions per place. [2025-03-04 15:24:00,400 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 194 selfloop transitions, 16 changer transitions 2/231 dead transitions. [2025-03-04 15:24:00,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 231 transitions, 2185 flow [2025-03-04 15:24:00,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:24:00,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:24:00,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 199 transitions. [2025-03-04 15:24:00,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6419354838709678 [2025-03-04 15:24:00,401 INFO L175 Difference]: Start difference. First operand has 112 places, 161 transitions, 1234 flow. Second operand 5 states and 199 transitions. [2025-03-04 15:24:00,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 231 transitions, 2185 flow [2025-03-04 15:24:00,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 231 transitions, 1799 flow, removed 114 selfloop flow, removed 9 redundant places. [2025-03-04 15:24:00,415 INFO L231 Difference]: Finished difference. Result has 108 places, 161 transitions, 1023 flow [2025-03-04 15:24:00,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=976, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1023, PETRI_PLACES=108, PETRI_TRANSITIONS=161} [2025-03-04 15:24:00,416 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 50 predicate places. [2025-03-04 15:24:00,416 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 161 transitions, 1023 flow [2025-03-04 15:24:00,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 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:24:00,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:00,417 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:24:00,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 15:24:00,417 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:24:00,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:00,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1328275205, now seen corresponding path program 1 times [2025-03-04 15:24:00,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:00,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110449555] [2025-03-04 15:24:00,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:00,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:00,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:24:00,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:24:00,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:00,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:00,490 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:24:00,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:00,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110449555] [2025-03-04 15:24:00,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110449555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:00,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:00,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:24:00,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990264378] [2025-03-04 15:24:00,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:00,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:24:00,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:00,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:24:00,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:24:00,500 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 62 [2025-03-04 15:24:00,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 161 transitions, 1023 flow. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:24:00,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:00,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 62 [2025-03-04 15:24:00,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:01,443 INFO L124 PetriNetUnfolderBase]: 7954/13404 cut-off events. [2025-03-04 15:24:01,443 INFO L125 PetriNetUnfolderBase]: For 6885/7251 co-relation queries the response was YES. [2025-03-04 15:24:01,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31945 conditions, 13404 events. 7954/13404 cut-off events. For 6885/7251 co-relation queries the response was YES. Maximal size of possible extension queue 587. Compared 99677 event pairs, 3402 based on Foata normal form. 220/13453 useless extension candidates. Maximal degree in co-relation 31687. Up to 4822 conditions per place. [2025-03-04 15:24:01,516 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 160 selfloop transitions, 26 changer transitions 1/206 dead transitions. [2025-03-04 15:24:01,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 206 transitions, 1551 flow [2025-03-04 15:24:01,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:24:01,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:24:01,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 211 transitions. [2025-03-04 15:24:01,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6806451612903226 [2025-03-04 15:24:01,517 INFO L175 Difference]: Start difference. First operand has 108 places, 161 transitions, 1023 flow. Second operand 5 states and 211 transitions. [2025-03-04 15:24:01,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 206 transitions, 1551 flow [2025-03-04 15:24:01,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 206 transitions, 1519 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:24:01,526 INFO L231 Difference]: Finished difference. Result has 109 places, 160 transitions, 1037 flow [2025-03-04 15:24:01,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=991, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1037, PETRI_PLACES=109, PETRI_TRANSITIONS=160} [2025-03-04 15:24:01,527 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 51 predicate places. [2025-03-04 15:24:01,527 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 160 transitions, 1037 flow [2025-03-04 15:24:01,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:24:01,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:01,527 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:01,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 15:24:01,528 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:24:01,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:01,528 INFO L85 PathProgramCache]: Analyzing trace with hash -935182513, now seen corresponding path program 1 times [2025-03-04 15:24:01,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:01,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904744671] [2025-03-04 15:24:01,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:01,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:01,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:24:01,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:24:01,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:01,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:01,596 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:24:01,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:01,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904744671] [2025-03-04 15:24:01,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904744671] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:24:01,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3285715] [2025-03-04 15:24:01,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:01,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:01,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:01,598 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:24:01,600 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:24:01,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:24:01,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:24:01,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:01,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:01,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:24:01,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:24:01,774 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:24:01,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:24:01,868 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:24:01,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3285715] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:24:01,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:24:01,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 17 [2025-03-04 15:24:01,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569166305] [2025-03-04 15:24:01,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:24:01,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 15:24:01,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:01,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 15:24:01,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-03-04 15:24:02,003 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 62 [2025-03-04 15:24:02,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 160 transitions, 1037 flow. Second operand has 18 states, 18 states have (on average 21.38888888888889) internal successors, (385), 18 states have internal predecessors, (385), 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:24:02,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:02,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 62 [2025-03-04 15:24:02,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:03,756 INFO L124 PetriNetUnfolderBase]: 14303/23234 cut-off events. [2025-03-04 15:24:03,756 INFO L125 PetriNetUnfolderBase]: For 14363/14982 co-relation queries the response was YES. [2025-03-04 15:24:03,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56755 conditions, 23234 events. 14303/23234 cut-off events. For 14363/14982 co-relation queries the response was YES. Maximal size of possible extension queue 989. Compared 181638 event pairs, 4712 based on Foata normal form. 536/23345 useless extension candidates. Maximal degree in co-relation 56382. Up to 4589 conditions per place. [2025-03-04 15:24:03,918 INFO L140 encePairwiseOnDemand]: 48/62 looper letters, 321 selfloop transitions, 91 changer transitions 2/429 dead transitions. [2025-03-04 15:24:03,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 429 transitions, 3288 flow [2025-03-04 15:24:03,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 15:24:03,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 15:24:03,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 517 transitions. [2025-03-04 15:24:03,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4905123339658444 [2025-03-04 15:24:03,920 INFO L175 Difference]: Start difference. First operand has 109 places, 160 transitions, 1037 flow. Second operand 17 states and 517 transitions. [2025-03-04 15:24:03,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 429 transitions, 3288 flow [2025-03-04 15:24:03,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 429 transitions, 3234 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:24:03,950 INFO L231 Difference]: Finished difference. Result has 126 places, 210 transitions, 1760 flow [2025-03-04 15:24:03,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1006, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1760, PETRI_PLACES=126, PETRI_TRANSITIONS=210} [2025-03-04 15:24:03,950 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 68 predicate places. [2025-03-04 15:24:03,950 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 210 transitions, 1760 flow [2025-03-04 15:24:03,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 21.38888888888889) internal successors, (385), 18 states have internal predecessors, (385), 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:24:03,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:03,951 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:03,957 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:24:04,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 15:24:04,151 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:24:04,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:04,152 INFO L85 PathProgramCache]: Analyzing trace with hash 259840424, now seen corresponding path program 1 times [2025-03-04 15:24:04,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:04,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917822864] [2025-03-04 15:24:04,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:04,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:04,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:24:04,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:24:04,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:04,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:04,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:24:04,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:04,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917822864] [2025-03-04 15:24:04,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917822864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:04,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:04,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:24:04,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302981441] [2025-03-04 15:24:04,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:04,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:24:04,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:04,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:24:04,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:24:04,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 62 [2025-03-04 15:24:04,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 210 transitions, 1760 flow. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:24:04,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:04,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 62 [2025-03-04 15:24:04,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:05,427 INFO L124 PetriNetUnfolderBase]: 11758/19698 cut-off events. [2025-03-04 15:24:05,427 INFO L125 PetriNetUnfolderBase]: For 17623/17873 co-relation queries the response was YES. [2025-03-04 15:24:05,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50158 conditions, 19698 events. 11758/19698 cut-off events. For 17623/17873 co-relation queries the response was YES. Maximal size of possible extension queue 851. Compared 154236 event pairs, 4870 based on Foata normal form. 78/19550 useless extension candidates. Maximal degree in co-relation 49733. Up to 8754 conditions per place. [2025-03-04 15:24:05,557 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 201 selfloop transitions, 27 changer transitions 5/251 dead transitions. [2025-03-04 15:24:05,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 251 transitions, 2404 flow [2025-03-04 15:24:05,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:24:05,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:24:05,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 205 transitions. [2025-03-04 15:24:05,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6612903225806451 [2025-03-04 15:24:05,559 INFO L175 Difference]: Start difference. First operand has 126 places, 210 transitions, 1760 flow. Second operand 5 states and 205 transitions. [2025-03-04 15:24:05,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 251 transitions, 2404 flow [2025-03-04 15:24:05,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 251 transitions, 2339 flow, removed 5 selfloop flow, removed 7 redundant places. [2025-03-04 15:24:05,586 INFO L231 Difference]: Finished difference. Result has 124 places, 210 transitions, 1772 flow [2025-03-04 15:24:05,586 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1715, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1772, PETRI_PLACES=124, PETRI_TRANSITIONS=210} [2025-03-04 15:24:05,586 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 66 predicate places. [2025-03-04 15:24:05,586 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 210 transitions, 1772 flow [2025-03-04 15:24:05,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:24:05,587 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:05,587 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:05,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 15:24:05,587 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:24:05,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:05,587 INFO L85 PathProgramCache]: Analyzing trace with hash 64796157, now seen corresponding path program 1 times [2025-03-04 15:24:05,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:05,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434000257] [2025-03-04 15:24:05,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:05,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:05,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 15:24:05,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:24:05,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:05,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:05,708 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:24:05,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:05,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434000257] [2025-03-04 15:24:05,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434000257] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:24:05,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601647517] [2025-03-04 15:24:05,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:05,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:05,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:05,711 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:24:05,712 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:24:05,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 15:24:05,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:24:05,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:05,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:05,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:24:05,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:24:05,891 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:24:05,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:24:05,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:24:05,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601647517] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:24:05,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:24:05,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2025-03-04 15:24:05,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563583361] [2025-03-04 15:24:05,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:24:05,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 15:24:05,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:05,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 15:24:05,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2025-03-04 15:24:06,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 62 [2025-03-04 15:24:06,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 210 transitions, 1772 flow. Second operand has 21 states, 21 states have (on average 21.0) internal successors, (441), 21 states have internal predecessors, (441), 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:24:06,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:06,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 62 [2025-03-04 15:24:06,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:11,736 INFO L124 PetriNetUnfolderBase]: 36134/59043 cut-off events. [2025-03-04 15:24:11,736 INFO L125 PetriNetUnfolderBase]: For 53126/54210 co-relation queries the response was YES. [2025-03-04 15:24:12,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149590 conditions, 59043 events. 36134/59043 cut-off events. For 53126/54210 co-relation queries the response was YES. Maximal size of possible extension queue 2436. Compared 525147 event pairs, 14027 based on Foata normal form. 1284/59507 useless extension candidates. Maximal degree in co-relation 149033. Up to 8891 conditions per place. [2025-03-04 15:24:12,187 INFO L140 encePairwiseOnDemand]: 49/62 looper letters, 357 selfloop transitions, 251 changer transitions 27/650 dead transitions. [2025-03-04 15:24:12,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 650 transitions, 5429 flow [2025-03-04 15:24:12,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-04 15:24:12,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-04 15:24:12,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 967 transitions. [2025-03-04 15:24:12,190 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45872865275142316 [2025-03-04 15:24:12,190 INFO L175 Difference]: Start difference. First operand has 124 places, 210 transitions, 1772 flow. Second operand 34 states and 967 transitions. [2025-03-04 15:24:12,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 650 transitions, 5429 flow [2025-03-04 15:24:12,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 650 transitions, 5338 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:24:12,293 INFO L231 Difference]: Finished difference. Result has 158 places, 310 transitions, 3205 flow [2025-03-04 15:24:12,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1719, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=3205, PETRI_PLACES=158, PETRI_TRANSITIONS=310} [2025-03-04 15:24:12,294 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 100 predicate places. [2025-03-04 15:24:12,294 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 310 transitions, 3205 flow [2025-03-04 15:24:12,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 21.0) internal successors, (441), 21 states have internal predecessors, (441), 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:24:12,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:12,294 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:12,300 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:24:12,494 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,SelfDestructingSolverStorable16 [2025-03-04 15:24:12,495 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:24:12,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:12,495 INFO L85 PathProgramCache]: Analyzing trace with hash 755653588, now seen corresponding path program 1 times [2025-03-04 15:24:12,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:12,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342933002] [2025-03-04 15:24:12,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:12,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:12,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:24:12,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:24:12,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:12,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:12,572 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 15:24:12,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:12,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342933002] [2025-03-04 15:24:12,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342933002] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:24:12,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014518153] [2025-03-04 15:24:12,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:12,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:12,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:12,575 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:24:12,577 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:24:12,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:24:12,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:24:12,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:12,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:12,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:24:12,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:24:12,734 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:24:12,734 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:24:12,810 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:24:12,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014518153] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:24:12,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:24:12,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 18 [2025-03-04 15:24:12,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224817692] [2025-03-04 15:24:12,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:24:12,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 15:24:12,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:12,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 15:24:12,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2025-03-04 15:24:12,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 62 [2025-03-04 15:24:12,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 310 transitions, 3205 flow. Second operand has 19 states, 19 states have (on average 21.105263157894736) internal successors, (401), 19 states have internal predecessors, (401), 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:24:12,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:12,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 62 [2025-03-04 15:24:12,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:18,188 INFO L124 PetriNetUnfolderBase]: 37859/61135 cut-off events. [2025-03-04 15:24:18,188 INFO L125 PetriNetUnfolderBase]: For 89176/90626 co-relation queries the response was YES. [2025-03-04 15:24:18,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164307 conditions, 61135 events. 37859/61135 cut-off events. For 89176/90626 co-relation queries the response was YES. Maximal size of possible extension queue 2293. Compared 532371 event pairs, 11655 based on Foata normal form. 718/61487 useless extension candidates. Maximal degree in co-relation 163693. Up to 11915 conditions per place. [2025-03-04 15:24:18,639 INFO L140 encePairwiseOnDemand]: 48/62 looper letters, 340 selfloop transitions, 149 changer transitions 7/511 dead transitions. [2025-03-04 15:24:18,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 511 transitions, 5113 flow [2025-03-04 15:24:18,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 15:24:18,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 15:24:18,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 525 transitions. [2025-03-04 15:24:18,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4981024667931689 [2025-03-04 15:24:18,641 INFO L175 Difference]: Start difference. First operand has 158 places, 310 transitions, 3205 flow. Second operand 17 states and 525 transitions. [2025-03-04 15:24:18,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 511 transitions, 5113 flow [2025-03-04 15:24:18,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 511 transitions, 4988 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 15:24:18,742 INFO L231 Difference]: Finished difference. Result has 172 places, 317 transitions, 3568 flow [2025-03-04 15:24:18,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=3084, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3568, PETRI_PLACES=172, PETRI_TRANSITIONS=317} [2025-03-04 15:24:18,743 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 114 predicate places. [2025-03-04 15:24:18,743 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 317 transitions, 3568 flow [2025-03-04 15:24:18,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 21.105263157894736) internal successors, (401), 19 states have internal predecessors, (401), 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:24:18,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:18,743 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:18,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 15:24:18,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:18,944 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:24:18,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:18,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1768494820, now seen corresponding path program 1 times [2025-03-04 15:24:18,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:18,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722466656] [2025-03-04 15:24:18,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:18,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:18,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:24:18,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:24:18,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:18,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:19,003 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:24:19,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:19,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722466656] [2025-03-04 15:24:19,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722466656] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:24:19,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605563468] [2025-03-04 15:24:19,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:19,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:19,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:19,005 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:24:19,007 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:24:19,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:24:19,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:24:19,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:19,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:19,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:24:19,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:24:19,168 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:24:19,169 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:24:19,260 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:24:19,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605563468] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:24:19,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:24:19,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 17 [2025-03-04 15:24:19,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695737345] [2025-03-04 15:24:19,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:24:19,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 15:24:19,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:19,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 15:24:19,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-03-04 15:24:19,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 62 [2025-03-04 15:24:19,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 317 transitions, 3568 flow. Second operand has 18 states, 18 states have (on average 22.055555555555557) internal successors, (397), 18 states have internal predecessors, (397), 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:24:19,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:19,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 62 [2025-03-04 15:24:19,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:24,312 INFO L124 PetriNetUnfolderBase]: 34477/55179 cut-off events. [2025-03-04 15:24:24,312 INFO L125 PetriNetUnfolderBase]: For 106698/107417 co-relation queries the response was YES. [2025-03-04 15:24:24,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156227 conditions, 55179 events. 34477/55179 cut-off events. For 106698/107417 co-relation queries the response was YES. Maximal size of possible extension queue 1994. Compared 467438 event pairs, 12220 based on Foata normal form. 1361/55189 useless extension candidates. Maximal degree in co-relation 155573. Up to 13825 conditions per place. [2025-03-04 15:24:24,785 INFO L140 encePairwiseOnDemand]: 49/62 looper letters, 415 selfloop transitions, 140 changer transitions 40/609 dead transitions. [2025-03-04 15:24:24,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 609 transitions, 7031 flow [2025-03-04 15:24:24,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 15:24:24,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 15:24:24,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 502 transitions. [2025-03-04 15:24:24,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.476280834914611 [2025-03-04 15:24:24,786 INFO L175 Difference]: Start difference. First operand has 172 places, 317 transitions, 3568 flow. Second operand 17 states and 502 transitions. [2025-03-04 15:24:24,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 609 transitions, 7031 flow [2025-03-04 15:24:24,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 609 transitions, 6960 flow, removed 7 selfloop flow, removed 7 redundant places. [2025-03-04 15:24:24,920 INFO L231 Difference]: Finished difference. Result has 180 places, 316 transitions, 3787 flow [2025-03-04 15:24:24,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=3510, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3787, PETRI_PLACES=180, PETRI_TRANSITIONS=316} [2025-03-04 15:24:24,921 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 122 predicate places. [2025-03-04 15:24:24,921 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 316 transitions, 3787 flow [2025-03-04 15:24:24,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 22.055555555555557) internal successors, (397), 18 states have internal predecessors, (397), 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:24:24,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:24,921 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:24,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 15:24:25,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:25,122 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:24:25,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:25,122 INFO L85 PathProgramCache]: Analyzing trace with hash 781929203, now seen corresponding path program 1 times [2025-03-04 15:24:25,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:25,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350456147] [2025-03-04 15:24:25,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:25,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:25,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 15:24:25,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 15:24:25,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:25,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:25,192 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 15:24:25,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:25,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350456147] [2025-03-04 15:24:25,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350456147] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:24:25,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824674077] [2025-03-04 15:24:25,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:25,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:25,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:25,194 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:24:25,196 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:24:25,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 15:24:25,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 15:24:25,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:25,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:25,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:24:25,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:24:25,543 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:24:25,543 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:24:25,633 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:24:25,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824674077] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:24:25,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:24:25,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 18 [2025-03-04 15:24:25,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531172425] [2025-03-04 15:24:25,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:24:25,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 15:24:25,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:25,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 15:24:25,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2025-03-04 15:24:25,744 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 62 [2025-03-04 15:24:25,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 316 transitions, 3787 flow. Second operand has 19 states, 19 states have (on average 21.68421052631579) internal successors, (412), 19 states have internal predecessors, (412), 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:24:25,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:25,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 62 [2025-03-04 15:24:25,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:30,677 INFO L124 PetriNetUnfolderBase]: 34383/54945 cut-off events. [2025-03-04 15:24:30,677 INFO L125 PetriNetUnfolderBase]: For 120803/121868 co-relation queries the response was YES. [2025-03-04 15:24:30,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161087 conditions, 54945 events. 34383/54945 cut-off events. For 120803/121868 co-relation queries the response was YES. Maximal size of possible extension queue 1696. Compared 454904 event pairs, 11140 based on Foata normal form. 827/55257 useless extension candidates. Maximal degree in co-relation 160412. Up to 11951 conditions per place. [2025-03-04 15:24:31,096 INFO L140 encePairwiseOnDemand]: 49/62 looper letters, 231 selfloop transitions, 236 changer transitions 38/519 dead transitions. [2025-03-04 15:24:31,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 519 transitions, 5974 flow [2025-03-04 15:24:31,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 15:24:31,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 15:24:31,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 437 transitions. [2025-03-04 15:24:31,097 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5034562211981567 [2025-03-04 15:24:31,097 INFO L175 Difference]: Start difference. First operand has 180 places, 316 transitions, 3787 flow. Second operand 14 states and 437 transitions. [2025-03-04 15:24:31,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 519 transitions, 5974 flow [2025-03-04 15:24:31,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 519 transitions, 5792 flow, removed 2 selfloop flow, removed 12 redundant places. [2025-03-04 15:24:31,304 INFO L231 Difference]: Finished difference. Result has 184 places, 316 transitions, 4086 flow [2025-03-04 15:24:31,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=3615, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=232, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4086, PETRI_PLACES=184, PETRI_TRANSITIONS=316} [2025-03-04 15:24:31,304 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 126 predicate places. [2025-03-04 15:24:31,304 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 316 transitions, 4086 flow [2025-03-04 15:24:31,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 21.68421052631579) internal successors, (412), 19 states have internal predecessors, (412), 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:24:31,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:31,304 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:31,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 15:24:31,505 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:24:31,505 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:24:31,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:31,506 INFO L85 PathProgramCache]: Analyzing trace with hash -883517262, now seen corresponding path program 2 times [2025-03-04 15:24:31,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:31,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999205990] [2025-03-04 15:24:31,506 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:24:31,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:31,514 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 15:24:31,519 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 28 statements. [2025-03-04 15:24:31,519 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:24:31,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:31,545 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 15:24:31,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:31,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999205990] [2025-03-04 15:24:31,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999205990] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:24:31,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448910427] [2025-03-04 15:24:31,545 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:24:31,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:31,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:31,547 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:24:31,549 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:24:31,598 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 15:24:31,611 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 28 statements. [2025-03-04 15:24:31,611 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:24:31,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:31,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:24:31,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:24:31,638 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 15:24:31,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:24:31,665 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 15:24:31,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448910427] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:24:31,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:24:31,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-04 15:24:31,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166557519] [2025-03-04 15:24:31,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:24:31,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:24:31,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:31,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:24:31,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:24:31,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 62 [2025-03-04 15:24:31,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 316 transitions, 4086 flow. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 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:24:31,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:31,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 62 [2025-03-04 15:24:31,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:36,354 INFO L124 PetriNetUnfolderBase]: 31617/51122 cut-off events. [2025-03-04 15:24:36,355 INFO L125 PetriNetUnfolderBase]: For 123634/124255 co-relation queries the response was YES. [2025-03-04 15:24:36,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153678 conditions, 51122 events. 31617/51122 cut-off events. For 123634/124255 co-relation queries the response was YES. Maximal size of possible extension queue 1559. Compared 425164 event pairs, 14170 based on Foata normal form. 0/50558 useless extension candidates. Maximal degree in co-relation 152969. Up to 26481 conditions per place. [2025-03-04 15:24:36,968 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 340 selfloop transitions, 10 changer transitions 12/378 dead transitions. [2025-03-04 15:24:36,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 378 transitions, 5211 flow [2025-03-04 15:24:36,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:24:36,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:24:36,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 190 transitions. [2025-03-04 15:24:36,969 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6129032258064516 [2025-03-04 15:24:36,969 INFO L175 Difference]: Start difference. First operand has 184 places, 316 transitions, 4086 flow. Second operand 5 states and 190 transitions. [2025-03-04 15:24:36,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 378 transitions, 5211 flow [2025-03-04 15:24:37,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 378 transitions, 4952 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-03-04 15:24:37,259 INFO L231 Difference]: Finished difference. Result has 178 places, 312 transitions, 3835 flow [2025-03-04 15:24:37,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=3831, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3835, PETRI_PLACES=178, PETRI_TRANSITIONS=312} [2025-03-04 15:24:37,260 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 120 predicate places. [2025-03-04 15:24:37,260 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 312 transitions, 3835 flow [2025-03-04 15:24:37,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 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:24:37,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:37,260 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:37,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 15:24:37,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 15:24:37,461 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:24:37,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:37,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1218377424, now seen corresponding path program 2 times [2025-03-04 15:24:37,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:37,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424548873] [2025-03-04 15:24:37,461 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:24:37,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:37,467 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 15:24:37,470 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 30 statements. [2025-03-04 15:24:37,470 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:24:37,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:37,497 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 15:24:37,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:37,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424548873] [2025-03-04 15:24:37,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424548873] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:24:37,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574271725] [2025-03-04 15:24:37,498 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:24:37,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:37,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:37,500 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:24:37,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 15:24:37,555 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 15:24:37,568 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 30 statements. [2025-03-04 15:24:37,568 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:24:37,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:37,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:24:37,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:24:37,602 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 15:24:37,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:24:37,633 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 15:24:37,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574271725] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:24:37,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:24:37,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-03-04 15:24:37,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654392379] [2025-03-04 15:24:37,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:24:37,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:24:37,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:37,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:24:37,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:24:37,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 62 [2025-03-04 15:24:37,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 312 transitions, 3835 flow. Second operand has 6 states, 6 states have (on average 29.666666666666668) internal successors, (178), 6 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:24:37,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:37,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 62 [2025-03-04 15:24:37,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:42,363 INFO L124 PetriNetUnfolderBase]: 31521/50539 cut-off events. [2025-03-04 15:24:42,364 INFO L125 PetriNetUnfolderBase]: For 137036/137495 co-relation queries the response was YES. [2025-03-04 15:24:42,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155491 conditions, 50539 events. 31521/50539 cut-off events. For 137036/137495 co-relation queries the response was YES. Maximal size of possible extension queue 1504. Compared 413073 event pairs, 15104 based on Foata normal form. 482/50533 useless extension candidates. Maximal degree in co-relation 154811. Up to 27300 conditions per place. [2025-03-04 15:24:42,765 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 329 selfloop transitions, 10 changer transitions 17/371 dead transitions. [2025-03-04 15:24:42,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 371 transitions, 4929 flow [2025-03-04 15:24:42,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:24:42,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:24:42,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 193 transitions. [2025-03-04 15:24:42,766 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6225806451612903 [2025-03-04 15:24:42,766 INFO L175 Difference]: Start difference. First operand has 178 places, 312 transitions, 3835 flow. Second operand 5 states and 193 transitions. [2025-03-04 15:24:42,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 371 transitions, 4929 flow [2025-03-04 15:24:43,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 371 transitions, 4832 flow, removed 18 selfloop flow, removed 8 redundant places. [2025-03-04 15:24:43,011 INFO L231 Difference]: Finished difference. Result has 170 places, 305 transitions, 3769 flow [2025-03-04 15:24:43,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=3788, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3769, PETRI_PLACES=170, PETRI_TRANSITIONS=305} [2025-03-04 15:24:43,012 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 112 predicate places. [2025-03-04 15:24:43,012 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 305 transitions, 3769 flow [2025-03-04 15:24:43,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.666666666666668) internal successors, (178), 6 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:24:43,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:43,012 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:43,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 15:24:43,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 15:24:43,213 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:24:43,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:43,213 INFO L85 PathProgramCache]: Analyzing trace with hash -980966524, now seen corresponding path program 2 times [2025-03-04 15:24:43,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:43,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194066337] [2025-03-04 15:24:43,213 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:24:43,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:43,220 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-04 15:24:43,224 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 34 statements. [2025-03-04 15:24:43,224 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:24:43,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:43,256 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 15:24:43,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:43,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194066337] [2025-03-04 15:24:43,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194066337] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:24:43,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565690111] [2025-03-04 15:24:43,257 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:24:43,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:43,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:43,261 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:24:43,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 15:24:43,315 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-04 15:24:43,329 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 34 statements. [2025-03-04 15:24:43,330 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:24:43,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:43,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:24:43,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:24:43,359 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 15:24:43,360 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:24:43,391 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 15:24:43,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565690111] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:24:43,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:24:43,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-04 15:24:43,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972811850] [2025-03-04 15:24:43,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:24:43,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:24:43,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:43,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:24:43,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:24:43,403 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 62 [2025-03-04 15:24:43,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 305 transitions, 3769 flow. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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:24:43,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:43,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 62 [2025-03-04 15:24:43,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand