./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-nonblocking-cntr-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-nonblocking-cntr-alt.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 0ead2366baa94ec77674f75cd829f45857f5651e204e91d33a749a2af2868461 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:55:06,190 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:55:06,247 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:55:06,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:55:06,252 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:55:06,269 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:55:06,270 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:55:06,270 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:55:06,271 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:55:06,271 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:55:06,271 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:55:06,272 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:55:06,272 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:55:06,272 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:55:06,272 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:55:06,272 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:55:06,272 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:55:06,272 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:55:06,273 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:55:06,273 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:55:06,273 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:55:06,273 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:55:06,273 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:55:06,273 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:55:06,273 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:55:06,273 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:55:06,274 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:55:06,274 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:55:06,274 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:55:06,274 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:55:06,274 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:55:06,274 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:55:06,274 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:55:06,274 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:55:06,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:55:06,274 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:55:06,274 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:55:06,274 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:55:06,274 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:55:06,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:55:06,274 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:55:06,274 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:55:06,274 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:55:06,274 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:55:06,274 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:55:06,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:55:06,274 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:55:06,275 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:55:06,275 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:55:06,275 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:55:06,275 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-jdk21/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 -> 0ead2366baa94ec77674f75cd829f45857f5651e204e91d33a749a2af2868461 [2025-01-10 06:55:06,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:55:06,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:55:06,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:55:06,538 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:55:06,539 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:55:06,540 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-nonblocking-cntr-alt.wvr.c [2025-01-10 06:55:07,854 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4183ba10a/2e2c62f878b54b94842f8ccec217aae4/FLAGd0704ea7e [2025-01-10 06:55:08,087 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:55:08,087 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-nonblocking-cntr-alt.wvr.c [2025-01-10 06:55:08,114 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4183ba10a/2e2c62f878b54b94842f8ccec217aae4/FLAGd0704ea7e [2025-01-10 06:55:08,131 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4183ba10a/2e2c62f878b54b94842f8ccec217aae4 [2025-01-10 06:55:08,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:55:08,137 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:55:08,138 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:55:08,138 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:55:08,141 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:55:08,142 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:55:08" (1/1) ... [2025-01-10 06:55:08,143 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@341019ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:55:08, skipping insertion in model container [2025-01-10 06:55:08,143 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:55:08" (1/1) ... [2025-01-10 06:55:08,155 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:55:08,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:55:08,292 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:55:08,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:55:08,319 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:55:08,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:55:08 WrapperNode [2025-01-10 06:55:08,320 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:55:08,321 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:55:08,321 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:55:08,321 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:55:08,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:55:08" (1/1) ... [2025-01-10 06:55:08,333 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:55:08" (1/1) ... [2025-01-10 06:55:08,349 INFO L138 Inliner]: procedures = 20, calls = 15, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 50 [2025-01-10 06:55:08,350 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:55:08,351 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:55:08,352 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:55:08,352 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:55:08,359 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:55:08" (1/1) ... [2025-01-10 06:55:08,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:55:08" (1/1) ... [2025-01-10 06:55:08,362 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:55:08" (1/1) ... [2025-01-10 06:55:08,380 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 06:55:08,381 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:55:08" (1/1) ... [2025-01-10 06:55:08,381 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:55:08" (1/1) ... [2025-01-10 06:55:08,385 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:55:08" (1/1) ... [2025-01-10 06:55:08,388 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:55:08" (1/1) ... [2025-01-10 06:55:08,393 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:55:08" (1/1) ... [2025-01-10 06:55:08,394 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:55:08" (1/1) ... [2025-01-10 06:55:08,398 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:55:08" (1/1) ... [2025-01-10 06:55:08,400 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:55:08,402 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:55:08,402 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:55:08,402 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:55:08,403 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:55:08" (1/1) ... [2025-01-10 06:55:08,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:55:08,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:55:08,444 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:55:08,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:55:08,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:55:08,482 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 06:55:08,482 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 06:55:08,482 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 06:55:08,483 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 06:55:08,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:55:08,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 06:55:08,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 06:55:08,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:55:08,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:55:08,485 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:55:08,569 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:55:08,571 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:55:08,724 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:55:08,725 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:55:08,871 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:55:08,871 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:55:08,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:55:08 BoogieIcfgContainer [2025-01-10 06:55:08,872 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:55:08,873 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:55:08,873 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:55:08,879 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:55:08,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:55:08" (1/3) ... [2025-01-10 06:55:08,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51450b1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:55:08, skipping insertion in model container [2025-01-10 06:55:08,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:55:08" (2/3) ... [2025-01-10 06:55:08,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51450b1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:55:08, skipping insertion in model container [2025-01-10 06:55:08,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:55:08" (3/3) ... [2025-01-10 06:55:08,883 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-nonblocking-cntr-alt.wvr.c [2025-01-10 06:55:08,897 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:55:08,898 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-nonblocking-cntr-alt.wvr.c that has 3 procedures, 31 locations, 1 initial locations, 2 loop locations, and 10 error locations. [2025-01-10 06:55:08,898 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:55:08,952 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 06:55:08,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 32 transitions, 78 flow [2025-01-10 06:55:09,017 INFO L124 PetriNetUnfolderBase]: 2/30 cut-off events. [2025-01-10 06:55:09,022 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:55:09,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 30 events. 2/30 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 65 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-01-10 06:55:09,025 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 32 transitions, 78 flow [2025-01-10 06:55:09,031 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 29 transitions, 70 flow [2025-01-10 06:55:09,044 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:55:09,053 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;@700ec042, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:55:09,055 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-01-10 06:55:09,060 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:55:09,063 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-01-10 06:55:09,063 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:55:09,063 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:09,063 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:55:09,064 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-01-10 06:55:09,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:09,068 INFO L85 PathProgramCache]: Analyzing trace with hash 265151842, now seen corresponding path program 1 times [2025-01-10 06:55:09,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:09,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637277627] [2025-01-10 06:55:09,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:09,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:09,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:55:09,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:55:09,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:09,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:09,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:09,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:09,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637277627] [2025-01-10 06:55:09,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637277627] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:55:09,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:55:09,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:55:09,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137724420] [2025-01-10 06:55:09,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:55:09,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:55:09,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:09,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:55:09,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:55:09,282 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-01-10 06:55:09,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:09,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:09,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-01-10 06:55:09,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:09,386 INFO L124 PetriNetUnfolderBase]: 143/299 cut-off events. [2025-01-10 06:55:09,387 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-10 06:55:09,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 581 conditions, 299 events. 143/299 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1253 event pairs, 49 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 514. Up to 192 conditions per place. [2025-01-10 06:55:09,391 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 27 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2025-01-10 06:55:09,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 38 transitions, 155 flow [2025-01-10 06:55:09,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:55:09,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:55:09,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-01-10 06:55:09,399 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.71875 [2025-01-10 06:55:09,400 INFO L175 Difference]: Start difference. First operand has 34 places, 29 transitions, 70 flow. Second operand 3 states and 69 transitions. [2025-01-10 06:55:09,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 38 transitions, 155 flow [2025-01-10 06:55:09,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 38 transitions, 141 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:55:09,404 INFO L231 Difference]: Finished difference. Result has 32 places, 29 transitions, 80 flow [2025-01-10 06:55:09,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=32, PETRI_TRANSITIONS=29} [2025-01-10 06:55:09,408 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2025-01-10 06:55:09,408 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 29 transitions, 80 flow [2025-01-10 06:55:09,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:09,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:09,408 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:55:09,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:55:09,408 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-01-10 06:55:09,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:09,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1407859877, now seen corresponding path program 1 times [2025-01-10 06:55:09,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:09,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113058288] [2025-01-10 06:55:09,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:09,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:09,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:55:09,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:55:09,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:09,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:09,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:09,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:09,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113058288] [2025-01-10 06:55:09,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113058288] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:55:09,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:55:09,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:55:09,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318840957] [2025-01-10 06:55:09,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:55:09,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:55:09,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:09,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:55:09,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:55:09,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-01-10 06:55:09,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:09,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:09,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-01-10 06:55:09,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:09,631 INFO L124 PetriNetUnfolderBase]: 243/471 cut-off events. [2025-01-10 06:55:09,631 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-01-10 06:55:09,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 471 events. 243/471 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2265 event pairs, 111 based on Foata normal form. 14/388 useless extension candidates. Maximal degree in co-relation 528. Up to 339 conditions per place. [2025-01-10 06:55:09,638 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 40 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2025-01-10 06:55:09,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 50 transitions, 224 flow [2025-01-10 06:55:09,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:55:09,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:55:09,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-01-10 06:55:09,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.609375 [2025-01-10 06:55:09,644 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 80 flow. Second operand 4 states and 78 transitions. [2025-01-10 06:55:09,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 50 transitions, 224 flow [2025-01-10 06:55:09,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 50 transitions, 222 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:55:09,646 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 107 flow [2025-01-10 06:55:09,646 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=107, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2025-01-10 06:55:09,647 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2025-01-10 06:55:09,647 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 107 flow [2025-01-10 06:55:09,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:09,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:09,647 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:55:09,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:55:09,648 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-01-10 06:55:09,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:09,648 INFO L85 PathProgramCache]: Analyzing trace with hash -944083017, now seen corresponding path program 1 times [2025-01-10 06:55:09,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:09,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788928791] [2025-01-10 06:55:09,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:09,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:09,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:55:09,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:55:09,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:09,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:09,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:09,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:09,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788928791] [2025-01-10 06:55:09,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788928791] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:55:09,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:55:09,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:55:09,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333313337] [2025-01-10 06:55:09,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:55:09,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:55:09,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:09,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:55:09,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:55:09,703 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-01-10 06:55:09,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:09,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:09,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-01-10 06:55:09,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:09,834 INFO L124 PetriNetUnfolderBase]: 213/476 cut-off events. [2025-01-10 06:55:09,834 INFO L125 PetriNetUnfolderBase]: For 118/122 co-relation queries the response was YES. [2025-01-10 06:55:09,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1145 conditions, 476 events. 213/476 cut-off events. For 118/122 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2283 event pairs, 51 based on Foata normal form. 4/400 useless extension candidates. Maximal degree in co-relation 365. Up to 162 conditions per place. [2025-01-10 06:55:09,840 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 40 selfloop transitions, 7 changer transitions 0/57 dead transitions. [2025-01-10 06:55:09,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 57 transitions, 276 flow [2025-01-10 06:55:09,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:55:09,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:55:09,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-01-10 06:55:09,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.71875 [2025-01-10 06:55:09,841 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 107 flow. Second operand 4 states and 92 transitions. [2025-01-10 06:55:09,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 57 transitions, 276 flow [2025-01-10 06:55:09,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 57 transitions, 272 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:55:09,843 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 168 flow [2025-01-10 06:55:09,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=168, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2025-01-10 06:55:09,843 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2025-01-10 06:55:09,843 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 168 flow [2025-01-10 06:55:09,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:09,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:09,846 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:55:09,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:55:09,846 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-01-10 06:55:09,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:09,847 INFO L85 PathProgramCache]: Analyzing trace with hash 753187738, now seen corresponding path program 1 times [2025-01-10 06:55:09,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:09,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156319507] [2025-01-10 06:55:09,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:09,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:09,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:55:09,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:55:09,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:09,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:09,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:09,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:09,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156319507] [2025-01-10 06:55:09,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156319507] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:55:09,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:55:09,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:55:09,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585141667] [2025-01-10 06:55:09,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:55:09,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:55:09,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:09,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:55:09,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:55:09,898 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-01-10 06:55:09,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:09,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:09,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-01-10 06:55:09,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:10,013 INFO L124 PetriNetUnfolderBase]: 303/614 cut-off events. [2025-01-10 06:55:10,013 INFO L125 PetriNetUnfolderBase]: For 783/828 co-relation queries the response was YES. [2025-01-10 06:55:10,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1721 conditions, 614 events. 303/614 cut-off events. For 783/828 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3205 event pairs, 158 based on Foata normal form. 22/578 useless extension candidates. Maximal degree in co-relation 881. Up to 380 conditions per place. [2025-01-10 06:55:10,017 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 42 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2025-01-10 06:55:10,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 54 transitions, 340 flow [2025-01-10 06:55:10,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:55:10,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:55:10,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-01-10 06:55:10,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6875 [2025-01-10 06:55:10,019 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 168 flow. Second operand 3 states and 66 transitions. [2025-01-10 06:55:10,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 54 transitions, 340 flow [2025-01-10 06:55:10,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 54 transitions, 340 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:55:10,024 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 186 flow [2025-01-10 06:55:10,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2025-01-10 06:55:10,026 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2025-01-10 06:55:10,026 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 186 flow [2025-01-10 06:55:10,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:10,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:10,026 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:55:10,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:55:10,026 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-01-10 06:55:10,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:10,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1198239938, now seen corresponding path program 1 times [2025-01-10 06:55:10,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:10,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602251294] [2025-01-10 06:55:10,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:10,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:10,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:55:10,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:55:10,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:10,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:10,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:10,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:10,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602251294] [2025-01-10 06:55:10,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602251294] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:55:10,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712580306] [2025-01-10 06:55:10,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:10,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:55:10,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:55:10,109 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:55:10,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 06:55:10,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:55:10,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:55:10,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:10,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:10,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:55:10,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:55:10,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:10,236 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:55:10,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712580306] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:55:10,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:55:10,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-01-10 06:55:10,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090300051] [2025-01-10 06:55:10,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:55:10,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:55:10,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:10,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:55:10,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:55:10,238 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-01-10 06:55:10,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:10,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:10,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-01-10 06:55:10,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:10,338 INFO L124 PetriNetUnfolderBase]: 359/791 cut-off events. [2025-01-10 06:55:10,339 INFO L125 PetriNetUnfolderBase]: For 1176/1190 co-relation queries the response was YES. [2025-01-10 06:55:10,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2274 conditions, 791 events. 359/791 cut-off events. For 1176/1190 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4223 event pairs, 82 based on Foata normal form. 56/777 useless extension candidates. Maximal degree in co-relation 983. Up to 330 conditions per place. [2025-01-10 06:55:10,343 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 33 selfloop transitions, 13 changer transitions 0/56 dead transitions. [2025-01-10 06:55:10,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 56 transitions, 367 flow [2025-01-10 06:55:10,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:55:10,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:55:10,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2025-01-10 06:55:10,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6171875 [2025-01-10 06:55:10,345 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 186 flow. Second operand 4 states and 79 transitions. [2025-01-10 06:55:10,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 56 transitions, 367 flow [2025-01-10 06:55:10,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 56 transitions, 348 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-01-10 06:55:10,348 INFO L231 Difference]: Finished difference. Result has 46 places, 46 transitions, 296 flow [2025-01-10 06:55:10,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=296, PETRI_PLACES=46, PETRI_TRANSITIONS=46} [2025-01-10 06:55:10,349 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 12 predicate places. [2025-01-10 06:55:10,349 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 46 transitions, 296 flow [2025-01-10 06:55:10,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:10,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:10,349 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:55:10,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 06:55:10,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:55:10,554 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-01-10 06:55:10,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:10,558 INFO L85 PathProgramCache]: Analyzing trace with hash 383224999, now seen corresponding path program 1 times [2025-01-10 06:55:10,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:10,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906717858] [2025-01-10 06:55:10,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:10,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:10,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:55:10,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:55:10,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:10,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:10,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:10,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:10,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906717858] [2025-01-10 06:55:10,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906717858] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:55:10,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142646146] [2025-01-10 06:55:10,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:10,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:55:10,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:55:10,681 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:55:10,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 06:55:10,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:55:10,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:55:10,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:10,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:10,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:55:10,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:55:10,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:10,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:55:10,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:10,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142646146] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:55:10,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:55:10,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 06:55:10,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374393641] [2025-01-10 06:55:10,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:55:10,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:55:10,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:10,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:55:10,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:55:10,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-01-10 06:55:10,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 46 transitions, 296 flow. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:10,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:10,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-01-10 06:55:10,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:11,090 INFO L124 PetriNetUnfolderBase]: 313/684 cut-off events. [2025-01-10 06:55:11,091 INFO L125 PetriNetUnfolderBase]: For 1428/1452 co-relation queries the response was YES. [2025-01-10 06:55:11,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2128 conditions, 684 events. 313/684 cut-off events. For 1428/1452 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3465 event pairs, 11 based on Foata normal form. 8/681 useless extension candidates. Maximal degree in co-relation 741. Up to 246 conditions per place. [2025-01-10 06:55:11,096 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 46 selfloop transitions, 14 changer transitions 0/70 dead transitions. [2025-01-10 06:55:11,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 70 transitions, 486 flow [2025-01-10 06:55:11,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:55:11,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:55:11,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2025-01-10 06:55:11,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-01-10 06:55:11,098 INFO L175 Difference]: Start difference. First operand has 46 places, 46 transitions, 296 flow. Second operand 7 states and 128 transitions. [2025-01-10 06:55:11,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 70 transitions, 486 flow [2025-01-10 06:55:11,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 70 transitions, 469 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-01-10 06:55:11,105 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 285 flow [2025-01-10 06:55:11,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=285, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2025-01-10 06:55:11,105 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2025-01-10 06:55:11,105 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 285 flow [2025-01-10 06:55:11,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:11,105 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:11,106 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:55:11,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 06:55:11,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:55:11,306 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-01-10 06:55:11,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:11,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1308779671, now seen corresponding path program 1 times [2025-01-10 06:55:11,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:11,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91848360] [2025-01-10 06:55:11,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:11,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:11,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:55:11,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:55:11,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:11,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:11,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:11,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:11,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91848360] [2025-01-10 06:55:11,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91848360] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:55:11,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366563866] [2025-01-10 06:55:11,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:11,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:55:11,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:55:11,465 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:55:11,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 06:55:11,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:55:11,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:55:11,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:11,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:11,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:55:11,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:55:11,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:55:11,544 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:55:11,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366563866] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:55:11,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:55:11,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2025-01-10 06:55:11,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730251367] [2025-01-10 06:55:11,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:55:11,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:55:11,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:11,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:55:11,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:55:11,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2025-01-10 06:55:11,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 285 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:11,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:11,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2025-01-10 06:55:11,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:11,634 INFO L124 PetriNetUnfolderBase]: 356/683 cut-off events. [2025-01-10 06:55:11,635 INFO L125 PetriNetUnfolderBase]: For 1493/1538 co-relation queries the response was YES. [2025-01-10 06:55:11,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2114 conditions, 683 events. 356/683 cut-off events. For 1493/1538 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3286 event pairs, 107 based on Foata normal form. 45/650 useless extension candidates. Maximal degree in co-relation 1368. Up to 319 conditions per place. [2025-01-10 06:55:11,638 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 39 selfloop transitions, 8 changer transitions 0/56 dead transitions. [2025-01-10 06:55:11,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 56 transitions, 421 flow [2025-01-10 06:55:11,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:55:11,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:55:11,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2025-01-10 06:55:11,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.53125 [2025-01-10 06:55:11,640 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 285 flow. Second operand 4 states and 68 transitions. [2025-01-10 06:55:11,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 56 transitions, 421 flow [2025-01-10 06:55:11,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 365 flow, removed 7 selfloop flow, removed 7 redundant places. [2025-01-10 06:55:11,642 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 215 flow [2025-01-10 06:55:11,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=215, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2025-01-10 06:55:11,643 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 12 predicate places. [2025-01-10 06:55:11,643 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 215 flow [2025-01-10 06:55:11,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:11,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:11,644 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:55:11,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 06:55:11,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:55:11,845 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-01-10 06:55:11,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:11,845 INFO L85 PathProgramCache]: Analyzing trace with hash -966692164, now seen corresponding path program 1 times [2025-01-10 06:55:11,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:11,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746739515] [2025-01-10 06:55:11,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:11,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:11,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:55:11,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:55:11,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:11,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:11,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:11,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:11,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746739515] [2025-01-10 06:55:11,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746739515] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:55:11,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:55:11,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:55:11,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6358403] [2025-01-10 06:55:11,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:55:11,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:55:11,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:11,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:55:11,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:55:11,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-01-10 06:55:11,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 215 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:11,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:11,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-01-10 06:55:11,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:11,958 INFO L124 PetriNetUnfolderBase]: 245/499 cut-off events. [2025-01-10 06:55:11,959 INFO L125 PetriNetUnfolderBase]: For 1085/1113 co-relation queries the response was YES. [2025-01-10 06:55:11,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1599 conditions, 499 events. 245/499 cut-off events. For 1085/1113 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2275 event pairs, 117 based on Foata normal form. 18/494 useless extension candidates. Maximal degree in co-relation 546. Up to 356 conditions per place. [2025-01-10 06:55:11,962 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 35 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2025-01-10 06:55:11,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 49 transitions, 354 flow [2025-01-10 06:55:11,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:55:11,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:55:11,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2025-01-10 06:55:11,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5390625 [2025-01-10 06:55:11,964 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 215 flow. Second operand 4 states and 69 transitions. [2025-01-10 06:55:11,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 49 transitions, 354 flow [2025-01-10 06:55:11,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 49 transitions, 340 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:55:11,966 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 209 flow [2025-01-10 06:55:11,966 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=209, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2025-01-10 06:55:11,967 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2025-01-10 06:55:11,967 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 209 flow [2025-01-10 06:55:11,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:11,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:11,967 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:55:11,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:55:11,967 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-01-10 06:55:11,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:11,967 INFO L85 PathProgramCache]: Analyzing trace with hash 457355269, now seen corresponding path program 1 times [2025-01-10 06:55:11,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:11,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127559312] [2025-01-10 06:55:11,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:11,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:11,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:55:11,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:55:11,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:11,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:12,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:12,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:12,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127559312] [2025-01-10 06:55:12,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127559312] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:55:12,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768608615] [2025-01-10 06:55:12,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:12,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:55:12,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:55:12,032 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:55:12,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 06:55:12,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:55:12,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:55:12,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:12,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:12,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:55:12,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:55:12,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:12,144 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:55:12,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768608615] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:55:12,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:55:12,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 06:55:12,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960092631] [2025-01-10 06:55:12,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:55:12,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:55:12,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:12,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:55:12,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:55:12,162 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-01-10 06:55:12,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 209 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:12,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:12,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-01-10 06:55:12,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:12,444 INFO L124 PetriNetUnfolderBase]: 330/667 cut-off events. [2025-01-10 06:55:12,444 INFO L125 PetriNetUnfolderBase]: For 1174/1193 co-relation queries the response was YES. [2025-01-10 06:55:12,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2064 conditions, 667 events. 330/667 cut-off events. For 1174/1193 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3166 event pairs, 42 based on Foata normal form. 20/659 useless extension candidates. Maximal degree in co-relation 777. Up to 208 conditions per place. [2025-01-10 06:55:12,452 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 63 selfloop transitions, 6 changer transitions 0/76 dead transitions. [2025-01-10 06:55:12,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 76 transitions, 567 flow [2025-01-10 06:55:12,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:55:12,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:55:12,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2025-01-10 06:55:12,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-01-10 06:55:12,461 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 209 flow. Second operand 6 states and 96 transitions. [2025-01-10 06:55:12,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 76 transitions, 567 flow [2025-01-10 06:55:12,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 76 transitions, 561 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:55:12,464 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 211 flow [2025-01-10 06:55:12,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=211, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2025-01-10 06:55:12,468 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2025-01-10 06:55:12,468 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 211 flow [2025-01-10 06:55:12,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:12,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:12,468 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 06:55:12,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 06:55:12,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-10 06:55:12,669 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-01-10 06:55:12,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:12,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1293111743, now seen corresponding path program 1 times [2025-01-10 06:55:12,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:12,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824010490] [2025-01-10 06:55:12,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:12,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:12,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:55:12,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:55:12,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:12,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:12,751 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:12,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:12,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824010490] [2025-01-10 06:55:12,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824010490] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:55:12,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057535429] [2025-01-10 06:55:12,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:12,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:55:12,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:55:12,757 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:55:12,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 06:55:12,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:55:12,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:55:12,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:12,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:12,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:55:12,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:55:12,827 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:12,828 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:55:12,858 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:12,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057535429] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:55:12,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:55:12,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 06:55:12,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6682510] [2025-01-10 06:55:12,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:55:12,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:55:12,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:12,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:55:12,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:55:12,872 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-01-10 06:55:12,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 211 flow. Second operand has 12 states, 12 states have (on average 9.666666666666666) internal successors, (116), 12 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:12,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:12,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-01-10 06:55:12,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:13,072 INFO L124 PetriNetUnfolderBase]: 680/1320 cut-off events. [2025-01-10 06:55:13,072 INFO L125 PetriNetUnfolderBase]: For 2744/2783 co-relation queries the response was YES. [2025-01-10 06:55:13,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4294 conditions, 1320 events. 680/1320 cut-off events. For 2744/2783 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 6617 event pairs, 109 based on Foata normal form. 60/1370 useless extension candidates. Maximal degree in co-relation 1673. Up to 464 conditions per place. [2025-01-10 06:55:13,102 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 114 selfloop transitions, 12 changer transitions 0/133 dead transitions. [2025-01-10 06:55:13,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 133 transitions, 1033 flow [2025-01-10 06:55:13,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:55:13,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:55:13,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2025-01-10 06:55:13,103 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5375 [2025-01-10 06:55:13,103 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 211 flow. Second operand 10 states and 172 transitions. [2025-01-10 06:55:13,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 133 transitions, 1033 flow [2025-01-10 06:55:13,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 133 transitions, 1006 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-01-10 06:55:13,107 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 280 flow [2025-01-10 06:55:13,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=280, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2025-01-10 06:55:13,107 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 22 predicate places. [2025-01-10 06:55:13,107 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 280 flow [2025-01-10 06:55:13,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.666666666666666) internal successors, (116), 12 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:13,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:13,108 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:55:13,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 06:55:13,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-10 06:55:13,308 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-01-10 06:55:13,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:13,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1290535799, now seen corresponding path program 1 times [2025-01-10 06:55:13,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:13,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645101979] [2025-01-10 06:55:13,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:13,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:13,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:55:13,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:55:13,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:13,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:13,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:13,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:13,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645101979] [2025-01-10 06:55:13,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645101979] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:55:13,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965416019] [2025-01-10 06:55:13,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:13,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:55:13,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:55:13,363 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:55:13,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 06:55:13,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:55:13,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:55:13,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:13,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:13,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:55:13,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:55:13,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:13,467 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:55:13,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:13,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965416019] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:55:13,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:55:13,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-01-10 06:55:13,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977560747] [2025-01-10 06:55:13,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:55:13,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:55:13,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:13,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:55:13,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:55:13,521 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-01-10 06:55:13,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 280 flow. Second operand has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 9 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:13,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:13,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-01-10 06:55:13,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:13,834 INFO L124 PetriNetUnfolderBase]: 591/1347 cut-off events. [2025-01-10 06:55:13,835 INFO L125 PetriNetUnfolderBase]: For 3656/3698 co-relation queries the response was YES. [2025-01-10 06:55:13,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4362 conditions, 1347 events. 591/1347 cut-off events. For 3656/3698 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 7528 event pairs, 49 based on Foata normal form. 212/1529 useless extension candidates. Maximal degree in co-relation 2790. Up to 253 conditions per place. [2025-01-10 06:55:13,854 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 80 selfloop transitions, 18 changer transitions 0/111 dead transitions. [2025-01-10 06:55:13,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 111 transitions, 830 flow [2025-01-10 06:55:13,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:55:13,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 06:55:13,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2025-01-10 06:55:13,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-01-10 06:55:13,855 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 280 flow. Second operand 8 states and 160 transitions. [2025-01-10 06:55:13,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 111 transitions, 830 flow [2025-01-10 06:55:13,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 111 transitions, 801 flow, removed 12 selfloop flow, removed 2 redundant places. [2025-01-10 06:55:13,864 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 423 flow [2025-01-10 06:55:13,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=423, PETRI_PLACES=63, PETRI_TRANSITIONS=56} [2025-01-10 06:55:13,865 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 29 predicate places. [2025-01-10 06:55:13,865 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 423 flow [2025-01-10 06:55:13,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 9 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:13,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:13,865 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:55:13,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 06:55:14,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-10 06:55:14,066 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-01-10 06:55:14,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:14,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1470353754, now seen corresponding path program 1 times [2025-01-10 06:55:14,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:14,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380847420] [2025-01-10 06:55:14,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:14,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:14,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:55:14,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:55:14,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:14,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:14,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:55:14,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:14,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380847420] [2025-01-10 06:55:14,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380847420] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:55:14,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:55:14,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:55:14,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335871174] [2025-01-10 06:55:14,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:55:14,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:55:14,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:14,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:55:14,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:55:14,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-01-10 06:55:14,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 423 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:14,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:14,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-01-10 06:55:14,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:14,237 INFO L124 PetriNetUnfolderBase]: 539/1196 cut-off events. [2025-01-10 06:55:14,237 INFO L125 PetriNetUnfolderBase]: For 3775/3799 co-relation queries the response was YES. [2025-01-10 06:55:14,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4346 conditions, 1196 events. 539/1196 cut-off events. For 3775/3799 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 6487 event pairs, 290 based on Foata normal form. 36/1205 useless extension candidates. Maximal degree in co-relation 3255. Up to 815 conditions per place. [2025-01-10 06:55:14,245 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 53 selfloop transitions, 8 changer transitions 0/74 dead transitions. [2025-01-10 06:55:14,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 74 transitions, 670 flow [2025-01-10 06:55:14,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:55:14,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:55:14,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2025-01-10 06:55:14,246 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.53125 [2025-01-10 06:55:14,246 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 423 flow. Second operand 4 states and 68 transitions. [2025-01-10 06:55:14,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 74 transitions, 670 flow [2025-01-10 06:55:14,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 74 transitions, 647 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-01-10 06:55:14,252 INFO L231 Difference]: Finished difference. Result has 65 places, 56 transitions, 434 flow [2025-01-10 06:55:14,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=434, PETRI_PLACES=65, PETRI_TRANSITIONS=56} [2025-01-10 06:55:14,252 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 31 predicate places. [2025-01-10 06:55:14,252 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 56 transitions, 434 flow [2025-01-10 06:55:14,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:14,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:14,253 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:55:14,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:55:14,253 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-01-10 06:55:14,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:14,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1026532044, now seen corresponding path program 1 times [2025-01-10 06:55:14,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:14,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975221265] [2025-01-10 06:55:14,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:14,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:14,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 06:55:14,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:55:14,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:14,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:14,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:55:14,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:14,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975221265] [2025-01-10 06:55:14,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975221265] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:55:14,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:55:14,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:55:14,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514870784] [2025-01-10 06:55:14,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:55:14,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:55:14,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:14,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:55:14,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:55:14,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-01-10 06:55:14,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 434 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:14,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:14,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-01-10 06:55:14,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:14,373 INFO L124 PetriNetUnfolderBase]: 539/1155 cut-off events. [2025-01-10 06:55:14,374 INFO L125 PetriNetUnfolderBase]: For 4218/4254 co-relation queries the response was YES. [2025-01-10 06:55:14,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4456 conditions, 1155 events. 539/1155 cut-off events. For 4218/4254 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 6104 event pairs, 338 based on Foata normal form. 9/1138 useless extension candidates. Maximal degree in co-relation 3363. Up to 912 conditions per place. [2025-01-10 06:55:14,381 INFO L140 encePairwiseOnDemand]: 30/32 looper letters, 43 selfloop transitions, 1 changer transitions 0/55 dead transitions. [2025-01-10 06:55:14,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 55 transitions, 520 flow [2025-01-10 06:55:14,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:55:14,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:55:14,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-01-10 06:55:14,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2025-01-10 06:55:14,382 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 434 flow. Second operand 3 states and 44 transitions. [2025-01-10 06:55:14,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 55 transitions, 520 flow [2025-01-10 06:55:14,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 55 transitions, 504 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:55:14,388 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 418 flow [2025-01-10 06:55:14,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=418, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2025-01-10 06:55:14,389 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 29 predicate places. [2025-01-10 06:55:14,389 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 418 flow [2025-01-10 06:55:14,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:14,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:14,389 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:55:14,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:55:14,389 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-01-10 06:55:14,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:14,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1757722549, now seen corresponding path program 1 times [2025-01-10 06:55:14,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:14,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345028218] [2025-01-10 06:55:14,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:14,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:14,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 06:55:14,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 06:55:14,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:14,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:14,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:55:14,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:14,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345028218] [2025-01-10 06:55:14,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345028218] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:55:14,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:55:14,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:55:14,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852879143] [2025-01-10 06:55:14,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:55:14,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:55:14,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:14,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:55:14,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:55:14,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-01-10 06:55:14,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:14,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:14,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-01-10 06:55:14,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:14,515 INFO L124 PetriNetUnfolderBase]: 539/1146 cut-off events. [2025-01-10 06:55:14,516 INFO L125 PetriNetUnfolderBase]: For 3848/3884 co-relation queries the response was YES. [2025-01-10 06:55:14,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4366 conditions, 1146 events. 539/1146 cut-off events. For 3848/3884 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 6011 event pairs, 338 based on Foata normal form. 9/1129 useless extension candidates. Maximal degree in co-relation 4343. Up to 903 conditions per place. [2025-01-10 06:55:14,522 INFO L140 encePairwiseOnDemand]: 30/32 looper letters, 36 selfloop transitions, 1 changer transitions 7/54 dead transitions. [2025-01-10 06:55:14,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 54 transitions, 502 flow [2025-01-10 06:55:14,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:55:14,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:55:14,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2025-01-10 06:55:14,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4479166666666667 [2025-01-10 06:55:14,523 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 418 flow. Second operand 3 states and 43 transitions. [2025-01-10 06:55:14,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 54 transitions, 502 flow [2025-01-10 06:55:14,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 54 transitions, 501 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:55:14,528 INFO L231 Difference]: Finished difference. Result has 63 places, 47 transitions, 389 flow [2025-01-10 06:55:14,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=389, PETRI_PLACES=63, PETRI_TRANSITIONS=47} [2025-01-10 06:55:14,529 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 29 predicate places. [2025-01-10 06:55:14,529 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 47 transitions, 389 flow [2025-01-10 06:55:14,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:14,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:14,529 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1] [2025-01-10 06:55:14,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:55:14,529 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-01-10 06:55:14,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:14,530 INFO L85 PathProgramCache]: Analyzing trace with hash -657777309, now seen corresponding path program 1 times [2025-01-10 06:55:14,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:14,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275228441] [2025-01-10 06:55:14,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:14,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:14,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 06:55:14,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 06:55:14,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:14,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:14,592 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:14,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:14,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275228441] [2025-01-10 06:55:14,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275228441] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:55:14,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27640938] [2025-01-10 06:55:14,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:14,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:55:14,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:55:14,595 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:55:14,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 06:55:14,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 06:55:14,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 06:55:14,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:14,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:14,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 06:55:14,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:55:14,670 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:14,670 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:55:14,737 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:14,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27640938] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:55:14,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:55:14,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 06:55:14,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880672443] [2025-01-10 06:55:14,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:55:14,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 06:55:14,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:14,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 06:55:14,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:55:14,739 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-01-10 06:55:14,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 47 transitions, 389 flow. Second operand has 13 states, 13 states have (on average 13.153846153846153) internal successors, (171), 13 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:14,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:14,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-01-10 06:55:14,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:14,988 INFO L124 PetriNetUnfolderBase]: 739/1895 cut-off events. [2025-01-10 06:55:14,988 INFO L125 PetriNetUnfolderBase]: For 7189/7277 co-relation queries the response was YES. [2025-01-10 06:55:14,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6985 conditions, 1895 events. 739/1895 cut-off events. For 7189/7277 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 11230 event pairs, 31 based on Foata normal form. 72/1956 useless extension candidates. Maximal degree in co-relation 6961. Up to 279 conditions per place. [2025-01-10 06:55:15,006 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 96 selfloop transitions, 53 changer transitions 0/159 dead transitions. [2025-01-10 06:55:15,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 159 transitions, 1450 flow [2025-01-10 06:55:15,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 06:55:15,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 06:55:15,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 248 transitions. [2025-01-10 06:55:15,008 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5961538461538461 [2025-01-10 06:55:15,008 INFO L175 Difference]: Start difference. First operand has 63 places, 47 transitions, 389 flow. Second operand 13 states and 248 transitions. [2025-01-10 06:55:15,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 159 transitions, 1450 flow [2025-01-10 06:55:15,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 159 transitions, 1449 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:55:15,018 INFO L231 Difference]: Finished difference. Result has 79 places, 88 transitions, 1042 flow [2025-01-10 06:55:15,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1042, PETRI_PLACES=79, PETRI_TRANSITIONS=88} [2025-01-10 06:55:15,019 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 45 predicate places. [2025-01-10 06:55:15,019 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 88 transitions, 1042 flow [2025-01-10 06:55:15,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.153846153846153) internal successors, (171), 13 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:15,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:15,019 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1] [2025-01-10 06:55:15,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 06:55:15,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:55:15,220 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-01-10 06:55:15,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:15,220 INFO L85 PathProgramCache]: Analyzing trace with hash 2092245279, now seen corresponding path program 2 times [2025-01-10 06:55:15,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:15,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301411350] [2025-01-10 06:55:15,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:55:15,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:15,226 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-10 06:55:15,229 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 28 statements. [2025-01-10 06:55:15,229 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:55:15,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:15,251 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-10 06:55:15,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:15,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301411350] [2025-01-10 06:55:15,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301411350] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:55:15,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385082018] [2025-01-10 06:55:15,252 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:55:15,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:55:15,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:55:15,256 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:55:15,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 06:55:15,285 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-10 06:55:15,290 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 28 statements. [2025-01-10 06:55:15,290 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:55:15,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:15,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:55:15,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:55:15,323 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-10 06:55:15,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:55:15,360 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-10 06:55:15,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385082018] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:55:15,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:55:15,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-01-10 06:55:15,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364886871] [2025-01-10 06:55:15,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:55:15,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:55:15,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:15,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:55:15,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:55:15,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-01-10 06:55:15,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 88 transitions, 1042 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:15,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:15,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-01-10 06:55:15,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:15,653 INFO L124 PetriNetUnfolderBase]: 1447/2792 cut-off events. [2025-01-10 06:55:15,653 INFO L125 PetriNetUnfolderBase]: For 16628/16719 co-relation queries the response was YES. [2025-01-10 06:55:15,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11629 conditions, 2792 events. 1447/2792 cut-off events. For 16628/16719 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 13867 event pairs, 239 based on Foata normal form. 136/2926 useless extension candidates. Maximal degree in co-relation 11595. Up to 1206 conditions per place. [2025-01-10 06:55:15,670 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 151 selfloop transitions, 13 changer transitions 0/167 dead transitions. [2025-01-10 06:55:15,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 167 transitions, 2478 flow [2025-01-10 06:55:15,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:55:15,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:55:15,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2025-01-10 06:55:15,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39375 [2025-01-10 06:55:15,671 INFO L175 Difference]: Start difference. First operand has 79 places, 88 transitions, 1042 flow. Second operand 5 states and 63 transitions. [2025-01-10 06:55:15,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 167 transitions, 2478 flow [2025-01-10 06:55:15,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 167 transitions, 2390 flow, removed 35 selfloop flow, removed 5 redundant places. [2025-01-10 06:55:15,689 INFO L231 Difference]: Finished difference. Result has 78 places, 88 transitions, 1024 flow [2025-01-10 06:55:15,689 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=986, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1024, PETRI_PLACES=78, PETRI_TRANSITIONS=88} [2025-01-10 06:55:15,689 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 44 predicate places. [2025-01-10 06:55:15,689 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 88 transitions, 1024 flow [2025-01-10 06:55:15,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:15,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:15,690 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1] [2025-01-10 06:55:15,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 06:55:15,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-10 06:55:15,891 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-01-10 06:55:15,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:15,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1768452451, now seen corresponding path program 2 times [2025-01-10 06:55:15,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:15,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459743335] [2025-01-10 06:55:15,892 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:55:15,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:15,901 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-01-10 06:55:15,912 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 06:55:15,913 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:55:15,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:16,088 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:16,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:16,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459743335] [2025-01-10 06:55:16,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459743335] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:55:16,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64693495] [2025-01-10 06:55:16,088 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:55:16,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:55:16,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:55:16,090 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:55:16,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 06:55:16,117 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-01-10 06:55:16,131 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 06:55:16,131 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:55:16,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:16,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 06:55:16,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:55:16,219 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:16,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:55:16,499 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:16,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64693495] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:55:16,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:55:16,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-01-10 06:55:16,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585735314] [2025-01-10 06:55:16,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:55:16,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-10 06:55:16,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:16,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-10 06:55:16,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-01-10 06:55:16,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-01-10 06:55:16,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 88 transitions, 1024 flow. Second operand has 25 states, 25 states have (on average 13.08) internal successors, (327), 25 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:16,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:16,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-01-10 06:55:16,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:17,221 INFO L124 PetriNetUnfolderBase]: 1903/4631 cut-off events. [2025-01-10 06:55:17,222 INFO L125 PetriNetUnfolderBase]: For 39272/39528 co-relation queries the response was YES. [2025-01-10 06:55:17,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19340 conditions, 4631 events. 1903/4631 cut-off events. For 39272/39528 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 27668 event pairs, 73 based on Foata normal form. 156/4774 useless extension candidates. Maximal degree in co-relation 19308. Up to 911 conditions per place. [2025-01-10 06:55:17,249 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 170 selfloop transitions, 225 changer transitions 0/405 dead transitions. [2025-01-10 06:55:17,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 405 transitions, 4678 flow [2025-01-10 06:55:17,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-10 06:55:17,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-01-10 06:55:17,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 488 transitions. [2025-01-10 06:55:17,251 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.61 [2025-01-10 06:55:17,251 INFO L175 Difference]: Start difference. First operand has 78 places, 88 transitions, 1024 flow. Second operand 25 states and 488 transitions. [2025-01-10 06:55:17,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 405 transitions, 4678 flow [2025-01-10 06:55:17,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 405 transitions, 4628 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:55:17,279 INFO L231 Difference]: Finished difference. Result has 120 places, 262 transitions, 4088 flow [2025-01-10 06:55:17,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1006, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=4088, PETRI_PLACES=120, PETRI_TRANSITIONS=262} [2025-01-10 06:55:17,279 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 86 predicate places. [2025-01-10 06:55:17,280 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 262 transitions, 4088 flow [2025-01-10 06:55:17,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 13.08) internal successors, (327), 25 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:17,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:17,280 INFO L206 CegarLoopForPetriNet]: trace histogram [23, 22, 22, 22, 22, 1, 1, 1, 1] [2025-01-10 06:55:17,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 06:55:17,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:55:17,481 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-01-10 06:55:17,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:17,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1027466909, now seen corresponding path program 3 times [2025-01-10 06:55:17,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:17,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583329403] [2025-01-10 06:55:17,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:55:17,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:17,489 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 115 statements into 23 equivalence classes. [2025-01-10 06:55:17,531 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) and asserted 115 of 115 statements. [2025-01-10 06:55:17,531 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2025-01-10 06:55:17,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:18,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:18,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:18,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583329403] [2025-01-10 06:55:18,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583329403] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:55:18,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925084688] [2025-01-10 06:55:18,194 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:55:18,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:55:18,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:55:18,196 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:55:18,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 06:55:18,229 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 115 statements into 23 equivalence classes. [2025-01-10 06:55:18,265 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) and asserted 115 of 115 statements. [2025-01-10 06:55:18,265 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2025-01-10 06:55:18,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:18,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-10 06:55:18,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:55:18,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:18,400 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:55:19,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:19,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925084688] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:55:19,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:55:19,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 47 [2025-01-10 06:55:19,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769467295] [2025-01-10 06:55:19,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:55:19,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-01-10 06:55:19,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:19,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-01-10 06:55:19,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-01-10 06:55:19,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-01-10 06:55:19,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 262 transitions, 4088 flow. Second operand has 49 states, 49 states have (on average 13.040816326530612) internal successors, (639), 49 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:19,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:19,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-01-10 06:55:19,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:22,597 INFO L124 PetriNetUnfolderBase]: 5995/14391 cut-off events. [2025-01-10 06:55:22,598 INFO L125 PetriNetUnfolderBase]: For 294752/295672 co-relation queries the response was YES. [2025-01-10 06:55:22,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63528 conditions, 14391 events. 5995/14391 cut-off events. For 294752/295672 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 97948 event pairs, 341 based on Foata normal form. 324/14702 useless extension candidates. Maximal degree in co-relation 63474. Up to 3223 conditions per place. [2025-01-10 06:55:22,694 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 316 selfloop transitions, 865 changer transitions 0/1191 dead transitions. [2025-01-10 06:55:22,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 1191 transitions, 17436 flow [2025-01-10 06:55:22,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-01-10 06:55:22,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2025-01-10 06:55:22,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 968 transitions. [2025-01-10 06:55:22,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6173469387755102 [2025-01-10 06:55:22,699 INFO L175 Difference]: Start difference. First operand has 120 places, 262 transitions, 4088 flow. Second operand 49 states and 968 transitions. [2025-01-10 06:55:22,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 1191 transitions, 17436 flow [2025-01-10 06:55:22,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 1191 transitions, 15648 flow, removed 866 selfloop flow, removed 5 redundant places. [2025-01-10 06:55:22,884 INFO L231 Difference]: Finished difference. Result has 208 places, 904 transitions, 15465 flow [2025-01-10 06:55:22,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3848, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=233, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=15465, PETRI_PLACES=208, PETRI_TRANSITIONS=904} [2025-01-10 06:55:22,886 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 174 predicate places. [2025-01-10 06:55:22,886 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 904 transitions, 15465 flow [2025-01-10 06:55:22,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 13.040816326530612) internal successors, (639), 49 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:22,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:22,887 INFO L206 CegarLoopForPetriNet]: trace histogram [47, 46, 46, 46, 46, 1, 1, 1, 1] [2025-01-10 06:55:22,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 06:55:23,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 06:55:23,091 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-01-10 06:55:23,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:23,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1492216163, now seen corresponding path program 4 times [2025-01-10 06:55:23,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:23,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860007412] [2025-01-10 06:55:23,092 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 06:55:23,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:23,108 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 235 statements into 2 equivalence classes. [2025-01-10 06:55:23,150 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 235 of 235 statements. [2025-01-10 06:55:23,150 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 06:55:23,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:24,628 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:24,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:24,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860007412] [2025-01-10 06:55:24,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860007412] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:55:24,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689528988] [2025-01-10 06:55:24,629 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 06:55:24,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:55:24,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:55:24,634 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:55:24,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 06:55:24,695 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 235 statements into 2 equivalence classes. [2025-01-10 06:55:24,746 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 235 of 235 statements. [2025-01-10 06:55:24,747 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 06:55:24,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:24,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-01-10 06:55:24,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:55:25,108 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:25,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:55:27,859 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:27,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689528988] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:55:27,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:55:27,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 95 [2025-01-10 06:55:27,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533342921] [2025-01-10 06:55:27,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:55:27,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2025-01-10 06:55:27,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:27,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2025-01-10 06:55:27,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2025-01-10 06:55:27,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-01-10 06:55:27,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 904 transitions, 15465 flow. Second operand has 97 states, 97 states have (on average 13.02061855670103) internal successors, (1263), 97 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:27,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:27,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-01-10 06:55:27,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:47,487 INFO L124 PetriNetUnfolderBase]: 21127/50119 cut-off events. [2025-01-10 06:55:47,487 INFO L125 PetriNetUnfolderBase]: For 2278600/2282008 co-relation queries the response was YES. [2025-01-10 06:55:48,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225624 conditions, 50119 events. 21127/50119 cut-off events. For 2278600/2282008 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 395899 event pairs, 1497 based on Foata normal form. 660/50766 useless extension candidates. Maximal degree in co-relation 225528. Up to 11095 conditions per place. [2025-01-10 06:55:48,536 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 606 selfloop transitions, 3305 changer transitions 0/3921 dead transitions. [2025-01-10 06:55:48,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 3921 transitions, 63157 flow [2025-01-10 06:55:48,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2025-01-10 06:55:48,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2025-01-10 06:55:48,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 1928 transitions. [2025-01-10 06:55:48,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6211340206185567 [2025-01-10 06:55:48,542 INFO L175 Difference]: Start difference. First operand has 208 places, 904 transitions, 15465 flow. Second operand 97 states and 1928 transitions. [2025-01-10 06:55:48,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 3921 transitions, 63157 flow [2025-01-10 06:55:50,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 3921 transitions, 56472 flow, removed 3176 selfloop flow, removed 11 redundant places. [2025-01-10 06:55:50,089 INFO L231 Difference]: Finished difference. Result has 386 places, 3346 transitions, 59334 flow [2025-01-10 06:55:50,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=14768, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=904, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=873, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=97, PETRI_FLOW=59334, PETRI_PLACES=386, PETRI_TRANSITIONS=3346} [2025-01-10 06:55:50,090 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 352 predicate places. [2025-01-10 06:55:50,090 INFO L471 AbstractCegarLoop]: Abstraction has has 386 places, 3346 transitions, 59334 flow [2025-01-10 06:55:50,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 13.02061855670103) internal successors, (1263), 97 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:50,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:50,091 INFO L206 CegarLoopForPetriNet]: trace histogram [95, 94, 94, 94, 94, 1, 1, 1, 1] [2025-01-10 06:55:50,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-10 06:55:50,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:55:50,295 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-01-10 06:55:50,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:50,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1421866653, now seen corresponding path program 5 times [2025-01-10 06:55:50,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:50,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100805807] [2025-01-10 06:55:50,300 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 06:55:50,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:50,321 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 475 statements into 95 equivalence classes. [2025-01-10 06:55:50,649 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 95 check-sat command(s) and asserted 475 of 475 statements. [2025-01-10 06:55:50,650 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 95 check-sat command(s) [2025-01-10 06:55:50,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:56,125 INFO L134 CoverageAnalysis]: Checked inductivity of 22043 backedges. 0 proven. 22043 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:56,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:56,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100805807] [2025-01-10 06:55:56,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100805807] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:55:56,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092717715] [2025-01-10 06:55:56,126 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 06:55:56,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:55:56,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:55:56,129 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:55:56,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 06:55:56,189 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 475 statements into 95 equivalence classes. [2025-01-10 06:55:56,457 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 95 check-sat command(s) and asserted 475 of 475 statements. [2025-01-10 06:55:56,457 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 95 check-sat command(s) [2025-01-10 06:55:56,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:56,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 1083 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-01-10 06:55:56,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:55:57,027 INFO L134 CoverageAnalysis]: Checked inductivity of 22043 backedges. 0 proven. 22043 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:57,027 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:56:05,768 INFO L134 CoverageAnalysis]: Checked inductivity of 22043 backedges. 0 proven. 22043 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:56:05,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092717715] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:56:05,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:56:05,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 190 [2025-01-10 06:56:05,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523122768] [2025-01-10 06:56:05,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:56:05,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2025-01-10 06:56:05,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:56:05,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-01-10 06:56:05,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-01-10 06:56:05,789 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-01-10 06:56:05,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 3346 transitions, 59334 flow. Second operand has 192 states, 192 states have (on average 13.0) internal successors, (2496), 192 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:56:05,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:56:05,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-01-10 06:56:05,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand