./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 44a70169ef8abd67c211072db1308f16df00422231dd8f14aa88bc39d0b023bb --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:54:03,951 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:54:03,990 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 13:54:03,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:54:03,993 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:54:04,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:54:04,008 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:54:04,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:54:04,008 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:54:04,008 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:54:04,008 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:54:04,008 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:54:04,008 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:54:04,008 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:54:04,009 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:54:04,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:54:04,010 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:54:04,010 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 13:54:04,010 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:54:04,010 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 13:54:04,010 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:54:04,010 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:54:04,010 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:54:04,010 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:54:04,010 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:54:04,010 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:54:04,010 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 13:54:04,010 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:54:04,010 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:54:04,010 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:54:04,010 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:54:04,010 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:54:04,010 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:54:04,010 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:54:04,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:54:04,011 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:54:04,011 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:54:04,011 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:54:04,011 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:54:04,011 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:54:04,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:54:04,011 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:54:04,011 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:54:04,011 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:54:04,011 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:54:04,011 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 44a70169ef8abd67c211072db1308f16df00422231dd8f14aa88bc39d0b023bb [2025-02-08 13:54:04,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:54:04,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:54:04,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:54:04,250 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:54:04,250 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:54:04,252 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i [2025-02-08 13:54:05,443 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e3e3ce5d4/97a92485009c4d669e0214b8eab3e6d3/FLAGbe7dc86a8 [2025-02-08 13:54:05,751 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:54:05,751 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i [2025-02-08 13:54:05,764 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e3e3ce5d4/97a92485009c4d669e0214b8eab3e6d3/FLAGbe7dc86a8 [2025-02-08 13:54:05,780 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e3e3ce5d4/97a92485009c4d669e0214b8eab3e6d3 [2025-02-08 13:54:05,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:54:05,784 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:54:05,785 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:54:05,785 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:54:05,788 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:54:05,789 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:54:05" (1/1) ... [2025-02-08 13:54:05,790 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1714d5dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:05, skipping insertion in model container [2025-02-08 13:54:05,790 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:54:05" (1/1) ... [2025-02-08 13:54:05,820 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:54:06,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:54:06,052 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:54:06,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:54:06,140 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:54:06,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:06 WrapperNode [2025-02-08 13:54:06,141 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:54:06,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:54:06,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:54:06,142 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:54:06,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:06" (1/1) ... [2025-02-08 13:54:06,157 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:06" (1/1) ... [2025-02-08 13:54:06,176 INFO L138 Inliner]: procedures = 164, calls = 26, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 80 [2025-02-08 13:54:06,178 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:54:06,179 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:54:06,179 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:54:06,179 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:54:06,185 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:06" (1/1) ... [2025-02-08 13:54:06,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:06" (1/1) ... [2025-02-08 13:54:06,187 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:06" (1/1) ... [2025-02-08 13:54:06,202 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6]. The 0 writes are split as follows [0, 0, 0]. [2025-02-08 13:54:06,203 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:06" (1/1) ... [2025-02-08 13:54:06,203 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:06" (1/1) ... [2025-02-08 13:54:06,211 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:06" (1/1) ... [2025-02-08 13:54:06,211 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:06" (1/1) ... [2025-02-08 13:54:06,212 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:06" (1/1) ... [2025-02-08 13:54:06,213 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:06" (1/1) ... [2025-02-08 13:54:06,214 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:54:06,215 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:54:06,218 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:54:06,218 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:54:06,219 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:06" (1/1) ... [2025-02-08 13:54:06,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:54:06,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:54:06,248 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 13:54:06,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 13:54:06,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 13:54:06,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 13:54:06,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 13:54:06,271 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-08 13:54:06,271 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-08 13:54:06,272 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 13:54:06,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:54:06,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 13:54:06,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 13:54:06,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 13:54:06,272 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 13:54:06,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:54:06,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:54:06,274 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 13:54:06,374 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:54:06,376 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:54:06,532 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 13:54:06,532 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:54:06,646 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:54:06,646 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:54:06,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:54:06 BoogieIcfgContainer [2025-02-08 13:54:06,646 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:54:06,648 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:54:06,648 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:54:06,651 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:54:06,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:54:05" (1/3) ... [2025-02-08 13:54:06,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff51278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:54:06, skipping insertion in model container [2025-02-08 13:54:06,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:06" (2/3) ... [2025-02-08 13:54:06,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff51278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:54:06, skipping insertion in model container [2025-02-08 13:54:06,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:54:06" (3/3) ... [2025-02-08 13:54:06,652 INFO L128 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt-zero.i [2025-02-08 13:54:06,662 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:54:06,663 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 11_fmaxsymopt-zero.i that has 2 procedures, 23 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-02-08 13:54:06,663 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 13:54:06,688 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 13:54:06,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 25 transitions, 54 flow [2025-02-08 13:54:06,725 INFO L124 PetriNetUnfolderBase]: 2/27 cut-off events. [2025-02-08 13:54:06,726 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 13:54:06,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 27 events. 2/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 49 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2025-02-08 13:54:06,728 INFO L82 GeneralOperation]: Start removeDead. Operand has 26 places, 25 transitions, 54 flow [2025-02-08 13:54:06,730 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 25 transitions, 54 flow [2025-02-08 13:54:06,735 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:54:06,742 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3b35b048, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:54:06,742 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-02-08 13:54:06,746 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 13:54:06,746 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-02-08 13:54:06,747 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 13:54:06,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:06,747 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:54:06,747 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-02-08 13:54:06,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:06,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1995502024, now seen corresponding path program 1 times [2025-02-08 13:54:06,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:06,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267808774] [2025-02-08 13:54:06,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:06,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:06,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:54:06,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:54:06,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:06,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 13:54:06,825 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 13:54:06,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:54:06,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:54:06,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:06,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 13:54:06,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 13:54:06,855 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 13:54:06,856 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-02-08 13:54:06,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 9 remaining) [2025-02-08 13:54:06,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 9 remaining) [2025-02-08 13:54:06,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 9 remaining) [2025-02-08 13:54:06,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 9 remaining) [2025-02-08 13:54:06,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 9 remaining) [2025-02-08 13:54:06,859 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 9 remaining) [2025-02-08 13:54:06,859 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 9 remaining) [2025-02-08 13:54:06,860 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 9 remaining) [2025-02-08 13:54:06,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:54:06,860 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-02-08 13:54:06,862 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 13:54:06,863 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 13:54:06,884 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 13:54:06,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 45 transitions, 100 flow [2025-02-08 13:54:06,895 INFO L124 PetriNetUnfolderBase]: 4/50 cut-off events. [2025-02-08 13:54:06,896 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 13:54:06,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 50 events. 4/50 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 138 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 41. Up to 3 conditions per place. [2025-02-08 13:54:06,896 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 45 transitions, 100 flow [2025-02-08 13:54:06,897 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 45 transitions, 100 flow [2025-02-08 13:54:06,898 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:54:06,898 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3b35b048, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:54:06,898 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-02-08 13:54:06,902 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 13:54:06,902 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-02-08 13:54:06,902 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 13:54:06,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:06,902 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 13:54:06,902 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 13:54:06,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:06,903 INFO L85 PathProgramCache]: Analyzing trace with hash -967612285, now seen corresponding path program 1 times [2025-02-08 13:54:06,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:06,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643880518] [2025-02-08 13:54:06,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:06,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:06,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:54:06,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:54:06,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:06,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:07,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:07,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:07,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643880518] [2025-02-08 13:54:07,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643880518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:07,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:07,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:07,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738479845] [2025-02-08 13:54:07,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:07,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:07,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:07,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:07,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:07,073 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 45 [2025-02-08 13:54:07,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-02-08 13:54:07,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:07,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 45 [2025-02-08 13:54:07,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:07,240 INFO L124 PetriNetUnfolderBase]: 388/845 cut-off events. [2025-02-08 13:54:07,240 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-02-08 13:54:07,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1511 conditions, 845 events. 388/845 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4832 event pairs, 144 based on Foata normal form. 81/875 useless extension candidates. Maximal degree in co-relation 1294. Up to 517 conditions per place. [2025-02-08 13:54:07,248 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 31 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2025-02-08 13:54:07,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 52 transitions, 185 flow [2025-02-08 13:54:07,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:07,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:07,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2025-02-08 13:54:07,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7111111111111111 [2025-02-08 13:54:07,261 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 100 flow. Second operand 3 states and 96 transitions. [2025-02-08 13:54:07,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 52 transitions, 185 flow [2025-02-08 13:54:07,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 52 transitions, 185 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 13:54:07,267 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 96 flow [2025-02-08 13:54:07,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2025-02-08 13:54:07,272 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places. [2025-02-08 13:54:07,272 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 96 flow [2025-02-08 13:54:07,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-02-08 13:54:07,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:07,272 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:07,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 13:54:07,273 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 13:54:07,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:07,273 INFO L85 PathProgramCache]: Analyzing trace with hash 68790480, now seen corresponding path program 1 times [2025-02-08 13:54:07,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:07,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342407433] [2025-02-08 13:54:07,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:07,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:07,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:54:07,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:54:07,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:07,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:07,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:07,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:07,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342407433] [2025-02-08 13:54:07,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342407433] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:07,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:07,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:07,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424775273] [2025-02-08 13:54:07,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:07,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:07,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:07,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:07,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:07,389 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 45 [2025-02-08 13:54:07,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-02-08 13:54:07,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:07,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 45 [2025-02-08 13:54:07,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:07,503 INFO L124 PetriNetUnfolderBase]: 345/763 cut-off events. [2025-02-08 13:54:07,504 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-02-08 13:54:07,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1411 conditions, 763 events. 345/763 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4225 event pairs, 126 based on Foata normal form. 27/745 useless extension candidates. Maximal degree in co-relation 1202. Up to 447 conditions per place. [2025-02-08 13:54:07,509 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 30 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2025-02-08 13:54:07,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 51 transitions, 185 flow [2025-02-08 13:54:07,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:07,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:07,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-02-08 13:54:07,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-02-08 13:54:07,511 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 96 flow. Second operand 3 states and 90 transitions. [2025-02-08 13:54:07,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 51 transitions, 185 flow [2025-02-08 13:54:07,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 51 transitions, 181 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:07,513 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 94 flow [2025-02-08 13:54:07,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2025-02-08 13:54:07,514 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -1 predicate places. [2025-02-08 13:54:07,514 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 94 flow [2025-02-08 13:54:07,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-02-08 13:54:07,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:07,514 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-02-08 13:54:07,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:54:07,514 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 13:54:07,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:07,515 INFO L85 PathProgramCache]: Analyzing trace with hash 747198217, now seen corresponding path program 1 times [2025-02-08 13:54:07,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:07,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013207623] [2025-02-08 13:54:07,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:07,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:07,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 13:54:07,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 13:54:07,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:07,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 13:54:07,529 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 13:54:07,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 13:54:07,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 13:54:07,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:07,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 13:54:07,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 13:54:07,552 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 13:54:07,552 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-02-08 13:54:07,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-02-08 13:54:07,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-02-08 13:54:07,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-02-08 13:54:07,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-02-08 13:54:07,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-02-08 13:54:07,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-02-08 13:54:07,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-02-08 13:54:07,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-02-08 13:54:07,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-02-08 13:54:07,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-02-08 13:54:07,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-02-08 13:54:07,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-02-08 13:54:07,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 13:54:07,553 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 13:54:07,554 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 13:54:07,554 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 13:54:07,591 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 13:54:07,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 65 transitions, 148 flow [2025-02-08 13:54:07,600 INFO L124 PetriNetUnfolderBase]: 6/73 cut-off events. [2025-02-08 13:54:07,600 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 13:54:07,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 73 events. 6/73 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 245 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 60. Up to 4 conditions per place. [2025-02-08 13:54:07,601 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 65 transitions, 148 flow [2025-02-08 13:54:07,602 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 65 transitions, 148 flow [2025-02-08 13:54:07,602 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:54:07,603 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3b35b048, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:54:07,603 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-02-08 13:54:07,606 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 13:54:07,606 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-02-08 13:54:07,607 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 13:54:07,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:07,607 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 13:54:07,607 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 13:54:07,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:07,608 INFO L85 PathProgramCache]: Analyzing trace with hash 955878384, now seen corresponding path program 1 times [2025-02-08 13:54:07,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:07,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956112681] [2025-02-08 13:54:07,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:07,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:07,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:54:07,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:54:07,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:07,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:07,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:07,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:07,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956112681] [2025-02-08 13:54:07,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956112681] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:07,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:07,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:07,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10929441] [2025-02-08 13:54:07,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:07,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:07,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:07,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:07,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:07,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 65 [2025-02-08 13:54:07,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 65 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-02-08 13:54:07,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:07,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 65 [2025-02-08 13:54:07,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:08,393 INFO L124 PetriNetUnfolderBase]: 5068/9227 cut-off events. [2025-02-08 13:54:08,393 INFO L125 PetriNetUnfolderBase]: For 475/475 co-relation queries the response was YES. [2025-02-08 13:54:08,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16590 conditions, 9227 events. 5068/9227 cut-off events. For 475/475 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 73930 event pairs, 806 based on Foata normal form. 897/9659 useless extension candidates. Maximal degree in co-relation 6256. Up to 5693 conditions per place. [2025-02-08 13:54:08,516 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 49 selfloop transitions, 2 changer transitions 0/80 dead transitions. [2025-02-08 13:54:08,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 80 transitions, 292 flow [2025-02-08 13:54:08,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:08,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:08,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2025-02-08 13:54:08,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7487179487179487 [2025-02-08 13:54:08,518 INFO L175 Difference]: Start difference. First operand has 66 places, 65 transitions, 148 flow. Second operand 3 states and 146 transitions. [2025-02-08 13:54:08,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 80 transitions, 292 flow [2025-02-08 13:54:08,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 80 transitions, 288 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-02-08 13:54:08,520 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 140 flow [2025-02-08 13:54:08,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2025-02-08 13:54:08,521 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 0 predicate places. [2025-02-08 13:54:08,521 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 140 flow [2025-02-08 13:54:08,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-02-08 13:54:08,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:08,521 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:08,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 13:54:08,521 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 13:54:08,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:08,522 INFO L85 PathProgramCache]: Analyzing trace with hash -432540860, now seen corresponding path program 1 times [2025-02-08 13:54:08,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:08,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149132619] [2025-02-08 13:54:08,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:08,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:08,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:54:08,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:54:08,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:08,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:08,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:08,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:08,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149132619] [2025-02-08 13:54:08,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149132619] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:08,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:08,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:08,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792830107] [2025-02-08 13:54:08,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:08,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:08,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:08,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:08,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:08,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 65 [2025-02-08 13:54:08,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-02-08 13:54:08,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:08,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 65 [2025-02-08 13:54:08,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:09,134 INFO L124 PetriNetUnfolderBase]: 4505/8445 cut-off events. [2025-02-08 13:54:09,134 INFO L125 PetriNetUnfolderBase]: For 452/452 co-relation queries the response was YES. [2025-02-08 13:54:09,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15366 conditions, 8445 events. 4505/8445 cut-off events. For 452/452 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 68459 event pairs, 806 based on Foata normal form. 219/8214 useless extension candidates. Maximal degree in co-relation 13837. Up to 4911 conditions per place. [2025-02-08 13:54:09,173 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 48 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2025-02-08 13:54:09,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 79 transitions, 288 flow [2025-02-08 13:54:09,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:09,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:09,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2025-02-08 13:54:09,174 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7076923076923077 [2025-02-08 13:54:09,174 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 140 flow. Second operand 3 states and 138 transitions. [2025-02-08 13:54:09,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 79 transitions, 288 flow [2025-02-08 13:54:09,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 79 transitions, 284 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:09,177 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 138 flow [2025-02-08 13:54:09,177 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2025-02-08 13:54:09,178 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -1 predicate places. [2025-02-08 13:54:09,178 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 138 flow [2025-02-08 13:54:09,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-02-08 13:54:09,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:09,178 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:09,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:54:09,178 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 13:54:09,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:09,178 INFO L85 PathProgramCache]: Analyzing trace with hash 4736024, now seen corresponding path program 1 times [2025-02-08 13:54:09,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:09,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422278212] [2025-02-08 13:54:09,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:09,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:09,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 13:54:09,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 13:54:09,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:09,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:09,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:09,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:09,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422278212] [2025-02-08 13:54:09,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422278212] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:09,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:09,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:09,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19380006] [2025-02-08 13:54:09,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:09,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:09,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:09,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:09,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:09,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 65 [2025-02-08 13:54:09,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-02-08 13:54:09,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:09,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 65 [2025-02-08 13:54:09,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:09,804 INFO L124 PetriNetUnfolderBase]: 5065/9185 cut-off events. [2025-02-08 13:54:09,804 INFO L125 PetriNetUnfolderBase]: For 712/712 co-relation queries the response was YES. [2025-02-08 13:54:09,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16960 conditions, 9185 events. 5065/9185 cut-off events. For 712/712 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 72930 event pairs, 824 based on Foata normal form. 216/8980 useless extension candidates. Maximal degree in co-relation 12302. Up to 5648 conditions per place. [2025-02-08 13:54:09,846 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 48 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2025-02-08 13:54:09,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 77 transitions, 283 flow [2025-02-08 13:54:09,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:09,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:09,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2025-02-08 13:54:09,847 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7076923076923077 [2025-02-08 13:54:09,847 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 138 flow. Second operand 3 states and 138 transitions. [2025-02-08 13:54:09,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 77 transitions, 283 flow [2025-02-08 13:54:09,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 77 transitions, 275 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:09,855 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 136 flow [2025-02-08 13:54:09,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2025-02-08 13:54:09,857 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -2 predicate places. [2025-02-08 13:54:09,857 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 136 flow [2025-02-08 13:54:09,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-02-08 13:54:09,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:09,857 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:09,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:54:09,857 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 13:54:09,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:09,858 INFO L85 PathProgramCache]: Analyzing trace with hash 146817071, now seen corresponding path program 1 times [2025-02-08 13:54:09,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:09,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278722405] [2025-02-08 13:54:09,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:09,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:09,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 13:54:09,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 13:54:09,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:09,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:09,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:09,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:09,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278722405] [2025-02-08 13:54:09,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278722405] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:09,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:09,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:09,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13279945] [2025-02-08 13:54:09,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:09,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:09,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:09,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:09,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:09,948 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 65 [2025-02-08 13:54:09,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-02-08 13:54:09,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:09,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 65 [2025-02-08 13:54:09,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:10,491 INFO L124 PetriNetUnfolderBase]: 4505/8409 cut-off events. [2025-02-08 13:54:10,491 INFO L125 PetriNetUnfolderBase]: For 442/442 co-relation queries the response was YES. [2025-02-08 13:54:10,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15324 conditions, 8409 events. 4505/8409 cut-off events. For 442/442 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 67540 event pairs, 824 based on Foata normal form. 216/8219 useless extension candidates. Maximal degree in co-relation 7066. Up to 4872 conditions per place. [2025-02-08 13:54:10,598 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 47 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2025-02-08 13:54:10,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 76 transitions, 275 flow [2025-02-08 13:54:10,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:10,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:10,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2025-02-08 13:54:10,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7025641025641025 [2025-02-08 13:54:10,600 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 136 flow. Second operand 3 states and 137 transitions. [2025-02-08 13:54:10,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 76 transitions, 275 flow [2025-02-08 13:54:10,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 76 transitions, 271 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:10,602 INFO L231 Difference]: Finished difference. Result has 63 places, 57 transitions, 134 flow [2025-02-08 13:54:10,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=63, PETRI_TRANSITIONS=57} [2025-02-08 13:54:10,603 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -3 predicate places. [2025-02-08 13:54:10,603 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 57 transitions, 134 flow [2025-02-08 13:54:10,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-02-08 13:54:10,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:10,603 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:10,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 13:54:10,603 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 13:54:10,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:10,604 INFO L85 PathProgramCache]: Analyzing trace with hash -922562346, now seen corresponding path program 1 times [2025-02-08 13:54:10,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:10,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134165220] [2025-02-08 13:54:10,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:10,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:10,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 13:54:10,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 13:54:10,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:10,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:10,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:10,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:10,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134165220] [2025-02-08 13:54:10,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134165220] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:10,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:10,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:54:10,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204782303] [2025-02-08 13:54:10,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:10,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:54:10,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:10,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:54:10,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:54:10,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 65 [2025-02-08 13:54:10,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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-02-08 13:54:10,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:10,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 65 [2025-02-08 13:54:10,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:11,053 INFO L124 PetriNetUnfolderBase]: 5068/8348 cut-off events. [2025-02-08 13:54:11,053 INFO L125 PetriNetUnfolderBase]: For 640/640 co-relation queries the response was YES. [2025-02-08 13:54:11,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16126 conditions, 8348 events. 5068/8348 cut-off events. For 640/640 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 58244 event pairs, 1880 based on Foata normal form. 219/7994 useless extension candidates. Maximal degree in co-relation 15770. Up to 4129 conditions per place. [2025-02-08 13:54:11,093 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 67 selfloop transitions, 4 changer transitions 0/96 dead transitions. [2025-02-08 13:54:11,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 96 transitions, 382 flow [2025-02-08 13:54:11,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:54:11,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 13:54:11,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 188 transitions. [2025-02-08 13:54:11,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7230769230769231 [2025-02-08 13:54:11,095 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 134 flow. Second operand 4 states and 188 transitions. [2025-02-08 13:54:11,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 96 transitions, 382 flow [2025-02-08 13:54:11,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 96 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:11,100 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 136 flow [2025-02-08 13:54:11,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=63, PETRI_TRANSITIONS=56} [2025-02-08 13:54:11,101 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -3 predicate places. [2025-02-08 13:54:11,101 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 136 flow [2025-02-08 13:54:11,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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-02-08 13:54:11,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:11,102 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:11,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 13:54:11,102 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 13:54:11,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:11,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1465338664, now seen corresponding path program 1 times [2025-02-08 13:54:11,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:11,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379572559] [2025-02-08 13:54:11,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:11,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:11,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:54:11,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:54:11,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:11,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:11,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:11,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:11,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379572559] [2025-02-08 13:54:11,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379572559] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:11,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:11,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:54:11,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116676305] [2025-02-08 13:54:11,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:11,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:54:11,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:11,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:54:11,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:54:11,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 65 [2025-02-08 13:54:11,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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-02-08 13:54:11,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:11,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 65 [2025-02-08 13:54:11,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:11,800 INFO L124 PetriNetUnfolderBase]: 8665/14183 cut-off events. [2025-02-08 13:54:11,801 INFO L125 PetriNetUnfolderBase]: For 1682/1682 co-relation queries the response was YES. [2025-02-08 13:54:11,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28081 conditions, 14183 events. 8665/14183 cut-off events. For 1682/1682 co-relation queries the response was YES. Maximal size of possible extension queue 701. Compared 104421 event pairs, 4594 based on Foata normal form. 219/13355 useless extension candidates. Maximal degree in co-relation 26215. Up to 7261 conditions per place. [2025-02-08 13:54:11,854 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 74 selfloop transitions, 4 changer transitions 0/103 dead transitions. [2025-02-08 13:54:11,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 103 transitions, 412 flow [2025-02-08 13:54:11,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:54:11,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 13:54:11,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2025-02-08 13:54:11,856 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-02-08 13:54:11,856 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 136 flow. Second operand 4 states and 195 transitions. [2025-02-08 13:54:11,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 103 transitions, 412 flow [2025-02-08 13:54:11,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 103 transitions, 398 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 13:54:11,864 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 155 flow [2025-02-08 13:54:11,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=155, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2025-02-08 13:54:11,865 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -1 predicate places. [2025-02-08 13:54:11,865 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 155 flow [2025-02-08 13:54:11,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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-02-08 13:54:11,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:11,865 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-02-08 13:54:11,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 13:54:11,865 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 13:54:11,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:11,866 INFO L85 PathProgramCache]: Analyzing trace with hash -2140146297, now seen corresponding path program 1 times [2025-02-08 13:54:11,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:11,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597705052] [2025-02-08 13:54:11,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:11,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:11,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:54:11,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:54:11,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:11,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 13:54:11,874 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 13:54:11,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:54:11,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:54:11,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:11,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 13:54:11,882 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 13:54:11,883 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 13:54:11,883 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-02-08 13:54:11,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-02-08 13:54:11,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-02-08 13:54:11,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-02-08 13:54:11,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-02-08 13:54:11,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-02-08 13:54:11,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-02-08 13:54:11,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-02-08 13:54:11,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-02-08 13:54:11,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-02-08 13:54:11,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-02-08 13:54:11,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-02-08 13:54:11,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-02-08 13:54:11,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-02-08 13:54:11,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-02-08 13:54:11,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-02-08 13:54:11,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-02-08 13:54:11,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 13:54:11,883 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:11,884 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 13:54:11,884 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 13:54:11,911 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 13:54:11,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 85 transitions, 198 flow [2025-02-08 13:54:11,918 INFO L124 PetriNetUnfolderBase]: 8/96 cut-off events. [2025-02-08 13:54:11,918 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 13:54:11,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 96 events. 8/96 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 341 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 85. Up to 5 conditions per place. [2025-02-08 13:54:11,919 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 85 transitions, 198 flow [2025-02-08 13:54:11,919 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 85 transitions, 198 flow [2025-02-08 13:54:11,920 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:54:11,920 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3b35b048, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:54:11,920 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-02-08 13:54:11,921 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 13:54:11,921 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-02-08 13:54:11,921 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 13:54:11,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:11,922 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 13:54:11,922 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 13:54:11,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:11,922 INFO L85 PathProgramCache]: Analyzing trace with hash -823910256, now seen corresponding path program 1 times [2025-02-08 13:54:11,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:11,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750568637] [2025-02-08 13:54:11,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:11,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:11,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:54:11,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:54:11,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:11,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:11,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:11,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:11,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750568637] [2025-02-08 13:54:11,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750568637] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:11,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:11,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:11,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450972084] [2025-02-08 13:54:11,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:11,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:11,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:11,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:11,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:11,952 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 85 [2025-02-08 13:54:11,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 85 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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-02-08 13:54:11,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:11,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 85 [2025-02-08 13:54:11,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:16,462 INFO L124 PetriNetUnfolderBase]: 56332/82179 cut-off events. [2025-02-08 13:54:16,463 INFO L125 PetriNetUnfolderBase]: For 6371/6371 co-relation queries the response was YES. [2025-02-08 13:54:16,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157511 conditions, 82179 events. 56332/82179 cut-off events. For 6371/6371 co-relation queries the response was YES. Maximal size of possible extension queue 4084. Compared 639607 event pairs, 31380 based on Foata normal form. 9153/87734 useless extension candidates. Maximal degree in co-relation 90794. Up to 57853 conditions per place. [2025-02-08 13:54:16,886 INFO L140 encePairwiseOnDemand]: 77/85 looper letters, 67 selfloop transitions, 2 changer transitions 0/108 dead transitions. [2025-02-08 13:54:16,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 108 transitions, 403 flow [2025-02-08 13:54:16,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:16,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:16,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 196 transitions. [2025-02-08 13:54:16,888 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7686274509803922 [2025-02-08 13:54:16,888 INFO L175 Difference]: Start difference. First operand has 86 places, 85 transitions, 198 flow. Second operand 3 states and 196 transitions. [2025-02-08 13:54:16,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 108 transitions, 403 flow [2025-02-08 13:54:16,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 108 transitions, 391 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-02-08 13:54:16,891 INFO L231 Difference]: Finished difference. Result has 86 places, 79 transitions, 184 flow [2025-02-08 13:54:16,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=86, PETRI_TRANSITIONS=79} [2025-02-08 13:54:16,891 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 0 predicate places. [2025-02-08 13:54:16,891 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 79 transitions, 184 flow [2025-02-08 13:54:16,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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-02-08 13:54:16,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:16,892 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:16,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 13:54:16,892 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 13:54:16,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:16,892 INFO L85 PathProgramCache]: Analyzing trace with hash 228586252, now seen corresponding path program 1 times [2025-02-08 13:54:16,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:16,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716189978] [2025-02-08 13:54:16,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:16,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:16,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:54:16,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:54:16,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:16,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:16,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:16,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:16,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716189978] [2025-02-08 13:54:16,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716189978] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:16,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:16,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:16,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545336020] [2025-02-08 13:54:16,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:16,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:16,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:16,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:16,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:16,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 85 [2025-02-08 13:54:16,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 79 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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-02-08 13:54:16,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:16,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 85 [2025-02-08 13:54:16,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:21,318 INFO L124 PetriNetUnfolderBase]: 50073/81037 cut-off events. [2025-02-08 13:54:21,318 INFO L125 PetriNetUnfolderBase]: For 3676/3676 co-relation queries the response was YES. [2025-02-08 13:54:21,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150423 conditions, 81037 events. 50073/81037 cut-off events. For 3676/3676 co-relation queries the response was YES. Maximal size of possible extension queue 3604. Compared 751072 event pairs, 9510 based on Foata normal form. 1755/79155 useless extension candidates. Maximal degree in co-relation 136073. Up to 49839 conditions per place. [2025-02-08 13:54:21,762 INFO L140 encePairwiseOnDemand]: 82/85 looper letters, 66 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2025-02-08 13:54:21,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 107 transitions, 391 flow [2025-02-08 13:54:21,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:21,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:21,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2025-02-08 13:54:21,764 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7294117647058823 [2025-02-08 13:54:21,765 INFO L175 Difference]: Start difference. First operand has 86 places, 79 transitions, 184 flow. Second operand 3 states and 186 transitions. [2025-02-08 13:54:21,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 107 transitions, 391 flow [2025-02-08 13:54:21,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 107 transitions, 387 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:21,772 INFO L231 Difference]: Finished difference. Result has 85 places, 78 transitions, 182 flow [2025-02-08 13:54:21,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=85, PETRI_TRANSITIONS=78} [2025-02-08 13:54:21,772 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -1 predicate places. [2025-02-08 13:54:21,772 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 78 transitions, 182 flow [2025-02-08 13:54:21,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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-02-08 13:54:21,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:21,773 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:21,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 13:54:21,773 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 13:54:21,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:21,773 INFO L85 PathProgramCache]: Analyzing trace with hash -868766592, now seen corresponding path program 1 times [2025-02-08 13:54:21,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:21,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468381018] [2025-02-08 13:54:21,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:21,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:21,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 13:54:21,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 13:54:21,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:21,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:21,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:21,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:21,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468381018] [2025-02-08 13:54:21,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468381018] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:21,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:21,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:21,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696259751] [2025-02-08 13:54:21,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:21,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:21,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:21,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:21,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:21,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 85 [2025-02-08 13:54:21,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 78 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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-02-08 13:54:21,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:21,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 85 [2025-02-08 13:54:21,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:26,169 INFO L124 PetriNetUnfolderBase]: 56329/83282 cut-off events. [2025-02-08 13:54:26,169 INFO L125 PetriNetUnfolderBase]: For 6192/6192 co-relation queries the response was YES. [2025-02-08 13:54:26,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161330 conditions, 83282 events. 56329/83282 cut-off events. For 6192/6192 co-relation queries the response was YES. Maximal size of possible extension queue 4117. Compared 663592 event pairs, 23016 based on Foata normal form. 1752/81384 useless extension candidates. Maximal degree in co-relation 117992. Up to 57808 conditions per place. [2025-02-08 13:54:26,666 INFO L140 encePairwiseOnDemand]: 82/85 looper letters, 66 selfloop transitions, 2 changer transitions 0/105 dead transitions. [2025-02-08 13:54:26,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 105 transitions, 386 flow [2025-02-08 13:54:26,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:26,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:26,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2025-02-08 13:54:26,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7294117647058823 [2025-02-08 13:54:26,668 INFO L175 Difference]: Start difference. First operand has 85 places, 78 transitions, 182 flow. Second operand 3 states and 186 transitions. [2025-02-08 13:54:26,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 105 transitions, 386 flow [2025-02-08 13:54:26,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 105 transitions, 378 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:26,685 INFO L231 Difference]: Finished difference. Result has 84 places, 77 transitions, 180 flow [2025-02-08 13:54:26,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=84, PETRI_TRANSITIONS=77} [2025-02-08 13:54:26,686 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -2 predicate places. [2025-02-08 13:54:26,686 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 77 transitions, 180 flow [2025-02-08 13:54:26,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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-02-08 13:54:26,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:26,686 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:26,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 13:54:26,686 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 13:54:26,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:26,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1161960145, now seen corresponding path program 1 times [2025-02-08 13:54:26,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:26,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193350598] [2025-02-08 13:54:26,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:26,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:26,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 13:54:26,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 13:54:26,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:26,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:26,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:26,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:26,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193350598] [2025-02-08 13:54:26,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193350598] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:26,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:26,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:26,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289111482] [2025-02-08 13:54:26,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:26,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:26,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:26,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:26,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:26,732 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 85 [2025-02-08 13:54:26,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 77 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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-02-08 13:54:26,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:26,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 85 [2025-02-08 13:54:26,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:30,788 INFO L124 PetriNetUnfolderBase]: 50073/74266 cut-off events. [2025-02-08 13:54:30,789 INFO L125 PetriNetUnfolderBase]: For 5322/5322 co-relation queries the response was YES. [2025-02-08 13:54:30,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143646 conditions, 74266 events. 50073/74266 cut-off events. For 5322/5322 co-relation queries the response was YES. Maximal size of possible extension queue 3593. Compared 583070 event pairs, 20568 based on Foata normal form. 1752/72695 useless extension candidates. Maximal degree in co-relation 68135. Up to 49800 conditions per place. [2025-02-08 13:54:31,348 INFO L140 encePairwiseOnDemand]: 82/85 looper letters, 65 selfloop transitions, 2 changer transitions 0/104 dead transitions. [2025-02-08 13:54:31,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 104 transitions, 378 flow [2025-02-08 13:54:31,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:31,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:31,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2025-02-08 13:54:31,350 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7254901960784313 [2025-02-08 13:54:31,350 INFO L175 Difference]: Start difference. First operand has 84 places, 77 transitions, 180 flow. Second operand 3 states and 185 transitions. [2025-02-08 13:54:31,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 104 transitions, 378 flow [2025-02-08 13:54:31,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 104 transitions, 374 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:31,356 INFO L231 Difference]: Finished difference. Result has 83 places, 76 transitions, 178 flow [2025-02-08 13:54:31,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=83, PETRI_TRANSITIONS=76} [2025-02-08 13:54:31,357 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -3 predicate places. [2025-02-08 13:54:31,357 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 76 transitions, 178 flow [2025-02-08 13:54:31,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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-02-08 13:54:31,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:31,357 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:31,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 13:54:31,358 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 13:54:31,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:31,358 INFO L85 PathProgramCache]: Analyzing trace with hash -2004684938, now seen corresponding path program 1 times [2025-02-08 13:54:31,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:31,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244704081] [2025-02-08 13:54:31,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:31,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:31,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 13:54:31,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 13:54:31,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:31,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:31,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:31,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:31,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244704081] [2025-02-08 13:54:31,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244704081] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:31,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:31,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:54:31,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405205933] [2025-02-08 13:54:31,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:31,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:54:31,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:31,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:54:31,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:54:31,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 85 [2025-02-08 13:54:31,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 76 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 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-02-08 13:54:31,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:31,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 85 [2025-02-08 13:54:31,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand