./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/goblint-regression/04-mutex_07-ps_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/goblint-regression/04-mutex_07-ps_nr.i -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 01b589988edaaecd88451f82bd4303dff81e52948b89e1e090cb7433d59bd20b --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:18:34,012 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:18:34,065 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-04-30 10:18:34,075 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:18:34,076 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:18:34,106 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:18:34,108 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:18:34,108 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:18:34,108 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:18:34,108 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:18:34,109 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:18:34,109 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:18:34,109 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:18:34,110 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:18:34,110 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:18:34,110 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:18:34,110 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:18:34,110 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:18:34,110 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:18:34,110 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:18:34,110 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:18:34,110 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:18:34,111 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:18:34,111 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:18:34,111 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-30 10:18:34,111 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:18:34,111 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:18:34,111 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:18:34,111 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:18:34,111 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:18:34,111 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:18:34,112 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:18:34,112 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:18:34,112 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:18:34,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:18:34,112 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:18:34,112 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:18:34,112 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:18:34,112 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:18:34,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:18:34,112 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:18:34,112 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:18:34,113 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:18:34,113 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:18:34,113 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:18:34,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:18:34,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:18:34,113 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:18:34,113 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:18:34,113 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 -> 01b589988edaaecd88451f82bd4303dff81e52948b89e1e090cb7433d59bd20b [2025-04-30 10:18:34,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:18:34,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:18:34,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:18:34,317 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:18:34,317 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:18:34,318 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/04-mutex_07-ps_nr.i [2025-04-30 10:18:35,583 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84e57cbb8/593346ea824946669eb1cc23cb8984c2/FLAGbaba47941 [2025-04-30 10:18:35,805 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:18:35,806 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/04-mutex_07-ps_nr.i [2025-04-30 10:18:35,818 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84e57cbb8/593346ea824946669eb1cc23cb8984c2/FLAGbaba47941 [2025-04-30 10:18:36,585 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84e57cbb8/593346ea824946669eb1cc23cb8984c2 [2025-04-30 10:18:36,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:18:36,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:18:36,588 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:18:36,588 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:18:36,591 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:18:36,592 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:18:36" (1/1) ... [2025-04-30 10:18:36,592 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@123d58af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:36, skipping insertion in model container [2025-04-30 10:18:36,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:18:36" (1/1) ... [2025-04-30 10:18:36,613 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:18:36,937 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:18:36,946 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:18:36,995 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:18:37,038 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:18:37,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:37 WrapperNode [2025-04-30 10:18:37,039 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:18:37,040 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:18:37,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:18:37,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:18:37,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:37" (1/1) ... [2025-04-30 10:18:37,058 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:37" (1/1) ... [2025-04-30 10:18:37,076 INFO L138 Inliner]: procedures = 266, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2025-04-30 10:18:37,076 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:18:37,077 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:18:37,077 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:18:37,077 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:18:37,082 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:37" (1/1) ... [2025-04-30 10:18:37,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:37" (1/1) ... [2025-04-30 10:18:37,086 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:37" (1/1) ... [2025-04-30 10:18:37,096 INFO L175 MemorySlicer]: Split 5 memory accesses to 1 slices as follows [5]. 100 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [5]. The 0 writes are split as follows [0]. [2025-04-30 10:18:37,096 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:37" (1/1) ... [2025-04-30 10:18:37,096 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:37" (1/1) ... [2025-04-30 10:18:37,102 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:37" (1/1) ... [2025-04-30 10:18:37,103 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:37" (1/1) ... [2025-04-30 10:18:37,106 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:37" (1/1) ... [2025-04-30 10:18:37,107 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:37" (1/1) ... [2025-04-30 10:18:37,108 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:37" (1/1) ... [2025-04-30 10:18:37,113 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:18:37,114 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:18:37,114 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:18:37,114 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:18:37,119 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:37" (1/1) ... [2025-04-30 10:18:37,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:18:37,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:18:37,149 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-04-30 10:18:37,151 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-04-30 10:18:37,167 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:18:37,168 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:18:37,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:18:37,168 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-30 10:18:37,168 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-30 10:18:37,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:18:37,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:18:37,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:18:37,169 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:18:37,253 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:18:37,254 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:18:37,374 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:18:37,374 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:18:37,433 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:18:37,434 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:18:37,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:18:37 BoogieIcfgContainer [2025-04-30 10:18:37,434 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:18:37,435 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:18:37,435 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:18:37,439 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:18:37,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:18:36" (1/3) ... [2025-04-30 10:18:37,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65e46033 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:18:37, skipping insertion in model container [2025-04-30 10:18:37,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:37" (2/3) ... [2025-04-30 10:18:37,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65e46033 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:18:37, skipping insertion in model container [2025-04-30 10:18:37,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:18:37" (3/3) ... [2025-04-30 10:18:37,441 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_07-ps_nr.i [2025-04-30 10:18:37,451 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:18:37,452 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_07-ps_nr.i that has 2 procedures, 26 locations, 27 edges, 1 initial locations, 0 loop locations, and 4 error locations. [2025-04-30 10:18:37,453 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:18:37,484 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:18:37,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 60 flow [2025-04-30 10:18:37,532 INFO L116 PetriNetUnfolderBase]: 3/27 cut-off events. [2025-04-30 10:18:37,534 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:18:37,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 27 events. 3/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 56 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-04-30 10:18:37,536 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 28 transitions, 60 flow [2025-04-30 10:18:37,537 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 27 transitions, 57 flow [2025-04-30 10:18:37,542 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:18:37,550 INFO L340 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;@47be4853, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:18:37,550 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-30 10:18:37,554 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:18:37,554 INFO L116 PetriNetUnfolderBase]: 1/12 cut-off events. [2025-04-30 10:18:37,554 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:18:37,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:37,555 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-30 10:18:37,555 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:18:37,559 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:37,560 INFO L85 PathProgramCache]: Analyzing trace with hash 955312178, now seen corresponding path program 1 times [2025-04-30 10:18:37,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:37,565 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065250721] [2025-04-30 10:18:37,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:37,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:37,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:18:37,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-30 10:18:37,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:37,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:37,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:18:37,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:37,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065250721] [2025-04-30 10:18:37,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065250721] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:37,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:37,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:18:37,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35819817] [2025-04-30 10:18:37,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:37,794 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:18:37,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:37,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:18:37,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:18:37,828 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 28 [2025-04-30 10:18:37,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 57 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-04-30 10:18:37,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:37,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 28 [2025-04-30 10:18:37,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:37,952 INFO L116 PetriNetUnfolderBase]: 91/219 cut-off events. [2025-04-30 10:18:37,952 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:18:37,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 219 events. 91/219 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 953 event pairs, 31 based on Foata normal form. 11/200 useless extension candidates. Maximal degree in co-relation 391. Up to 81 conditions per place. [2025-04-30 10:18:37,956 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 29 selfloop transitions, 6 changer transitions 4/49 dead transitions. [2025-04-30 10:18:37,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 49 transitions, 179 flow [2025-04-30 10:18:37,957 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:18:37,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-30 10:18:37,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2025-04-30 10:18:37,966 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2025-04-30 10:18:37,967 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 57 flow. Second operand 5 states and 96 transitions. [2025-04-30 10:18:37,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 49 transitions, 179 flow [2025-04-30 10:18:37,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 49 transitions, 178 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:18:37,975 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 94 flow [2025-04-30 10:18:37,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2025-04-30 10:18:37,981 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 7 predicate places. [2025-04-30 10:18:37,981 INFO L485 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 94 flow [2025-04-30 10:18:37,981 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-04-30 10:18:37,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:37,981 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:37,981 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:18:37,981 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:18:37,982 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:37,982 INFO L85 PathProgramCache]: Analyzing trace with hash -459158278, now seen corresponding path program 1 times [2025-04-30 10:18:37,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:37,982 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916573258] [2025-04-30 10:18:37,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:37,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:37,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:18:38,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:18:38,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:38,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:38,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:18:38,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:38,035 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916573258] [2025-04-30 10:18:38,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916573258] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:38,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:38,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:18:38,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366323731] [2025-04-30 10:18:38,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:38,036 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:18:38,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:38,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:18:38,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:18:38,041 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 28 [2025-04-30 10:18:38,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-04-30 10:18:38,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:38,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 28 [2025-04-30 10:18:38,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:38,125 INFO L116 PetriNetUnfolderBase]: 91/241 cut-off events. [2025-04-30 10:18:38,125 INFO L117 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2025-04-30 10:18:38,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 241 events. 91/241 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1106 event pairs, 49 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 530. Up to 135 conditions per place. [2025-04-30 10:18:38,129 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 26 selfloop transitions, 4 changer transitions 3/41 dead transitions. [2025-04-30 10:18:38,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 41 transitions, 192 flow [2025-04-30 10:18:38,130 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:18:38,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:18:38,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-04-30 10:18:38,131 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-04-30 10:18:38,131 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 94 flow. Second operand 3 states and 56 transitions. [2025-04-30 10:18:38,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 41 transitions, 192 flow [2025-04-30 10:18:38,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 41 transitions, 192 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:18:38,134 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 126 flow [2025-04-30 10:18:38,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2025-04-30 10:18:38,135 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 11 predicate places. [2025-04-30 10:18:38,135 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 126 flow [2025-04-30 10:18:38,135 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-04-30 10:18:38,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:38,135 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:38,136 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:18:38,136 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:18:38,138 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:38,138 INFO L85 PathProgramCache]: Analyzing trace with hash -450093366, now seen corresponding path program 1 times [2025-04-30 10:18:38,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:38,138 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550182820] [2025-04-30 10:18:38,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:38,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:38,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:18:38,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:18:38,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:38,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:38,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:18:38,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:38,218 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550182820] [2025-04-30 10:18:38,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550182820] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:38,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:38,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:18:38,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670618889] [2025-04-30 10:18:38,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:38,219 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:18:38,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:38,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:18:38,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:18:38,224 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 28 [2025-04-30 10:18:38,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-04-30 10:18:38,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:38,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 28 [2025-04-30 10:18:38,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:38,307 INFO L116 PetriNetUnfolderBase]: 67/191 cut-off events. [2025-04-30 10:18:38,307 INFO L117 PetriNetUnfolderBase]: For 133/144 co-relation queries the response was YES. [2025-04-30 10:18:38,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 191 events. 67/191 cut-off events. For 133/144 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 840 event pairs, 21 based on Foata normal form. 17/205 useless extension candidates. Maximal degree in co-relation 476. Up to 99 conditions per place. [2025-04-30 10:18:38,308 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 27 selfloop transitions, 5 changer transitions 8/50 dead transitions. [2025-04-30 10:18:38,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 50 transitions, 256 flow [2025-04-30 10:18:38,312 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:18:38,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-30 10:18:38,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2025-04-30 10:18:38,313 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6642857142857143 [2025-04-30 10:18:38,313 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 126 flow. Second operand 5 states and 93 transitions. [2025-04-30 10:18:38,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 50 transitions, 256 flow [2025-04-30 10:18:38,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 238 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-30 10:18:38,315 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 107 flow [2025-04-30 10:18:38,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2025-04-30 10:18:38,316 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 12 predicate places. [2025-04-30 10:18:38,316 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 107 flow [2025-04-30 10:18:38,316 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-04-30 10:18:38,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:38,316 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:38,316 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:18:38,318 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:18:38,319 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:38,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1350540546, now seen corresponding path program 1 times [2025-04-30 10:18:38,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:38,319 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124345429] [2025-04-30 10:18:38,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:38,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:38,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:18:38,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:18:38,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:38,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:38,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:18:38,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:38,371 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124345429] [2025-04-30 10:18:38,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124345429] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:38,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:38,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:18:38,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401502209] [2025-04-30 10:18:38,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:38,371 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:18:38,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:38,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:18:38,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:18:38,379 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 28 [2025-04-30 10:18:38,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:18:38,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:38,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 28 [2025-04-30 10:18:38,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:38,432 INFO L116 PetriNetUnfolderBase]: 49/148 cut-off events. [2025-04-30 10:18:38,432 INFO L117 PetriNetUnfolderBase]: For 120/122 co-relation queries the response was YES. [2025-04-30 10:18:38,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366 conditions, 148 events. 49/148 cut-off events. For 120/122 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 637 event pairs, 17 based on Foata normal form. 7/151 useless extension candidates. Maximal degree in co-relation 350. Up to 44 conditions per place. [2025-04-30 10:18:38,435 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 24 selfloop transitions, 7 changer transitions 2/43 dead transitions. [2025-04-30 10:18:38,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 217 flow [2025-04-30 10:18:38,436 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:18:38,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-30 10:18:38,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2025-04-30 10:18:38,438 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6214285714285714 [2025-04-30 10:18:38,438 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 107 flow. Second operand 5 states and 87 transitions. [2025-04-30 10:18:38,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 217 flow [2025-04-30 10:18:38,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 43 transitions, 198 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-30 10:18:38,439 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 141 flow [2025-04-30 10:18:38,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=141, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2025-04-30 10:18:38,440 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 16 predicate places. [2025-04-30 10:18:38,440 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 141 flow [2025-04-30 10:18:38,440 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:18:38,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:38,440 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:38,440 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:18:38,440 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:18:38,442 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:38,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1082916209, now seen corresponding path program 1 times [2025-04-30 10:18:38,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:38,442 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377533397] [2025-04-30 10:18:38,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:38,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:38,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:18:38,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:18:38,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:38,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:38,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:18:38,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:38,489 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377533397] [2025-04-30 10:18:38,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377533397] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:38,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:38,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:18:38,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78626713] [2025-04-30 10:18:38,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:38,489 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:18:38,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:38,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:18:38,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:18:38,494 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 28 [2025-04-30 10:18:38,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 141 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:18:38,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:38,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 28 [2025-04-30 10:18:38,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:38,578 INFO L116 PetriNetUnfolderBase]: 43/139 cut-off events. [2025-04-30 10:18:38,578 INFO L117 PetriNetUnfolderBase]: For 139/141 co-relation queries the response was YES. [2025-04-30 10:18:38,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 139 events. 43/139 cut-off events. For 139/141 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 589 event pairs, 16 based on Foata normal form. 7/142 useless extension candidates. Maximal degree in co-relation 346. Up to 52 conditions per place. [2025-04-30 10:18:38,581 INFO L140 encePairwiseOnDemand]: 21/28 looper letters, 22 selfloop transitions, 7 changer transitions 4/43 dead transitions. [2025-04-30 10:18:38,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 43 transitions, 232 flow [2025-04-30 10:18:38,582 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:18:38,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-30 10:18:38,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2025-04-30 10:18:38,582 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6357142857142857 [2025-04-30 10:18:38,582 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 141 flow. Second operand 5 states and 89 transitions. [2025-04-30 10:18:38,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 43 transitions, 232 flow [2025-04-30 10:18:38,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 43 transitions, 229 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:18:38,584 INFO L231 Difference]: Finished difference. Result has 47 places, 30 transitions, 139 flow [2025-04-30 10:18:38,584 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=47, PETRI_TRANSITIONS=30} [2025-04-30 10:18:38,584 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 19 predicate places. [2025-04-30 10:18:38,584 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 30 transitions, 139 flow [2025-04-30 10:18:38,585 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:18:38,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:38,585 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:38,585 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:18:38,585 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:18:38,585 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:38,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1316296367, now seen corresponding path program 1 times [2025-04-30 10:18:38,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:38,585 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928728671] [2025-04-30 10:18:38,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:38,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:38,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:18:38,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:18:38,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:38,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:38,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:18:38,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:38,667 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928728671] [2025-04-30 10:18:38,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928728671] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:38,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:38,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:18:38,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500556842] [2025-04-30 10:18:38,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:38,667 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:18:38,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:38,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:18:38,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:18:38,668 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 28 [2025-04-30 10:18:38,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 30 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-04-30 10:18:38,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:38,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 28 [2025-04-30 10:18:38,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:38,696 INFO L116 PetriNetUnfolderBase]: 16/82 cut-off events. [2025-04-30 10:18:38,696 INFO L117 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-04-30 10:18:38,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 82 events. 16/82 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 247 event pairs, 4 based on Foata normal form. 10/90 useless extension candidates. Maximal degree in co-relation 201. Up to 40 conditions per place. [2025-04-30 10:18:38,696 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 16 selfloop transitions, 4 changer transitions 3/34 dead transitions. [2025-04-30 10:18:38,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 34 transitions, 199 flow [2025-04-30 10:18:38,697 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:18:38,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:18:38,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2025-04-30 10:18:38,697 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2025-04-30 10:18:38,697 INFO L175 Difference]: Start difference. First operand has 47 places, 30 transitions, 139 flow. Second operand 3 states and 60 transitions. [2025-04-30 10:18:38,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 34 transitions, 199 flow [2025-04-30 10:18:38,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 34 transitions, 175 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-04-30 10:18:38,698 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 117 flow [2025-04-30 10:18:38,699 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2025-04-30 10:18:38,699 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 16 predicate places. [2025-04-30 10:18:38,699 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 117 flow [2025-04-30 10:18:38,699 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-04-30 10:18:38,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:38,699 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:38,699 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:18:38,699 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:18:38,700 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:38,700 INFO L85 PathProgramCache]: Analyzing trace with hash -899599102, now seen corresponding path program 1 times [2025-04-30 10:18:38,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:38,700 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789607750] [2025-04-30 10:18:38,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:38,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:38,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:18:38,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:18:38,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:38,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:38,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:18:38,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:38,753 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789607750] [2025-04-30 10:18:38,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789607750] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:38,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:38,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:18:38,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918796534] [2025-04-30 10:18:38,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:38,754 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:18:38,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:38,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:18:38,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:18:38,765 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 28 [2025-04-30 10:18:38,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 117 flow. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-04-30 10:18:38,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:38,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 28 [2025-04-30 10:18:38,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:38,828 INFO L116 PetriNetUnfolderBase]: 19/81 cut-off events. [2025-04-30 10:18:38,828 INFO L117 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-04-30 10:18:38,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 81 events. 19/81 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 234 event pairs, 8 based on Foata normal form. 2/82 useless extension candidates. Maximal degree in co-relation 205. Up to 24 conditions per place. [2025-04-30 10:18:38,829 INFO L140 encePairwiseOnDemand]: 21/28 looper letters, 21 selfloop transitions, 6 changer transitions 3/37 dead transitions. [2025-04-30 10:18:38,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 37 transitions, 202 flow [2025-04-30 10:18:38,829 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:18:38,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:18:38,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2025-04-30 10:18:38,830 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47959183673469385 [2025-04-30 10:18:38,830 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 117 flow. Second operand 7 states and 94 transitions. [2025-04-30 10:18:38,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 37 transitions, 202 flow [2025-04-30 10:18:38,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 37 transitions, 188 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-30 10:18:38,831 INFO L231 Difference]: Finished difference. Result has 47 places, 27 transitions, 117 flow [2025-04-30 10:18:38,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=117, PETRI_PLACES=47, PETRI_TRANSITIONS=27} [2025-04-30 10:18:38,832 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 19 predicate places. [2025-04-30 10:18:38,832 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 27 transitions, 117 flow [2025-04-30 10:18:38,832 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-04-30 10:18:38,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:38,832 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:38,832 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:18:38,832 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:18:38,833 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:38,833 INFO L85 PathProgramCache]: Analyzing trace with hash -245857133, now seen corresponding path program 1 times [2025-04-30 10:18:38,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:38,833 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745235206] [2025-04-30 10:18:38,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:38,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:38,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:18:38,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:18:38,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:38,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:38,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:18:38,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:38,896 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745235206] [2025-04-30 10:18:38,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745235206] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:38,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:38,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:18:38,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556299869] [2025-04-30 10:18:38,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:38,897 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:18:38,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:38,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:18:38,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:18:38,910 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 28 [2025-04-30 10:18:38,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 27 transitions, 117 flow. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-04-30 10:18:38,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:38,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 28 [2025-04-30 10:18:38,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:38,980 INFO L116 PetriNetUnfolderBase]: 18/77 cut-off events. [2025-04-30 10:18:38,980 INFO L117 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2025-04-30 10:18:38,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 77 events. 18/77 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 220 event pairs, 5 based on Foata normal form. 2/78 useless extension candidates. Maximal degree in co-relation 186. Up to 24 conditions per place. [2025-04-30 10:18:38,980 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 12 selfloop transitions, 7 changer transitions 16/40 dead transitions. [2025-04-30 10:18:38,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 40 transitions, 219 flow [2025-04-30 10:18:38,980 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:18:38,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-30 10:18:38,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2025-04-30 10:18:38,981 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2025-04-30 10:18:38,981 INFO L175 Difference]: Start difference. First operand has 47 places, 27 transitions, 117 flow. Second operand 10 states and 124 transitions. [2025-04-30 10:18:38,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 40 transitions, 219 flow [2025-04-30 10:18:38,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 40 transitions, 201 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-04-30 10:18:38,982 INFO L231 Difference]: Finished difference. Result has 49 places, 21 transitions, 86 flow [2025-04-30 10:18:38,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=86, PETRI_PLACES=49, PETRI_TRANSITIONS=21} [2025-04-30 10:18:38,983 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 21 predicate places. [2025-04-30 10:18:38,983 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 21 transitions, 86 flow [2025-04-30 10:18:38,983 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-04-30 10:18:38,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:38,983 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:38,983 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:18:38,983 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:18:38,983 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:38,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1010660072, now seen corresponding path program 1 times [2025-04-30 10:18:38,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:38,983 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823927151] [2025-04-30 10:18:38,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:38,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:38,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:18:38,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:18:38,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:38,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:39,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:18:39,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:39,046 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823927151] [2025-04-30 10:18:39,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823927151] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:39,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:39,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:18:39,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504309266] [2025-04-30 10:18:39,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:39,046 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:18:39,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:39,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:18:39,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:18:39,056 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 28 [2025-04-30 10:18:39,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 21 transitions, 86 flow. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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-04-30 10:18:39,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:39,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 28 [2025-04-30 10:18:39,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:39,105 INFO L116 PetriNetUnfolderBase]: 4/29 cut-off events. [2025-04-30 10:18:39,105 INFO L117 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-04-30 10:18:39,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 29 events. 4/29 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 1 based on Foata normal form. 2/30 useless extension candidates. Maximal degree in co-relation 66. Up to 8 conditions per place. [2025-04-30 10:18:39,106 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 10 selfloop transitions, 7 changer transitions 1/23 dead transitions. [2025-04-30 10:18:39,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 23 transitions, 125 flow [2025-04-30 10:18:39,106 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:18:39,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-30 10:18:39,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2025-04-30 10:18:39,106 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2025-04-30 10:18:39,107 INFO L175 Difference]: Start difference. First operand has 49 places, 21 transitions, 86 flow. Second operand 8 states and 92 transitions. [2025-04-30 10:18:39,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 23 transitions, 125 flow [2025-04-30 10:18:39,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 23 transitions, 99 flow, removed 2 selfloop flow, removed 10 redundant places. [2025-04-30 10:18:39,107 INFO L231 Difference]: Finished difference. Result has 32 places, 20 transitions, 67 flow [2025-04-30 10:18:39,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=47, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=67, PETRI_PLACES=32, PETRI_TRANSITIONS=20} [2025-04-30 10:18:39,108 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 4 predicate places. [2025-04-30 10:18:39,108 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 20 transitions, 67 flow [2025-04-30 10:18:39,108 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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-04-30 10:18:39,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:39,108 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:39,108 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:18:39,108 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:18:39,108 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:39,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1101046572, now seen corresponding path program 1 times [2025-04-30 10:18:39,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:39,108 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891886061] [2025-04-30 10:18:39,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:39,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:39,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:18:39,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:18:39,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:39,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:39,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:18:39,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:39,165 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891886061] [2025-04-30 10:18:39,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891886061] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:39,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:39,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:18:39,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373384117] [2025-04-30 10:18:39,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:39,165 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:18:39,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:39,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:18:39,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:18:39,175 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 28 [2025-04-30 10:18:39,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 20 transitions, 67 flow. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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-04-30 10:18:39,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:39,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 28 [2025-04-30 10:18:39,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:39,223 INFO L116 PetriNetUnfolderBase]: 3/26 cut-off events. [2025-04-30 10:18:39,223 INFO L117 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-04-30 10:18:39,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 26 events. 3/26 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 1 based on Foata normal form. 2/27 useless extension candidates. Maximal degree in co-relation 52. Up to 8 conditions per place. [2025-04-30 10:18:39,223 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 0 selfloop transitions, 0 changer transitions 21/21 dead transitions. [2025-04-30 10:18:39,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 21 transitions, 101 flow [2025-04-30 10:18:39,224 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:18:39,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-30 10:18:39,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2025-04-30 10:18:39,224 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4017857142857143 [2025-04-30 10:18:39,224 INFO L175 Difference]: Start difference. First operand has 32 places, 20 transitions, 67 flow. Second operand 8 states and 90 transitions. [2025-04-30 10:18:39,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 21 transitions, 101 flow [2025-04-30 10:18:39,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 21 transitions, 90 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-30 10:18:39,225 INFO L231 Difference]: Finished difference. Result has 32 places, 0 transitions, 0 flow [2025-04-30 10:18:39,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=32, PETRI_TRANSITIONS=0} [2025-04-30 10:18:39,225 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 4 predicate places. [2025-04-30 10:18:39,225 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 0 transitions, 0 flow [2025-04-30 10:18:39,226 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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-04-30 10:18:39,227 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 7 remaining) [2025-04-30 10:18:39,228 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 7 remaining) [2025-04-30 10:18:39,228 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-30 10:18:39,228 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 7 remaining) [2025-04-30 10:18:39,228 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 7 remaining) [2025-04-30 10:18:39,228 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 7 remaining) [2025-04-30 10:18:39,228 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 7 remaining) [2025-04-30 10:18:39,228 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:18:39,228 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:39,232 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-30 10:18:39,232 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:18:39,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:18:39 BasicIcfg [2025-04-30 10:18:39,235 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:18:39,236 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:18:39,236 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:18:39,236 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:18:39,237 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:18:37" (3/4) ... [2025-04-30 10:18:39,238 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-30 10:18:39,240 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-04-30 10:18:39,242 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2025-04-30 10:18:39,242 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-04-30 10:18:39,242 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-04-30 10:18:39,286 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:18:39,287 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:18:39,287 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:18:39,287 INFO L158 Benchmark]: Toolchain (without parser) took 2699.93ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 82.3MB in the end (delta: 29.0MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2025-04-30 10:18:39,288 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:18:39,288 INFO L158 Benchmark]: CACSL2BoogieTranslator took 450.78ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 81.1MB in the end (delta: 30.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-04-30 10:18:39,288 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.53ms. Allocated memory is still 142.6MB. Free memory was 81.1MB in the beginning and 78.5MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:18:39,288 INFO L158 Benchmark]: Boogie Preprocessor took 36.76ms. Allocated memory is still 142.6MB. Free memory was 78.5MB in the beginning and 77.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:18:39,288 INFO L158 Benchmark]: RCFGBuilder took 320.01ms. Allocated memory is still 142.6MB. Free memory was 77.0MB in the beginning and 57.8MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:18:39,288 INFO L158 Benchmark]: TraceAbstraction took 1800.07ms. Allocated memory is still 142.6MB. Free memory was 57.4MB in the beginning and 88.4MB in the end (delta: -31.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:18:39,288 INFO L158 Benchmark]: Witness Printer took 51.03ms. Allocated memory is still 142.6MB. Free memory was 88.4MB in the beginning and 82.3MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:18:39,289 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.13ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 450.78ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 81.1MB in the end (delta: 30.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.53ms. Allocated memory is still 142.6MB. Free memory was 81.1MB in the beginning and 78.5MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.76ms. Allocated memory is still 142.6MB. Free memory was 78.5MB in the beginning and 77.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 320.01ms. Allocated memory is still 142.6MB. Free memory was 77.0MB in the beginning and 57.8MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1800.07ms. Allocated memory is still 142.6MB. Free memory was 57.4MB in the beginning and 88.4MB in the end (delta: -31.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 51.03ms. Allocated memory is still 142.6MB. Free memory was 88.4MB in the beginning and 82.3MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 945]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 945]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 932]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 932]: 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 3 procedures, 37 locations, 38 edges, 7 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: 1.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 252 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 213 mSDsluCounter, 81 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 591 IncrementalHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 20 mSDtfsCounter, 591 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=4, InterpolantAutomatonStates: 59, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 112 NumberOfCodeBlocks, 112 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 102 ConstructedInterpolants, 0 QuantifiedInterpolants, 292 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 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 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-30 10:18:39,300 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