./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-word-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-word-symm.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf81f7b3bd1ceac2bf46c7c37f69effc0af9de17b18c7565156301fb49a6164e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:39:28,218 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:39:28,263 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 06:39:28,267 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:39:28,268 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:39:28,285 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:39:28,286 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:39:28,286 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:39:28,286 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:39:28,286 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:39:28,286 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 06:39:28,286 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 06:39:28,287 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:39:28,287 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:39:28,287 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:39:28,287 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:39:28,287 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 06:39:28,287 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:39:28,287 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:39:28,287 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:39:28,288 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:39:28,288 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 06:39:28,288 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 06:39:28,288 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 06:39:28,288 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 06:39:28,288 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:39:28,288 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:39:28,288 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:39:28,288 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:39:28,288 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:39:28,288 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:39:28,288 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:39:28,289 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 06:39:28,289 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 06:39:28,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:39:28,289 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:39:28,289 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 06:39:28,289 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 06:39:28,289 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 06:39:28,289 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:39:28,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 06:39:28,289 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 06:39:28,289 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 06:39:28,289 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 06:39:28,289 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 06:39:28,289 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bf81f7b3bd1ceac2bf46c7c37f69effc0af9de17b18c7565156301fb49a6164e [2025-03-09 06:39:28,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:39:28,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:39:28,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:39:28,514 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:39:28,514 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:39:28,515 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-word-symm.wvr.c [2025-03-09 06:39:29,671 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/469aae7cd/37ae34c196e246c1a604fc623f574f3a/FLAG917946914 [2025-03-09 06:39:29,977 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:39:29,978 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-symm.wvr.c [2025-03-09 06:39:29,986 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/469aae7cd/37ae34c196e246c1a604fc623f574f3a/FLAG917946914 [2025-03-09 06:39:30,249 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/469aae7cd/37ae34c196e246c1a604fc623f574f3a [2025-03-09 06:39:30,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:39:30,253 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:39:30,254 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:39:30,254 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:39:30,257 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:39:30,257 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:39:30" (1/1) ... [2025-03-09 06:39:30,258 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25aa5fc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:39:30, skipping insertion in model container [2025-03-09 06:39:30,258 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:39:30" (1/1) ... [2025-03-09 06:39:30,271 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:39:30,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:39:30,411 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:39:30,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:39:30,451 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:39:30,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:39:30 WrapperNode [2025-03-09 06:39:30,452 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:39:30,453 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:39:30,453 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:39:30,454 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:39:30,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:39:30" (1/1) ... [2025-03-09 06:39:30,467 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:39:30" (1/1) ... [2025-03-09 06:39:30,484 INFO L138 Inliner]: procedures = 23, calls = 26, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 123 [2025-03-09 06:39:30,487 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:39:30,487 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:39:30,488 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:39:30,488 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:39:30,494 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:39:30" (1/1) ... [2025-03-09 06:39:30,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:39:30" (1/1) ... [2025-03-09 06:39:30,498 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:39:30" (1/1) ... [2025-03-09 06:39:30,513 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-09 06:39:30,517 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:39:30" (1/1) ... [2025-03-09 06:39:30,518 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:39:30" (1/1) ... [2025-03-09 06:39:30,526 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:39:30" (1/1) ... [2025-03-09 06:39:30,527 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:39:30" (1/1) ... [2025-03-09 06:39:30,528 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:39:30" (1/1) ... [2025-03-09 06:39:30,529 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:39:30" (1/1) ... [2025-03-09 06:39:30,532 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:39:30,537 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:39:30,537 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:39:30,537 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:39:30,538 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:39:30" (1/1) ... [2025-03-09 06:39:30,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:39:30,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:39:30,566 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 06:39:30,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 06:39:30,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:39:30,586 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 06:39:30,586 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 06:39:30,586 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 06:39:30,586 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 06:39:30,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:39:30,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 06:39:30,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:39:30,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 06:39:30,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 06:39:30,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:39:30,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:39:30,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:39:30,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:39:30,589 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 06:39:30,667 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:39:30,668 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:39:30,970 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 06:39:30,970 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:39:31,110 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:39:31,110 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:39:31,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:39:31 BoogieIcfgContainer [2025-03-09 06:39:31,111 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:39:31,112 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 06:39:31,113 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 06:39:31,116 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 06:39:31,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:39:30" (1/3) ... [2025-03-09 06:39:31,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4498ac87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:39:31, skipping insertion in model container [2025-03-09 06:39:31,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:39:30" (2/3) ... [2025-03-09 06:39:31,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4498ac87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:39:31, skipping insertion in model container [2025-03-09 06:39:31,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:39:31" (3/3) ... [2025-03-09 06:39:31,119 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-word-symm.wvr.c [2025-03-09 06:39:31,130 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 06:39:31,131 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-word-symm.wvr.c that has 3 procedures, 51 locations, 1 initial locations, 4 loop locations, and 12 error locations. [2025-03-09 06:39:31,132 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 06:39:31,176 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 06:39:31,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 60 transitions, 134 flow [2025-03-09 06:39:31,233 INFO L124 PetriNetUnfolderBase]: 10/58 cut-off events. [2025-03-09 06:39:31,235 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 06:39:31,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 58 events. 10/58 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 160 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 3 conditions per place. [2025-03-09 06:39:31,239 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 60 transitions, 134 flow [2025-03-09 06:39:31,243 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 56 transitions, 121 flow [2025-03-09 06:39:31,252 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:39:31,262 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;@3f550df8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:39:31,263 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-09 06:39:31,267 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:39:31,267 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-09 06:39:31,267 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:39:31,267 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:31,267 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 06:39:31,268 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 06:39:31,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:31,272 INFO L85 PathProgramCache]: Analyzing trace with hash 500698, now seen corresponding path program 1 times [2025-03-09 06:39:31,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:31,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679627049] [2025-03-09 06:39:31,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:31,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:31,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:39:31,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:39:31,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:31,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:31,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:39:31,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:31,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679627049] [2025-03-09 06:39:31,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679627049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:39:31,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:39:31,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:39:31,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183624563] [2025-03-09 06:39:31,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:39:31,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:39:31,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:31,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:39:31,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:39:31,572 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-03-09 06:39:31,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 56 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:31,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:31,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-03-09 06:39:31,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:31,801 INFO L124 PetriNetUnfolderBase]: 291/673 cut-off events. [2025-03-09 06:39:31,801 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-09 06:39:31,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1114 conditions, 673 events. 291/673 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3756 event pairs, 157 based on Foata normal form. 2/493 useless extension candidates. Maximal degree in co-relation 1021. Up to 410 conditions per place. [2025-03-09 06:39:31,809 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 33 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2025-03-09 06:39:31,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 62 transitions, 213 flow [2025-03-09 06:39:31,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:39:31,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:39:31,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2025-03-09 06:39:31,821 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-09 06:39:31,822 INFO L175 Difference]: Start difference. First operand has 53 places, 56 transitions, 121 flow. Second operand 4 states and 140 transitions. [2025-03-09 06:39:31,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 62 transitions, 213 flow [2025-03-09 06:39:31,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 62 transitions, 208 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 06:39:31,828 INFO L231 Difference]: Finished difference. Result has 56 places, 62 transitions, 176 flow [2025-03-09 06:39:31,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=56, PETRI_TRANSITIONS=62} [2025-03-09 06:39:31,834 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2025-03-09 06:39:31,834 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 62 transitions, 176 flow [2025-03-09 06:39:31,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:31,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:31,835 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-09 06:39:31,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 06:39:31,835 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 06:39:31,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:31,837 INFO L85 PathProgramCache]: Analyzing trace with hash 2031821814, now seen corresponding path program 1 times [2025-03-09 06:39:31,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:31,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631237639] [2025-03-09 06:39:31,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:31,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:31,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:39:31,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:39:31,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:31,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:31,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:39:31,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:31,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631237639] [2025-03-09 06:39:31,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631237639] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:39:31,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36321073] [2025-03-09 06:39:31,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:31,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:39:31,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:39:31,955 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:39:31,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 06:39:31,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:39:32,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:39:32,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:32,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:32,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:39:32,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:39:32,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:39:32,050 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:39:32,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36321073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:39:32,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:39:32,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-09 06:39:32,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774135492] [2025-03-09 06:39:32,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:39:32,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:39:32,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:32,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:39:32,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:39:32,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-03-09 06:39:32,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 62 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:32,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:32,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-03-09 06:39:32,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:32,241 INFO L124 PetriNetUnfolderBase]: 291/671 cut-off events. [2025-03-09 06:39:32,241 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-09 06:39:32,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1125 conditions, 671 events. 291/671 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3736 event pairs, 157 based on Foata normal form. 2/494 useless extension candidates. Maximal degree in co-relation 1075. Up to 400 conditions per place. [2025-03-09 06:39:32,247 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 26 selfloop transitions, 12 changer transitions 0/60 dead transitions. [2025-03-09 06:39:32,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 60 transitions, 244 flow [2025-03-09 06:39:32,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:39:32,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:39:32,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 184 transitions. [2025-03-09 06:39:32,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2025-03-09 06:39:32,273 INFO L175 Difference]: Start difference. First operand has 56 places, 62 transitions, 176 flow. Second operand 6 states and 184 transitions. [2025-03-09 06:39:32,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 60 transitions, 244 flow [2025-03-09 06:39:32,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 60 transitions, 244 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 06:39:32,275 INFO L231 Difference]: Finished difference. Result has 59 places, 60 transitions, 192 flow [2025-03-09 06:39:32,276 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=59, PETRI_TRANSITIONS=60} [2025-03-09 06:39:32,276 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 6 predicate places. [2025-03-09 06:39:32,276 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 60 transitions, 192 flow [2025-03-09 06:39:32,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:32,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:32,276 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-09 06:39:32,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 06:39:32,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:39:32,477 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 06:39:32,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:32,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1438032776, now seen corresponding path program 1 times [2025-03-09 06:39:32,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:32,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121585623] [2025-03-09 06:39:32,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:32,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:32,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:39:32,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:39:32,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:32,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:32,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:39:32,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:32,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121585623] [2025-03-09 06:39:32,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121585623] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:39:32,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057114656] [2025-03-09 06:39:32,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:32,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:39:32,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:39:32,602 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:39:32,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 06:39:32,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:39:32,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:39:32,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:32,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:32,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:39:32,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:39:32,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:39:32,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:39:32,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:39:32,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057114656] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:39:32,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:39:32,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-09 06:39:32,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670439885] [2025-03-09 06:39:32,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:39:32,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 06:39:32,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:32,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 06:39:32,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-09 06:39:32,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-03-09 06:39:32,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 60 transitions, 192 flow. Second operand has 12 states, 12 states have (on average 25.083333333333332) internal successors, (301), 12 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:32,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:32,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-03-09 06:39:32,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:32,901 INFO L124 PetriNetUnfolderBase]: 297/695 cut-off events. [2025-03-09 06:39:32,904 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-03-09 06:39:32,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1219 conditions, 695 events. 297/695 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3959 event pairs, 157 based on Foata normal form. 6/521 useless extension candidates. Maximal degree in co-relation 1077. Up to 411 conditions per place. [2025-03-09 06:39:32,912 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 31 selfloop transitions, 25 changer transitions 0/78 dead transitions. [2025-03-09 06:39:32,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 78 transitions, 418 flow [2025-03-09 06:39:32,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 06:39:32,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 06:39:32,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 302 transitions. [2025-03-09 06:39:32,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5033333333333333 [2025-03-09 06:39:32,917 INFO L175 Difference]: Start difference. First operand has 59 places, 60 transitions, 192 flow. Second operand 10 states and 302 transitions. [2025-03-09 06:39:32,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 78 transitions, 418 flow [2025-03-09 06:39:32,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 78 transitions, 360 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-03-09 06:39:32,924 INFO L231 Difference]: Finished difference. Result has 66 places, 78 transitions, 332 flow [2025-03-09 06:39:32,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=332, PETRI_PLACES=66, PETRI_TRANSITIONS=78} [2025-03-09 06:39:32,924 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 13 predicate places. [2025-03-09 06:39:32,924 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 78 transitions, 332 flow [2025-03-09 06:39:32,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 25.083333333333332) internal successors, (301), 12 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:32,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:32,925 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:39:32,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 06:39:33,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-09 06:39:33,127 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 06:39:33,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:33,127 INFO L85 PathProgramCache]: Analyzing trace with hash -912270853, now seen corresponding path program 1 times [2025-03-09 06:39:33,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:33,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348560275] [2025-03-09 06:39:33,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:33,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:33,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:39:33,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:39:33,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:33,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:33,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:39:33,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:33,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348560275] [2025-03-09 06:39:33,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348560275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:39:33,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:39:33,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:39:33,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605602036] [2025-03-09 06:39:33,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:39:33,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:39:33,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:33,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:39:33,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:39:33,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 60 [2025-03-09 06:39:33,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 78 transitions, 332 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:33,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:33,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 60 [2025-03-09 06:39:33,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:33,346 INFO L124 PetriNetUnfolderBase]: 513/1003 cut-off events. [2025-03-09 06:39:33,346 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-03-09 06:39:33,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 1003 events. 513/1003 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5124 event pairs, 233 based on Foata normal form. 18/806 useless extension candidates. Maximal degree in co-relation 1814. Up to 597 conditions per place. [2025-03-09 06:39:33,351 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 82 selfloop transitions, 4 changer transitions 0/107 dead transitions. [2025-03-09 06:39:33,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 107 transitions, 566 flow [2025-03-09 06:39:33,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:39:33,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:39:33,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 164 transitions. [2025-03-09 06:39:33,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2025-03-09 06:39:33,352 INFO L175 Difference]: Start difference. First operand has 66 places, 78 transitions, 332 flow. Second operand 4 states and 164 transitions. [2025-03-09 06:39:33,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 107 transitions, 566 flow [2025-03-09 06:39:33,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 107 transitions, 542 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-09 06:39:33,355 INFO L231 Difference]: Finished difference. Result has 69 places, 81 transitions, 337 flow [2025-03-09 06:39:33,358 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=337, PETRI_PLACES=69, PETRI_TRANSITIONS=81} [2025-03-09 06:39:33,359 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 16 predicate places. [2025-03-09 06:39:33,359 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 81 transitions, 337 flow [2025-03-09 06:39:33,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:33,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:33,360 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:39:33,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 06:39:33,360 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 06:39:33,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:33,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1784343332, now seen corresponding path program 1 times [2025-03-09 06:39:33,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:33,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682416945] [2025-03-09 06:39:33,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:33,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:33,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:39:33,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:39:33,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:33,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:33,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:39:33,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:33,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682416945] [2025-03-09 06:39:33,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682416945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:39:33,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:39:33,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:39:33,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681854380] [2025-03-09 06:39:33,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:39:33,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:39:33,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:33,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:39:33,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:39:33,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-03-09 06:39:33,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 81 transitions, 337 flow. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:33,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:33,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-03-09 06:39:33,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:33,772 INFO L124 PetriNetUnfolderBase]: 1170/2280 cut-off events. [2025-03-09 06:39:33,772 INFO L125 PetriNetUnfolderBase]: For 341/341 co-relation queries the response was YES. [2025-03-09 06:39:33,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4406 conditions, 2280 events. 1170/2280 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 14186 event pairs, 586 based on Foata normal form. 26/1847 useless extension candidates. Maximal degree in co-relation 4339. Up to 812 conditions per place. [2025-03-09 06:39:33,789 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 77 selfloop transitions, 10 changer transitions 0/108 dead transitions. [2025-03-09 06:39:33,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 108 transitions, 583 flow [2025-03-09 06:39:33,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:39:33,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:39:33,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 184 transitions. [2025-03-09 06:39:33,791 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6133333333333333 [2025-03-09 06:39:33,791 INFO L175 Difference]: Start difference. First operand has 69 places, 81 transitions, 337 flow. Second operand 5 states and 184 transitions. [2025-03-09 06:39:33,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 108 transitions, 583 flow [2025-03-09 06:39:33,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 108 transitions, 578 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:39:33,798 INFO L231 Difference]: Finished difference. Result has 74 places, 83 transitions, 373 flow [2025-03-09 06:39:33,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=373, PETRI_PLACES=74, PETRI_TRANSITIONS=83} [2025-03-09 06:39:33,799 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 21 predicate places. [2025-03-09 06:39:33,800 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 83 transitions, 373 flow [2025-03-09 06:39:33,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:33,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:33,800 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:39:33,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 06:39:33,800 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 06:39:33,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:33,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1045678684, now seen corresponding path program 1 times [2025-03-09 06:39:33,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:33,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759169111] [2025-03-09 06:39:33,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:33,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:33,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:39:33,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:39:33,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:33,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:33,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:39:33,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:33,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759169111] [2025-03-09 06:39:33,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759169111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:39:33,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:39:33,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:39:33,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992415968] [2025-03-09 06:39:33,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:39:33,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:39:33,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:33,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:39:33,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:39:33,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 60 [2025-03-09 06:39:33,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 83 transitions, 373 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:33,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:33,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 60 [2025-03-09 06:39:33,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:34,088 INFO L124 PetriNetUnfolderBase]: 1521/2801 cut-off events. [2025-03-09 06:39:34,088 INFO L125 PetriNetUnfolderBase]: For 471/515 co-relation queries the response was YES. [2025-03-09 06:39:34,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5668 conditions, 2801 events. 1521/2801 cut-off events. For 471/515 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 16511 event pairs, 686 based on Foata normal form. 50/2501 useless extension candidates. Maximal degree in co-relation 5599. Up to 1646 conditions per place. [2025-03-09 06:39:34,103 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 86 selfloop transitions, 4 changer transitions 0/114 dead transitions. [2025-03-09 06:39:34,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 114 transitions, 641 flow [2025-03-09 06:39:34,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:39:34,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:39:34,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 162 transitions. [2025-03-09 06:39:34,104 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.675 [2025-03-09 06:39:34,104 INFO L175 Difference]: Start difference. First operand has 74 places, 83 transitions, 373 flow. Second operand 4 states and 162 transitions. [2025-03-09 06:39:34,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 114 transitions, 641 flow [2025-03-09 06:39:34,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 114 transitions, 635 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:39:34,109 INFO L231 Difference]: Finished difference. Result has 78 places, 86 transitions, 396 flow [2025-03-09 06:39:34,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=396, PETRI_PLACES=78, PETRI_TRANSITIONS=86} [2025-03-09 06:39:34,109 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 25 predicate places. [2025-03-09 06:39:34,109 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 86 transitions, 396 flow [2025-03-09 06:39:34,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:34,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:34,110 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:39:34,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 06:39:34,110 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 06:39:34,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:34,110 INFO L85 PathProgramCache]: Analyzing trace with hash -519931075, now seen corresponding path program 1 times [2025-03-09 06:39:34,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:34,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963003833] [2025-03-09 06:39:34,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:34,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:34,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:39:34,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:39:34,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:34,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:34,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:39:34,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:34,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963003833] [2025-03-09 06:39:34,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963003833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:39:34,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:39:34,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:39:34,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959149731] [2025-03-09 06:39:34,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:39:34,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:39:34,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:34,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:39:34,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:39:34,212 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-03-09 06:39:34,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 86 transitions, 396 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:34,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:34,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-03-09 06:39:34,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:34,613 INFO L124 PetriNetUnfolderBase]: 2916/5586 cut-off events. [2025-03-09 06:39:34,613 INFO L125 PetriNetUnfolderBase]: For 2286/2294 co-relation queries the response was YES. [2025-03-09 06:39:34,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12234 conditions, 5586 events. 2916/5586 cut-off events. For 2286/2294 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 39371 event pairs, 1502 based on Foata normal form. 130/5303 useless extension candidates. Maximal degree in co-relation 12134. Up to 1930 conditions per place. [2025-03-09 06:39:34,642 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 103 selfloop transitions, 5 changer transitions 0/130 dead transitions. [2025-03-09 06:39:34,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 130 transitions, 803 flow [2025-03-09 06:39:34,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:39:34,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:39:34,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2025-03-09 06:39:34,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6791666666666667 [2025-03-09 06:39:34,646 INFO L175 Difference]: Start difference. First operand has 78 places, 86 transitions, 396 flow. Second operand 4 states and 163 transitions. [2025-03-09 06:39:34,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 130 transitions, 803 flow [2025-03-09 06:39:34,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 130 transitions, 798 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:39:34,655 INFO L231 Difference]: Finished difference. Result has 82 places, 88 transitions, 430 flow [2025-03-09 06:39:34,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=430, PETRI_PLACES=82, PETRI_TRANSITIONS=88} [2025-03-09 06:39:34,658 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 29 predicate places. [2025-03-09 06:39:34,658 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 88 transitions, 430 flow [2025-03-09 06:39:34,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:34,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:34,658 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:39:34,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 06:39:34,658 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 06:39:34,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:34,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1906617430, now seen corresponding path program 1 times [2025-03-09 06:39:34,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:34,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049144204] [2025-03-09 06:39:34,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:34,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:34,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:39:34,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:39:34,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:34,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:34,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:39:34,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:34,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049144204] [2025-03-09 06:39:34,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049144204] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:39:34,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479662752] [2025-03-09 06:39:34,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:34,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:39:34,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:39:34,765 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:39:34,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 06:39:34,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:39:34,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:39:34,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:34,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:34,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:39:34,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:39:34,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:39:34,888 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:39:34,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479662752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:39:34,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:39:34,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2025-03-09 06:39:34,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101902250] [2025-03-09 06:39:34,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:39:34,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:39:34,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:34,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:39:34,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:39:34,897 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-03-09 06:39:34,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 88 transitions, 430 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:34,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:34,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-03-09 06:39:34,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:35,166 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([528] L77-2-->thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ v_~n2~0_14 2147483648) v_~n1~0_14) InVars {~n2~0=v_~n2~0_14, ~n1~0=v_~n1~0_14} OutVars{~n2~0=v_~n2~0_14, ~n1~0=v_~n1~0_14} AuxVars[] AssignedVars[][72], [Black: 157#(= thread1Thread1of1ForFork1_~i~0 0), Black: 160#(and (= |thread1Thread1of1ForFork1_#t~post5| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 65#(and (= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 14#thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 163#true, 52#thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 167#(<= ~n2~0 ~n1~0), Black: 172#(= thread2Thread1of1ForFork0_~i~1 0), Black: 175#(and (= |thread2Thread1of1ForFork0_#t~post10| 0) (= thread2Thread1of1ForFork0_~i~1 0)), 194#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), Black: 181#(<= ~n1~0 ~n2~0), 96#true, Black: 147#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), Black: 149#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483645) (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483645)), Black: 151#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483646) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483646)), 11#L98-1true, 58#true, 178#true]) [2025-03-09 06:39:35,167 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-03-09 06:39:35,167 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-03-09 06:39:35,167 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-09 06:39:35,167 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-09 06:39:35,167 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([512] L57-->thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483647 v_~n2~0_3) v_~n1~0_3) InVars {~n2~0=v_~n2~0_3, ~n1~0=v_~n1~0_3} OutVars{~n2~0=v_~n2~0_3, ~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[][66], [Black: 157#(= thread1Thread1of1ForFork1_~i~0 0), Black: 160#(and (= |thread1Thread1of1ForFork1_#t~post5| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 65#(and (= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 14#thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 163#true, 52#thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 167#(<= ~n2~0 ~n1~0), Black: 172#(= thread2Thread1of1ForFork0_~i~1 0), Black: 175#(and (= |thread2Thread1of1ForFork0_#t~post10| 0) (= thread2Thread1of1ForFork0_~i~1 0)), 194#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), Black: 181#(<= ~n1~0 ~n2~0), 96#true, Black: 147#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), Black: 149#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483645) (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483645)), Black: 151#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483646) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483646)), 11#L98-1true, 58#true, 178#true]) [2025-03-09 06:39:35,167 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-03-09 06:39:35,168 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-03-09 06:39:35,168 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-09 06:39:35,168 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-09 06:39:35,177 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([528] L77-2-->thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ v_~n2~0_14 2147483648) v_~n1~0_14) InVars {~n2~0=v_~n2~0_14, ~n1~0=v_~n1~0_14} OutVars{~n2~0=v_~n2~0_14, ~n1~0=v_~n1~0_14} AuxVars[] AssignedVars[][72], [Black: 157#(= thread1Thread1of1ForFork1_~i~0 0), Black: 160#(and (= |thread1Thread1of1ForFork1_#t~post5| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 65#(and (= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 14#thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 163#true, 52#thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 167#(<= ~n2~0 ~n1~0), Black: 172#(= thread2Thread1of1ForFork0_~i~1 0), Black: 175#(and (= |thread2Thread1of1ForFork0_#t~post10| 0) (= thread2Thread1of1ForFork0_~i~1 0)), 34#L99true, 194#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), Black: 181#(<= ~n1~0 ~n2~0), 96#true, Black: 147#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), Black: 149#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483645) (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483645)), Black: 151#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483646) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483646)), 58#true, 178#true]) [2025-03-09 06:39:35,177 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-03-09 06:39:35,177 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-03-09 06:39:35,177 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-09 06:39:35,178 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-03-09 06:39:35,178 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([512] L57-->thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483647 v_~n2~0_3) v_~n1~0_3) InVars {~n2~0=v_~n2~0_3, ~n1~0=v_~n1~0_3} OutVars{~n2~0=v_~n2~0_3, ~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[][66], [Black: 157#(= thread1Thread1of1ForFork1_~i~0 0), Black: 160#(and (= |thread1Thread1of1ForFork1_#t~post5| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 65#(and (= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 14#thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 163#true, 52#thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 167#(<= ~n2~0 ~n1~0), Black: 172#(= thread2Thread1of1ForFork0_~i~1 0), Black: 175#(and (= |thread2Thread1of1ForFork0_#t~post10| 0) (= thread2Thread1of1ForFork0_~i~1 0)), 34#L99true, 194#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), Black: 181#(<= ~n1~0 ~n2~0), 96#true, Black: 147#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), Black: 149#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483645) (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483645)), Black: 151#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483646) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483646)), 58#true, 178#true]) [2025-03-09 06:39:35,178 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-03-09 06:39:35,178 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-09 06:39:35,178 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-03-09 06:39:35,178 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-03-09 06:39:35,227 INFO L124 PetriNetUnfolderBase]: 2497/5046 cut-off events. [2025-03-09 06:39:35,228 INFO L125 PetriNetUnfolderBase]: For 2121/2135 co-relation queries the response was YES. [2025-03-09 06:39:35,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10605 conditions, 5046 events. 2497/5046 cut-off events. For 2121/2135 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 36546 event pairs, 1374 based on Foata normal form. 134/4858 useless extension candidates. Maximal degree in co-relation 10504. Up to 3298 conditions per place. [2025-03-09 06:39:35,255 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 57 selfloop transitions, 1 changer transitions 0/84 dead transitions. [2025-03-09 06:39:35,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 84 transitions, 518 flow [2025-03-09 06:39:35,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:39:35,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:39:35,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2025-03-09 06:39:35,256 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2025-03-09 06:39:35,256 INFO L175 Difference]: Start difference. First operand has 82 places, 88 transitions, 430 flow. Second operand 3 states and 110 transitions. [2025-03-09 06:39:35,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 84 transitions, 518 flow [2025-03-09 06:39:35,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 84 transitions, 501 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-09 06:39:35,262 INFO L231 Difference]: Finished difference. Result has 78 places, 84 transitions, 387 flow [2025-03-09 06:39:35,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=387, PETRI_PLACES=78, PETRI_TRANSITIONS=84} [2025-03-09 06:39:35,262 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 25 predicate places. [2025-03-09 06:39:35,262 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 84 transitions, 387 flow [2025-03-09 06:39:35,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:35,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:35,262 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:39:35,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 06:39:35,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:39:35,463 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 06:39:35,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:35,463 INFO L85 PathProgramCache]: Analyzing trace with hash -490853773, now seen corresponding path program 1 times [2025-03-09 06:39:35,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:35,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278826218] [2025-03-09 06:39:35,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:35,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:35,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:39:35,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:39:35,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:35,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:35,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 06:39:35,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:35,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278826218] [2025-03-09 06:39:35,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278826218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:39:35,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:39:35,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:39:35,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840021265] [2025-03-09 06:39:35,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:39:35,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:39:35,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:35,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:39:35,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:39:35,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2025-03-09 06:39:35,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 84 transitions, 387 flow. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:35,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:35,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2025-03-09 06:39:35,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:35,905 INFO L124 PetriNetUnfolderBase]: 1898/3774 cut-off events. [2025-03-09 06:39:35,905 INFO L125 PetriNetUnfolderBase]: For 1023/1031 co-relation queries the response was YES. [2025-03-09 06:39:35,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8166 conditions, 3774 events. 1898/3774 cut-off events. For 1023/1031 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 25171 event pairs, 1024 based on Foata normal form. 52/3685 useless extension candidates. Maximal degree in co-relation 8146. Up to 1823 conditions per place. [2025-03-09 06:39:35,927 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 106 selfloop transitions, 5 changer transitions 0/135 dead transitions. [2025-03-09 06:39:35,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 135 transitions, 811 flow [2025-03-09 06:39:35,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:39:35,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:39:35,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 205 transitions. [2025-03-09 06:39:35,928 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2025-03-09 06:39:35,928 INFO L175 Difference]: Start difference. First operand has 78 places, 84 transitions, 387 flow. Second operand 5 states and 205 transitions. [2025-03-09 06:39:35,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 135 transitions, 811 flow [2025-03-09 06:39:35,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 135 transitions, 810 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:39:35,933 INFO L231 Difference]: Finished difference. Result has 83 places, 86 transitions, 415 flow [2025-03-09 06:39:35,933 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=415, PETRI_PLACES=83, PETRI_TRANSITIONS=86} [2025-03-09 06:39:35,934 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 30 predicate places. [2025-03-09 06:39:35,934 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 86 transitions, 415 flow [2025-03-09 06:39:35,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:35,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:35,934 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:39:35,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 06:39:35,934 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 06:39:35,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:35,935 INFO L85 PathProgramCache]: Analyzing trace with hash 101850969, now seen corresponding path program 1 times [2025-03-09 06:39:35,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:35,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653879755] [2025-03-09 06:39:35,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:35,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:35,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:39:35,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:39:35,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:35,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:36,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:39:36,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:36,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653879755] [2025-03-09 06:39:36,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653879755] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:39:36,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462294822] [2025-03-09 06:39:36,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:36,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:39:36,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:39:36,052 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:39:36,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 06:39:36,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:39:36,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:39:36,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:36,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:36,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:39:36,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:39:36,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:39:36,168 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:39:36,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462294822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:39:36,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:39:36,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 6 [2025-03-09 06:39:36,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752079876] [2025-03-09 06:39:36,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:39:36,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:39:36,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:36,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:39:36,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:39:36,186 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-03-09 06:39:36,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 86 transitions, 415 flow. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:36,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:36,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-03-09 06:39:36,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:36,423 INFO L124 PetriNetUnfolderBase]: 1690/3482 cut-off events. [2025-03-09 06:39:36,423 INFO L125 PetriNetUnfolderBase]: For 1679/1727 co-relation queries the response was YES. [2025-03-09 06:39:36,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7457 conditions, 3482 events. 1690/3482 cut-off events. For 1679/1727 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 23189 event pairs, 944 based on Foata normal form. 158/3415 useless extension candidates. Maximal degree in co-relation 7434. Up to 2287 conditions per place. [2025-03-09 06:39:36,442 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 53 selfloop transitions, 6 changer transitions 0/82 dead transitions. [2025-03-09 06:39:36,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 82 transitions, 507 flow [2025-03-09 06:39:36,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:39:36,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:39:36,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2025-03-09 06:39:36,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2025-03-09 06:39:36,443 INFO L175 Difference]: Start difference. First operand has 83 places, 86 transitions, 415 flow. Second operand 4 states and 136 transitions. [2025-03-09 06:39:36,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 82 transitions, 507 flow [2025-03-09 06:39:36,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 82 transitions, 497 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-09 06:39:36,449 INFO L231 Difference]: Finished difference. Result has 79 places, 82 transitions, 391 flow [2025-03-09 06:39:36,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=391, PETRI_PLACES=79, PETRI_TRANSITIONS=82} [2025-03-09 06:39:36,451 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 26 predicate places. [2025-03-09 06:39:36,451 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 82 transitions, 391 flow [2025-03-09 06:39:36,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:36,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:36,452 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:39:36,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 06:39:36,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:39:36,653 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 06:39:36,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:36,653 INFO L85 PathProgramCache]: Analyzing trace with hash 22670163, now seen corresponding path program 1 times [2025-03-09 06:39:36,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:36,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699613201] [2025-03-09 06:39:36,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:36,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:36,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 06:39:36,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 06:39:36,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:36,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:36,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 06:39:36,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:36,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699613201] [2025-03-09 06:39:36,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699613201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:39:36,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:39:36,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:39:36,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232276791] [2025-03-09 06:39:36,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:39:36,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:39:36,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:36,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:39:36,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:39:36,756 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2025-03-09 06:39:36,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 82 transitions, 391 flow. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:36,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:36,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2025-03-09 06:39:36,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:36,950 INFO L124 PetriNetUnfolderBase]: 1536/3030 cut-off events. [2025-03-09 06:39:36,950 INFO L125 PetriNetUnfolderBase]: For 1109/1163 co-relation queries the response was YES. [2025-03-09 06:39:36,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6738 conditions, 3030 events. 1536/3030 cut-off events. For 1109/1163 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 18872 event pairs, 886 based on Foata normal form. 34/2898 useless extension candidates. Maximal degree in co-relation 6718. Up to 1833 conditions per place. [2025-03-09 06:39:36,965 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 67 selfloop transitions, 3 changer transitions 29/119 dead transitions. [2025-03-09 06:39:36,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 119 transitions, 740 flow [2025-03-09 06:39:36,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:39:36,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:39:36,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 196 transitions. [2025-03-09 06:39:36,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6533333333333333 [2025-03-09 06:39:36,966 INFO L175 Difference]: Start difference. First operand has 79 places, 82 transitions, 391 flow. Second operand 5 states and 196 transitions. [2025-03-09 06:39:36,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 119 transitions, 740 flow [2025-03-09 06:39:36,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 119 transitions, 733 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:39:36,971 INFO L231 Difference]: Finished difference. Result has 83 places, 80 transitions, 381 flow [2025-03-09 06:39:36,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=381, PETRI_PLACES=83, PETRI_TRANSITIONS=80} [2025-03-09 06:39:36,972 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 30 predicate places. [2025-03-09 06:39:36,972 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 80 transitions, 381 flow [2025-03-09 06:39:36,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:36,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:36,972 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-03-09 06:39:36,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 06:39:36,973 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 06:39:36,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:36,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1031529492, now seen corresponding path program 2 times [2025-03-09 06:39:36,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:36,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177100458] [2025-03-09 06:39:36,973 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:39:36,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:36,982 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-09 06:39:36,985 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-09 06:39:36,985 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:39:36,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:37,006 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 06:39:37,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:37,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177100458] [2025-03-09 06:39:37,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177100458] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:39:37,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744020044] [2025-03-09 06:39:37,007 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:39:37,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:39:37,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:39:37,010 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:39:37,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 06:39:37,048 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-09 06:39:37,054 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-09 06:39:37,055 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:39:37,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:37,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:39:37,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:39:37,072 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 06:39:37,073 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:39:37,089 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 06:39:37,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744020044] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:39:37,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:39:37,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-03-09 06:39:37,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907285157] [2025-03-09 06:39:37,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:39:37,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:39:37,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:37,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:39:37,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:39:37,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-03-09 06:39:37,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 80 transitions, 381 flow. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:37,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:37,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-03-09 06:39:37,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:37,264 INFO L124 PetriNetUnfolderBase]: 1298/2671 cut-off events. [2025-03-09 06:39:37,265 INFO L125 PetriNetUnfolderBase]: For 881/917 co-relation queries the response was YES. [2025-03-09 06:39:37,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5925 conditions, 2671 events. 1298/2671 cut-off events. For 881/917 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 16860 event pairs, 750 based on Foata normal form. 1/2529 useless extension candidates. Maximal degree in co-relation 5903. Up to 1802 conditions per place. [2025-03-09 06:39:37,278 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 43 selfloop transitions, 16 changer transitions 0/79 dead transitions. [2025-03-09 06:39:37,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 79 transitions, 489 flow [2025-03-09 06:39:37,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:39:37,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:39:37,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2025-03-09 06:39:37,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-09 06:39:37,279 INFO L175 Difference]: Start difference. First operand has 83 places, 80 transitions, 381 flow. Second operand 4 states and 128 transitions. [2025-03-09 06:39:37,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 79 transitions, 489 flow [2025-03-09 06:39:37,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 79 transitions, 476 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-09 06:39:37,283 INFO L231 Difference]: Finished difference. Result has 79 places, 79 transitions, 390 flow [2025-03-09 06:39:37,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=390, PETRI_PLACES=79, PETRI_TRANSITIONS=79} [2025-03-09 06:39:37,284 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 26 predicate places. [2025-03-09 06:39:37,284 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 79 transitions, 390 flow [2025-03-09 06:39:37,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:37,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:37,284 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:39:37,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 06:39:37,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-09 06:39:37,488 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 06:39:37,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:37,488 INFO L85 PathProgramCache]: Analyzing trace with hash 41236367, now seen corresponding path program 1 times [2025-03-09 06:39:37,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:37,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297961203] [2025-03-09 06:39:37,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:37,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:37,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 06:39:37,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 06:39:37,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:37,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:37,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:39:37,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:37,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297961203] [2025-03-09 06:39:37,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297961203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:39:37,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:39:37,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 06:39:37,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697114696] [2025-03-09 06:39:37,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:39:37,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:39:37,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:37,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:39:37,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:39:37,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2025-03-09 06:39:37,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 79 transitions, 390 flow. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:37,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:37,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2025-03-09 06:39:37,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:37,757 INFO L124 PetriNetUnfolderBase]: 1025/2084 cut-off events. [2025-03-09 06:39:37,757 INFO L125 PetriNetUnfolderBase]: For 662/664 co-relation queries the response was YES. [2025-03-09 06:39:37,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4547 conditions, 2084 events. 1025/2084 cut-off events. For 662/664 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 12076 event pairs, 585 based on Foata normal form. 26/2029 useless extension candidates. Maximal degree in co-relation 4527. Up to 1004 conditions per place. [2025-03-09 06:39:37,768 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 83 selfloop transitions, 9 changer transitions 4/115 dead transitions. [2025-03-09 06:39:37,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 115 transitions, 694 flow [2025-03-09 06:39:37,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:39:37,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:39:37,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 202 transitions. [2025-03-09 06:39:37,770 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6733333333333333 [2025-03-09 06:39:37,770 INFO L175 Difference]: Start difference. First operand has 79 places, 79 transitions, 390 flow. Second operand 5 states and 202 transitions. [2025-03-09 06:39:37,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 115 transitions, 694 flow [2025-03-09 06:39:37,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 115 transitions, 662 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 06:39:37,774 INFO L231 Difference]: Finished difference. Result has 82 places, 81 transitions, 397 flow [2025-03-09 06:39:37,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=397, PETRI_PLACES=82, PETRI_TRANSITIONS=81} [2025-03-09 06:39:37,775 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 29 predicate places. [2025-03-09 06:39:37,775 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 81 transitions, 397 flow [2025-03-09 06:39:37,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:37,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:37,776 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1] [2025-03-09 06:39:37,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 06:39:37,776 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 06:39:37,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:37,777 INFO L85 PathProgramCache]: Analyzing trace with hash -564740933, now seen corresponding path program 1 times [2025-03-09 06:39:37,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:37,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546916106] [2025-03-09 06:39:37,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:37,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:37,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 06:39:37,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:39:37,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:37,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:37,897 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:39:37,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:37,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546916106] [2025-03-09 06:39:37,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546916106] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:39:37,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590450374] [2025-03-09 06:39:37,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:37,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:39:37,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:39:37,899 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:39:37,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 06:39:37,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 06:39:37,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:39:37,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:37,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:37,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 06:39:37,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:39:37,994 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:39:37,995 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:39:38,121 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:39:38,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590450374] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:39:38,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:39:38,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-09 06:39:38,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890631465] [2025-03-09 06:39:38,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:39:38,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 06:39:38,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:38,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 06:39:38,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-09 06:39:38,148 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-03-09 06:39:38,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 81 transitions, 397 flow. Second operand has 24 states, 24 states have (on average 25.083333333333332) internal successors, (602), 24 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:38,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:38,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-03-09 06:39:38,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:38,464 INFO L124 PetriNetUnfolderBase]: 959/2044 cut-off events. [2025-03-09 06:39:38,464 INFO L125 PetriNetUnfolderBase]: For 1055/1075 co-relation queries the response was YES. [2025-03-09 06:39:38,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4586 conditions, 2044 events. 959/2044 cut-off events. For 1055/1075 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 12007 event pairs, 555 based on Foata normal form. 22/1944 useless extension candidates. Maximal degree in co-relation 4565. Up to 1329 conditions per place. [2025-03-09 06:39:38,475 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 35 selfloop transitions, 61 changer transitions 0/117 dead transitions. [2025-03-09 06:39:38,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 117 transitions, 841 flow [2025-03-09 06:39:38,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 06:39:38,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-09 06:39:38,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 625 transitions. [2025-03-09 06:39:38,479 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4734848484848485 [2025-03-09 06:39:38,479 INFO L175 Difference]: Start difference. First operand has 82 places, 81 transitions, 397 flow. Second operand 22 states and 625 transitions. [2025-03-09 06:39:38,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 117 transitions, 841 flow [2025-03-09 06:39:38,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 117 transitions, 816 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:39:38,486 INFO L231 Difference]: Finished difference. Result has 107 places, 117 transitions, 792 flow [2025-03-09 06:39:38,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=792, PETRI_PLACES=107, PETRI_TRANSITIONS=117} [2025-03-09 06:39:38,487 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 54 predicate places. [2025-03-09 06:39:38,488 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 117 transitions, 792 flow [2025-03-09 06:39:38,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 25.083333333333332) internal successors, (602), 24 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:38,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:38,488 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:39:38,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 06:39:38,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:39:38,690 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 06:39:38,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:38,690 INFO L85 PathProgramCache]: Analyzing trace with hash 260186479, now seen corresponding path program 1 times [2025-03-09 06:39:38,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:38,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208101457] [2025-03-09 06:39:38,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:38,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:38,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:39:38,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:39:38,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:38,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:38,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:39:38,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:38,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208101457] [2025-03-09 06:39:38,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208101457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:39:38,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:39:38,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 06:39:38,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792391363] [2025-03-09 06:39:38,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:39:38,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:39:38,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:38,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:39:38,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:39:38,780 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2025-03-09 06:39:38,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 117 transitions, 792 flow. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:38,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:38,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2025-03-09 06:39:38,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:38,918 INFO L124 PetriNetUnfolderBase]: 876/1825 cut-off events. [2025-03-09 06:39:38,918 INFO L125 PetriNetUnfolderBase]: For 1084/1100 co-relation queries the response was YES. [2025-03-09 06:39:38,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4335 conditions, 1825 events. 876/1825 cut-off events. For 1084/1100 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 10030 event pairs, 516 based on Foata normal form. 13/1759 useless extension candidates. Maximal degree in co-relation 4307. Up to 1052 conditions per place. [2025-03-09 06:39:38,926 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 83 selfloop transitions, 12 changer transitions 25/139 dead transitions. [2025-03-09 06:39:38,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 139 transitions, 1093 flow [2025-03-09 06:39:38,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:39:38,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:39:38,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 193 transitions. [2025-03-09 06:39:38,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6433333333333333 [2025-03-09 06:39:38,927 INFO L175 Difference]: Start difference. First operand has 107 places, 117 transitions, 792 flow. Second operand 5 states and 193 transitions. [2025-03-09 06:39:38,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 139 transitions, 1093 flow [2025-03-09 06:39:38,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 139 transitions, 937 flow, removed 47 selfloop flow, removed 9 redundant places. [2025-03-09 06:39:38,932 INFO L231 Difference]: Finished difference. Result has 104 places, 114 transitions, 640 flow [2025-03-09 06:39:38,933 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=640, PETRI_PLACES=104, PETRI_TRANSITIONS=114} [2025-03-09 06:39:38,933 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 51 predicate places. [2025-03-09 06:39:38,933 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 114 transitions, 640 flow [2025-03-09 06:39:38,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:38,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:38,933 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:39:38,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 06:39:38,933 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 06:39:38,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:38,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1182396059, now seen corresponding path program 1 times [2025-03-09 06:39:38,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:38,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990632929] [2025-03-09 06:39:38,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:38,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:38,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 06:39:38,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 06:39:38,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:38,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:38,993 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 06:39:38,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:38,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990632929] [2025-03-09 06:39:38,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990632929] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:39:38,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249819806] [2025-03-09 06:39:38,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:38,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:39:38,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:39:38,997 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:39:38,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 06:39:39,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 06:39:39,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 06:39:39,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:39,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:39,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 06:39:39,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:39:39,146 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:39:39,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:39:39,254 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:39:39,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249819806] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:39:39,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:39:39,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-09 06:39:39,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963891221] [2025-03-09 06:39:39,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:39:39,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 06:39:39,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:39,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 06:39:39,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-03-09 06:39:39,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-03-09 06:39:39,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 114 transitions, 640 flow. Second operand has 19 states, 19 states have (on average 23.0) internal successors, (437), 19 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:39,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:39,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-03-09 06:39:39,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:40,197 INFO L124 PetriNetUnfolderBase]: 1222/2377 cut-off events. [2025-03-09 06:39:40,197 INFO L125 PetriNetUnfolderBase]: For 1390/1436 co-relation queries the response was YES. [2025-03-09 06:39:40,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5748 conditions, 2377 events. 1222/2377 cut-off events. For 1390/1436 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 13768 event pairs, 368 based on Foata normal form. 52/2335 useless extension candidates. Maximal degree in co-relation 5719. Up to 496 conditions per place. [2025-03-09 06:39:40,208 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 147 selfloop transitions, 67 changer transitions 10/240 dead transitions. [2025-03-09 06:39:40,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 240 transitions, 1522 flow [2025-03-09 06:39:40,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 06:39:40,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-09 06:39:40,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 448 transitions. [2025-03-09 06:39:40,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-09 06:39:40,210 INFO L175 Difference]: Start difference. First operand has 104 places, 114 transitions, 640 flow. Second operand 14 states and 448 transitions. [2025-03-09 06:39:40,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 240 transitions, 1522 flow [2025-03-09 06:39:40,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 240 transitions, 1446 flow, removed 26 selfloop flow, removed 6 redundant places. [2025-03-09 06:39:40,219 INFO L231 Difference]: Finished difference. Result has 106 places, 118 transitions, 762 flow [2025-03-09 06:39:40,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=762, PETRI_PLACES=106, PETRI_TRANSITIONS=118} [2025-03-09 06:39:40,219 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 53 predicate places. [2025-03-09 06:39:40,219 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 118 transitions, 762 flow [2025-03-09 06:39:40,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 23.0) internal successors, (437), 19 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:40,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:40,220 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:39:40,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 06:39:40,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:39:40,421 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 06:39:40,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:40,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1170464197, now seen corresponding path program 1 times [2025-03-09 06:39:40,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:40,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741932290] [2025-03-09 06:39:40,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:40,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:40,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 06:39:40,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 06:39:40,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:40,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:40,465 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 06:39:40,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:40,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741932290] [2025-03-09 06:39:40,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741932290] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:39:40,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457755465] [2025-03-09 06:39:40,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:40,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:39:40,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:39:40,468 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:39:40,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 06:39:40,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 06:39:40,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 06:39:40,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:40,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:40,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 06:39:40,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:39:40,601 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:39:40,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:39:40,693 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:39:40,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457755465] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:39:40,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:39:40,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-09 06:39:40,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740655330] [2025-03-09 06:39:40,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:39:40,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 06:39:40,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:40,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 06:39:40,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-03-09 06:39:41,032 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-03-09 06:39:41,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 118 transitions, 762 flow. Second operand has 19 states, 19 states have (on average 23.210526315789473) internal successors, (441), 19 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:41,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:41,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-03-09 06:39:41,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:41,579 INFO L124 PetriNetUnfolderBase]: 1122/2189 cut-off events. [2025-03-09 06:39:41,580 INFO L125 PetriNetUnfolderBase]: For 1575/1587 co-relation queries the response was YES. [2025-03-09 06:39:41,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5337 conditions, 2189 events. 1122/2189 cut-off events. For 1575/1587 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 12346 event pairs, 350 based on Foata normal form. 44/2125 useless extension candidates. Maximal degree in co-relation 5311. Up to 515 conditions per place. [2025-03-09 06:39:41,587 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 89 selfloop transitions, 61 changer transitions 61/226 dead transitions. [2025-03-09 06:39:41,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 226 transitions, 1582 flow [2025-03-09 06:39:41,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 06:39:41,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-09 06:39:41,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 441 transitions. [2025-03-09 06:39:41,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.525 [2025-03-09 06:39:41,589 INFO L175 Difference]: Start difference. First operand has 106 places, 118 transitions, 762 flow. Second operand 14 states and 441 transitions. [2025-03-09 06:39:41,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 226 transitions, 1582 flow [2025-03-09 06:39:41,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 226 transitions, 1498 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-03-09 06:39:41,595 INFO L231 Difference]: Finished difference. Result has 115 places, 111 transitions, 815 flow [2025-03-09 06:39:41,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=815, PETRI_PLACES=115, PETRI_TRANSITIONS=111} [2025-03-09 06:39:41,595 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 62 predicate places. [2025-03-09 06:39:41,595 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 111 transitions, 815 flow [2025-03-09 06:39:41,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 23.210526315789473) internal successors, (441), 19 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:41,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:41,597 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:39:41,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 06:39:41,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-09 06:39:41,797 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 06:39:41,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:41,798 INFO L85 PathProgramCache]: Analyzing trace with hash 603986928, now seen corresponding path program 1 times [2025-03-09 06:39:41,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:41,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500030691] [2025-03-09 06:39:41,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:41,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:41,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 06:39:41,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 06:39:41,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:41,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:41,853 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 06:39:41,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:41,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500030691] [2025-03-09 06:39:41,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500030691] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:39:41,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296281412] [2025-03-09 06:39:41,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:41,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:39:41,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:39:41,855 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:39:41,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 06:39:41,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 06:39:41,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 06:39:41,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:41,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:41,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 06:39:41,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:39:41,988 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 06:39:41,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:39:42,073 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 06:39:42,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296281412] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:39:42,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:39:42,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 19 [2025-03-09 06:39:42,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131993742] [2025-03-09 06:39:42,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:39:42,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 06:39:42,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:42,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 06:39:42,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2025-03-09 06:39:42,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-03-09 06:39:42,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 111 transitions, 815 flow. Second operand has 19 states, 19 states have (on average 23.157894736842106) internal successors, (440), 19 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:42,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:42,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-03-09 06:39:42,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:42,889 INFO L124 PetriNetUnfolderBase]: 1398/2657 cut-off events. [2025-03-09 06:39:42,890 INFO L125 PetriNetUnfolderBase]: For 2330/2348 co-relation queries the response was YES. [2025-03-09 06:39:42,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6892 conditions, 2657 events. 1398/2657 cut-off events. For 2330/2348 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 14784 event pairs, 492 based on Foata normal form. 52/2633 useless extension candidates. Maximal degree in co-relation 6865. Up to 798 conditions per place. [2025-03-09 06:39:42,899 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 193 selfloop transitions, 61 changer transitions 10/279 dead transitions. [2025-03-09 06:39:42,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 279 transitions, 2200 flow [2025-03-09 06:39:42,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 06:39:42,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-09 06:39:42,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 525 transitions. [2025-03-09 06:39:42,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5147058823529411 [2025-03-09 06:39:42,900 INFO L175 Difference]: Start difference. First operand has 115 places, 111 transitions, 815 flow. Second operand 17 states and 525 transitions. [2025-03-09 06:39:42,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 279 transitions, 2200 flow [2025-03-09 06:39:42,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 279 transitions, 2014 flow, removed 23 selfloop flow, removed 9 redundant places. [2025-03-09 06:39:42,909 INFO L231 Difference]: Finished difference. Result has 119 places, 144 transitions, 1287 flow [2025-03-09 06:39:42,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=743, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1287, PETRI_PLACES=119, PETRI_TRANSITIONS=144} [2025-03-09 06:39:42,909 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 66 predicate places. [2025-03-09 06:39:42,909 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 144 transitions, 1287 flow [2025-03-09 06:39:42,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 23.157894736842106) internal successors, (440), 19 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:42,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:42,910 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:39:42,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 06:39:43,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-09 06:39:43,114 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 06:39:43,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:43,114 INFO L85 PathProgramCache]: Analyzing trace with hash -25723357, now seen corresponding path program 1 times [2025-03-09 06:39:43,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:43,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379481009] [2025-03-09 06:39:43,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:43,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:43,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 06:39:43,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 06:39:43,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:43,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:43,167 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 06:39:43,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:43,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379481009] [2025-03-09 06:39:43,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379481009] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:39:43,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567079313] [2025-03-09 06:39:43,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:39:43,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:39:43,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:39:43,170 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:39:43,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 06:39:43,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 06:39:43,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 06:39:43,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:39:43,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:43,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 06:39:43,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:39:43,305 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 06:39:43,305 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:39:43,394 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 06:39:43,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567079313] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:39:43,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:39:43,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 19 [2025-03-09 06:39:43,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857126822] [2025-03-09 06:39:43,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:39:43,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 06:39:43,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:43,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 06:39:43,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2025-03-09 06:39:43,639 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-03-09 06:39:43,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 144 transitions, 1287 flow. Second operand has 19 states, 19 states have (on average 23.36842105263158) internal successors, (444), 19 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:43,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:43,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-03-09 06:39:43,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:44,096 INFO L124 PetriNetUnfolderBase]: 1566/2953 cut-off events. [2025-03-09 06:39:44,096 INFO L125 PetriNetUnfolderBase]: For 3329/3361 co-relation queries the response was YES. [2025-03-09 06:39:44,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7745 conditions, 2953 events. 1566/2953 cut-off events. For 3329/3361 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 16066 event pairs, 567 based on Foata normal form. 52/2903 useless extension candidates. Maximal degree in co-relation 7714. Up to 1034 conditions per place. [2025-03-09 06:39:44,104 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 136 selfloop transitions, 56 changer transitions 69/277 dead transitions. [2025-03-09 06:39:44,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 277 transitions, 2393 flow [2025-03-09 06:39:44,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 06:39:44,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-09 06:39:44,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 518 transitions. [2025-03-09 06:39:44,106 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5078431372549019 [2025-03-09 06:39:44,106 INFO L175 Difference]: Start difference. First operand has 119 places, 144 transitions, 1287 flow. Second operand 17 states and 518 transitions. [2025-03-09 06:39:44,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 277 transitions, 2393 flow [2025-03-09 06:39:44,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 277 transitions, 2309 flow, removed 10 selfloop flow, removed 5 redundant places. [2025-03-09 06:39:44,114 INFO L231 Difference]: Finished difference. Result has 133 places, 142 transitions, 1359 flow [2025-03-09 06:39:44,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1247, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1359, PETRI_PLACES=133, PETRI_TRANSITIONS=142} [2025-03-09 06:39:44,115 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 80 predicate places. [2025-03-09 06:39:44,115 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 142 transitions, 1359 flow [2025-03-09 06:39:44,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 23.36842105263158) internal successors, (444), 19 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:44,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:44,115 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:39:44,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 06:39:44,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:39:44,320 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 06:39:44,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:44,320 INFO L85 PathProgramCache]: Analyzing trace with hash 2055573652, now seen corresponding path program 2 times [2025-03-09 06:39:44,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:44,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744471429] [2025-03-09 06:39:44,320 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:39:44,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:44,326 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-09 06:39:44,329 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 30 statements. [2025-03-09 06:39:44,329 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:39:44,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:44,348 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 06:39:44,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:44,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744471429] [2025-03-09 06:39:44,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744471429] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:39:44,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950477438] [2025-03-09 06:39:44,348 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:39:44,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:39:44,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:39:44,350 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:39:44,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 06:39:44,395 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-09 06:39:44,405 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 30 statements. [2025-03-09 06:39:44,405 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:39:44,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:44,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:39:44,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:39:44,433 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 06:39:44,433 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:39:44,461 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 06:39:44,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950477438] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:39:44,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:39:44,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-03-09 06:39:44,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739507049] [2025-03-09 06:39:44,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:39:44,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:39:44,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:44,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:39:44,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:39:44,500 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-03-09 06:39:44,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 142 transitions, 1359 flow. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:44,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:44,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-03-09 06:39:44,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:44,670 INFO L124 PetriNetUnfolderBase]: 1261/2372 cut-off events. [2025-03-09 06:39:44,670 INFO L125 PetriNetUnfolderBase]: For 3690/3702 co-relation queries the response was YES. [2025-03-09 06:39:44,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6977 conditions, 2372 events. 1261/2372 cut-off events. For 3690/3702 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 12131 event pairs, 358 based on Foata normal form. 34/2357 useless extension candidates. Maximal degree in co-relation 6943. Up to 1059 conditions per place. [2025-03-09 06:39:44,681 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 140 selfloop transitions, 12 changer transitions 7/176 dead transitions. [2025-03-09 06:39:44,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 176 transitions, 1841 flow [2025-03-09 06:39:44,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:39:44,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:39:44,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 163 transitions. [2025-03-09 06:39:44,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5433333333333333 [2025-03-09 06:39:44,682 INFO L175 Difference]: Start difference. First operand has 133 places, 142 transitions, 1359 flow. Second operand 5 states and 163 transitions. [2025-03-09 06:39:44,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 176 transitions, 1841 flow [2025-03-09 06:39:44,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 176 transitions, 1744 flow, removed 13 selfloop flow, removed 14 redundant places. [2025-03-09 06:39:44,691 INFO L231 Difference]: Finished difference. Result has 118 places, 143 transitions, 1339 flow [2025-03-09 06:39:44,691 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1278, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1339, PETRI_PLACES=118, PETRI_TRANSITIONS=143} [2025-03-09 06:39:44,691 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 65 predicate places. [2025-03-09 06:39:44,692 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 143 transitions, 1339 flow [2025-03-09 06:39:44,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:44,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:44,692 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:39:44,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-09 06:39:44,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:39:44,892 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 06:39:44,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:44,893 INFO L85 PathProgramCache]: Analyzing trace with hash 570983080, now seen corresponding path program 2 times [2025-03-09 06:39:44,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:44,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074460169] [2025-03-09 06:39:44,893 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:39:44,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:44,898 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-09 06:39:44,904 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 32 statements. [2025-03-09 06:39:44,904 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:39:44,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:44,927 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 06:39:44,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:44,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074460169] [2025-03-09 06:39:44,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074460169] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:39:44,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319702787] [2025-03-09 06:39:44,927 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:39:44,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:39:44,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:39:44,929 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:39:44,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 06:39:44,978 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-09 06:39:44,989 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 32 statements. [2025-03-09 06:39:44,989 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:39:44,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:44,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:39:44,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:39:45,025 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 06:39:45,025 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:39:45,060 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 06:39:45,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319702787] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:39:45,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:39:45,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-03-09 06:39:45,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40618491] [2025-03-09 06:39:45,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:39:45,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:39:45,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:45,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:39:45,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:39:45,097 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-03-09 06:39:45,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 143 transitions, 1339 flow. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:45,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:45,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-03-09 06:39:45,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:45,332 INFO L124 PetriNetUnfolderBase]: 1197/2244 cut-off events. [2025-03-09 06:39:45,332 INFO L125 PetriNetUnfolderBase]: For 4184/4206 co-relation queries the response was YES. [2025-03-09 06:39:45,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6871 conditions, 2244 events. 1197/2244 cut-off events. For 4184/4206 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 11318 event pairs, 331 based on Foata normal form. 55/2254 useless extension candidates. Maximal degree in co-relation 6839. Up to 994 conditions per place. [2025-03-09 06:39:45,338 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 80 selfloop transitions, 1 changer transitions 93/177 dead transitions. [2025-03-09 06:39:45,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 177 transitions, 1848 flow [2025-03-09 06:39:45,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:39:45,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:39:45,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2025-03-09 06:39:45,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-09 06:39:45,339 INFO L175 Difference]: Start difference. First operand has 118 places, 143 transitions, 1339 flow. Second operand 5 states and 160 transitions. [2025-03-09 06:39:45,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 177 transitions, 1848 flow [2025-03-09 06:39:45,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 177 transitions, 1825 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-09 06:39:45,346 INFO L231 Difference]: Finished difference. Result has 117 places, 84 transitions, 1045 flow [2025-03-09 06:39:45,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1322, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1045, PETRI_PLACES=117, PETRI_TRANSITIONS=84} [2025-03-09 06:39:45,346 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 64 predicate places. [2025-03-09 06:39:45,346 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 84 transitions, 1045 flow [2025-03-09 06:39:45,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:45,347 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:39:45,347 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1] [2025-03-09 06:39:45,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-09 06:39:45,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-09 06:39:45,547 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 06:39:45,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:39:45,548 INFO L85 PathProgramCache]: Analyzing trace with hash 918934651, now seen corresponding path program 2 times [2025-03-09 06:39:45,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:39:45,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710893261] [2025-03-09 06:39:45,548 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:39:45,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:39:45,555 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-09 06:39:45,558 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 35 statements. [2025-03-09 06:39:45,558 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:39:45,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:45,584 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 06:39:45,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:39:45,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710893261] [2025-03-09 06:39:45,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710893261] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:39:45,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897822611] [2025-03-09 06:39:45,585 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:39:45,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:39:45,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:39:45,587 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:39:45,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 06:39:45,634 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-09 06:39:45,643 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 35 statements. [2025-03-09 06:39:45,643 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:39:45,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:39:45,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:39:45,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:39:45,675 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 06:39:45,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:39:45,705 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 06:39:45,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897822611] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:39:45,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:39:45,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-09 06:39:45,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917680017] [2025-03-09 06:39:45,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:39:45,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:39:45,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:39:45,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:39:45,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:39:45,741 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-03-09 06:39:45,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 84 transitions, 1045 flow. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:45,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:39:45,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-03-09 06:39:45,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:39:45,764 INFO L124 PetriNetUnfolderBase]: 12/144 cut-off events. [2025-03-09 06:39:45,764 INFO L125 PetriNetUnfolderBase]: For 731/731 co-relation queries the response was YES. [2025-03-09 06:39:45,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 789 conditions, 144 events. 12/144 cut-off events. For 731/731 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 357 event pairs, 0 based on Foata normal form. 3/147 useless extension candidates. Maximal degree in co-relation 764. Up to 56 conditions per place. [2025-03-09 06:39:45,765 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 0 selfloop transitions, 0 changer transitions 83/83 dead transitions. [2025-03-09 06:39:45,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 83 transitions, 1185 flow [2025-03-09 06:39:45,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:39:45,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:39:45,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2025-03-09 06:39:45,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42916666666666664 [2025-03-09 06:39:45,767 INFO L175 Difference]: Start difference. First operand has 117 places, 84 transitions, 1045 flow. Second operand 4 states and 103 transitions. [2025-03-09 06:39:45,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 83 transitions, 1185 flow [2025-03-09 06:39:45,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 83 transitions, 1000 flow, removed 3 selfloop flow, removed 14 redundant places. [2025-03-09 06:39:45,770 INFO L231 Difference]: Finished difference. Result has 60 places, 0 transitions, 0 flow [2025-03-09 06:39:45,770 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=60, PETRI_TRANSITIONS=0} [2025-03-09 06:39:45,771 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2025-03-09 06:39:45,771 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 0 transitions, 0 flow [2025-03-09 06:39:45,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:39:45,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2025-03-09 06:39:45,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2025-03-09 06:39:45,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2025-03-09 06:39:45,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2025-03-09 06:39:45,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2025-03-09 06:39:45,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2025-03-09 06:39:45,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2025-03-09 06:39:45,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2025-03-09 06:39:45,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2025-03-09 06:39:45,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2025-03-09 06:39:45,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2025-03-09 06:39:45,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2025-03-09 06:39:45,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 22 remaining) [2025-03-09 06:39:45,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 22 remaining) [2025-03-09 06:39:45,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2025-03-09 06:39:45,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2025-03-09 06:39:45,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2025-03-09 06:39:45,775 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2025-03-09 06:39:45,775 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2025-03-09 06:39:45,775 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2025-03-09 06:39:45,775 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2025-03-09 06:39:45,775 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2025-03-09 06:39:45,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-09 06:39:45,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-09 06:39:45,979 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:39:45,983 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 06:39:45,983 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 06:39:45,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 06:39:45 BasicIcfg [2025-03-09 06:39:45,986 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 06:39:45,987 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 06:39:45,987 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 06:39:45,987 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 06:39:45,987 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:39:31" (3/4) ... [2025-03-09 06:39:45,988 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 06:39:45,990 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-09 06:39:45,990 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-09 06:39:45,995 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 103 nodes and edges [2025-03-09 06:39:45,996 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 42 nodes and edges [2025-03-09 06:39:45,996 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-03-09 06:39:45,996 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 06:39:46,052 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 06:39:46,052 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 06:39:46,053 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 06:39:46,053 INFO L158 Benchmark]: Toolchain (without parser) took 15799.96ms. Allocated memory was 167.8MB in the beginning and 486.5MB in the end (delta: 318.8MB). Free memory was 129.8MB in the beginning and 284.3MB in the end (delta: -154.5MB). Peak memory consumption was 158.9MB. Max. memory is 16.1GB. [2025-03-09 06:39:46,053 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 192.9MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:39:46,053 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.49ms. Allocated memory is still 167.8MB. Free memory was 129.4MB in the beginning and 117.2MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:39:46,054 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.72ms. Allocated memory is still 167.8MB. Free memory was 117.2MB in the beginning and 115.7MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:39:46,054 INFO L158 Benchmark]: Boogie Preprocessor took 48.90ms. Allocated memory is still 167.8MB. Free memory was 115.7MB in the beginning and 114.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:39:46,055 INFO L158 Benchmark]: IcfgBuilder took 573.68ms. Allocated memory is still 167.8MB. Free memory was 113.7MB in the beginning and 64.9MB in the end (delta: 48.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-09 06:39:46,057 INFO L158 Benchmark]: TraceAbstraction took 14873.66ms. Allocated memory was 167.8MB in the beginning and 486.5MB in the end (delta: 318.8MB). Free memory was 64.5MB in the beginning and 288.5MB in the end (delta: -224.0MB). Peak memory consumption was 91.8MB. Max. memory is 16.1GB. [2025-03-09 06:39:46,057 INFO L158 Benchmark]: Witness Printer took 66.02ms. Allocated memory is still 486.5MB. Free memory was 288.5MB in the beginning and 284.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:39:46,058 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 192.9MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.49ms. Allocated memory is still 167.8MB. Free memory was 129.4MB in the beginning and 117.2MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.72ms. Allocated memory is still 167.8MB. Free memory was 117.2MB in the beginning and 115.7MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.90ms. Allocated memory is still 167.8MB. Free memory was 115.7MB in the beginning and 114.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 573.68ms. Allocated memory is still 167.8MB. Free memory was 113.7MB in the beginning and 64.9MB in the end (delta: 48.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 14873.66ms. Allocated memory was 167.8MB in the beginning and 486.5MB in the end (delta: 318.8MB). Free memory was 64.5MB in the beginning and 288.5MB in the end (delta: -224.0MB). Peak memory consumption was 91.8MB. Max. memory is 16.1GB. * Witness Printer took 66.02ms. Allocated memory is still 486.5MB. Free memory was 288.5MB in the beginning and 284.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 115]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 115]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 115]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 115]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 85 locations, 102 edges, 22 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.8s, OverallIterations: 22, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2840 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2520 mSDsluCounter, 1893 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1769 mSDsCounter, 171 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9781 IncrementalHoareTripleChecker+Invalid, 9952 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 171 mSolverCounterUnsat, 124 mSDtfsCounter, 9781 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 610 GetRequests, 389 SyntacticMatches, 11 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1359occurred in iteration=19, InterpolantAutomatonStates: 166, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 622 NumberOfCodeBlocks, 458 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 802 ConstructedInterpolants, 0 QuantifiedInterpolants, 2601 SizeOfPredicates, 49 NumberOfNonLiveVariables, 1728 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 45 InterpolantComputations, 12 PerfectInterpolantSequences, 683/928 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-09 06:39:46,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE