./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-ext/09_fmaxsym-zero.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc 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/09_fmaxsym-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 41cf9d90b654ba629ed26494b45977a61fd5035aced9f092d4e43a94133522bd --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:31:00,708 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:31:00,759 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 18:31:00,761 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:31:00,762 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:31:00,774 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:31:00,775 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:31:00,775 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:31:00,775 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:31:00,775 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:31:00,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:31:00,775 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:31:00,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:31:00,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:31:00,775 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:31:00,775 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:31:00,776 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:31:00,776 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 18:31:00,776 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:31:00,776 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 18:31:00,776 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:31:00,776 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:31:00,776 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:31:00,776 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:31:00,776 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:31:00,776 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:31:00,776 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 18:31:00,777 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:31:00,777 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:31:00,777 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:31:00,777 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:31:00,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:31:00,777 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:31:00,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:31:00,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:31:00,777 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:31:00,777 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:31:00,777 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:31:00,778 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:31:00,778 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:31:00,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:31:00,778 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:31:00,778 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:31:00,778 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:31:00,778 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:31:00,778 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 -> 41cf9d90b654ba629ed26494b45977a61fd5035aced9f092d4e43a94133522bd [2025-02-06 18:31:00,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:31:00,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:31:00,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:31:00,981 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:31:00,981 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:31:00,983 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/09_fmaxsym-zero.i [2025-02-06 18:31:02,786 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a7246247/35726ec7fb0a4b69b9c4d7deb6a73557/FLAGa89ee60cf [2025-02-06 18:31:03,088 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:31:03,089 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/09_fmaxsym-zero.i [2025-02-06 18:31:03,097 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a7246247/35726ec7fb0a4b69b9c4d7deb6a73557/FLAGa89ee60cf [2025-02-06 18:31:03,359 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a7246247/35726ec7fb0a4b69b9c4d7deb6a73557 [2025-02-06 18:31:03,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:31:03,363 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:31:03,364 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:31:03,367 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:31:03,371 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:31:03,371 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:31:03" (1/1) ... [2025-02-06 18:31:03,372 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7081c331 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:31:03, skipping insertion in model container [2025-02-06 18:31:03,372 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:31:03" (1/1) ... [2025-02-06 18:31:03,402 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:31:03,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:31:03,595 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:31:03,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:31:03,649 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:31:03,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:31:03 WrapperNode [2025-02-06 18:31:03,650 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:31:03,654 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:31:03,654 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:31:03,654 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:31:03,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:31:03" (1/1) ... [2025-02-06 18:31:03,672 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:31:03" (1/1) ... [2025-02-06 18:31:03,690 INFO L138 Inliner]: procedures = 164, calls = 26, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 75 [2025-02-06 18:31:03,691 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:31:03,691 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:31:03,691 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:31:03,692 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:31:03,696 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:31:03" (1/1) ... [2025-02-06 18:31:03,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:31:03" (1/1) ... [2025-02-06 18:31:03,699 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:31:03" (1/1) ... [2025-02-06 18:31:03,710 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-06 18:31:03,710 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:31:03" (1/1) ... [2025-02-06 18:31:03,710 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:31:03" (1/1) ... [2025-02-06 18:31:03,713 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:31:03" (1/1) ... [2025-02-06 18:31:03,714 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:31:03" (1/1) ... [2025-02-06 18:31:03,715 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:31:03" (1/1) ... [2025-02-06 18:31:03,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:31:03" (1/1) ... [2025-02-06 18:31:03,716 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:31:03,717 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:31:03,717 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:31:03,717 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:31:03,718 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:31:03" (1/1) ... [2025-02-06 18:31:03,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:31:03,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:31:03,744 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-06 18:31:03,749 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-06 18:31:03,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 18:31:03,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 18:31:03,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 18:31:03,765 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-06 18:31:03,765 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-06 18:31:03,765 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 18:31:03,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:31:03,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 18:31:03,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 18:31:03,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 18:31:03,766 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 18:31:03,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:31:03,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:31:03,767 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 18:31:03,841 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:31:03,842 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:31:03,979 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 18:31:03,980 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:31:04,077 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:31:04,077 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 18:31:04,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:31:04 BoogieIcfgContainer [2025-02-06 18:31:04,079 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:31:04,081 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:31:04,081 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:31:04,084 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:31:04,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:31:03" (1/3) ... [2025-02-06 18:31:04,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a551754 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:31:04, skipping insertion in model container [2025-02-06 18:31:04,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:31:03" (2/3) ... [2025-02-06 18:31:04,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a551754 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:31:04, skipping insertion in model container [2025-02-06 18:31:04,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:31:04" (3/3) ... [2025-02-06 18:31:04,086 INFO L128 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym-zero.i [2025-02-06 18:31:04,097 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:31:04,097 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09_fmaxsym-zero.i that has 2 procedures, 22 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-02-06 18:31:04,098 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 18:31:04,129 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 18:31:04,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 24 transitions, 52 flow [2025-02-06 18:31:04,174 INFO L124 PetriNetUnfolderBase]: 2/26 cut-off events. [2025-02-06 18:31:04,179 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:31:04,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 26 events. 2/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-02-06 18:31:04,181 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 24 transitions, 52 flow [2025-02-06 18:31:04,182 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 24 transitions, 52 flow [2025-02-06 18:31:04,191 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:31:04,205 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;@773fd22c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:31:04,205 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-02-06 18:31:04,209 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:31:04,209 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-02-06 18:31:04,209 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:31:04,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:31:04,209 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 18:31:04,210 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-02-06 18:31:04,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:31:04,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1597047061, now seen corresponding path program 1 times [2025-02-06 18:31:04,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:31:04,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125091498] [2025-02-06 18:31:04,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:31:04,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:31:04,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 18:31:04,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 18:31:04,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:31:04,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:31:04,421 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-06 18:31:04,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:31:04,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125091498] [2025-02-06 18:31:04,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125091498] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:31:04,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:31:04,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:31:04,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883709325] [2025-02-06 18:31:04,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:31:04,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:31:04,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:31:04,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:31:04,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:31:04,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 24 [2025-02-06 18:31:04,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 24 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-06 18:31:04,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:31:04,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 24 [2025-02-06 18:31:04,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:31:04,489 INFO L124 PetriNetUnfolderBase]: 19/71 cut-off events. [2025-02-06 18:31:04,489 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:31:04,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 71 events. 19/71 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 175 event pairs, 2 based on Foata normal form. 6/74 useless extension candidates. Maximal degree in co-relation 111. Up to 38 conditions per place. [2025-02-06 18:31:04,491 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 13 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2025-02-06 18:31:04,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 23 transitions, 80 flow [2025-02-06 18:31:04,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:31:04,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:31:04,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2025-02-06 18:31:04,508 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5972222222222222 [2025-02-06 18:31:04,509 INFO L175 Difference]: Start difference. First operand has 25 places, 24 transitions, 52 flow. Second operand 3 states and 43 transitions. [2025-02-06 18:31:04,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 23 transitions, 80 flow [2025-02-06 18:31:04,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 23 transitions, 80 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:31:04,514 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 50 flow [2025-02-06 18:31:04,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2025-02-06 18:31:04,518 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2025-02-06 18:31:04,520 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 50 flow [2025-02-06 18:31:04,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-06 18:31:04,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:31:04,521 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-06 18:31:04,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:31:04,521 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-02-06 18:31:04,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:31:04,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1597045556, now seen corresponding path program 1 times [2025-02-06 18:31:04,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:31:04,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483944619] [2025-02-06 18:31:04,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:31:04,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:31:04,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 18:31:04,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 18:31:04,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:31:04,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:31:04,549 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:31:04,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 18:31:04,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 18:31:04,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:31:04,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:31:04,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:31:04,582 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 18:31:04,583 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-02-06 18:31:04,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 9 remaining) [2025-02-06 18:31:04,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 9 remaining) [2025-02-06 18:31:04,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 9 remaining) [2025-02-06 18:31:04,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 9 remaining) [2025-02-06 18:31:04,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 9 remaining) [2025-02-06 18:31:04,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 9 remaining) [2025-02-06 18:31:04,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 9 remaining) [2025-02-06 18:31:04,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 9 remaining) [2025-02-06 18:31:04,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 18:31:04,585 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-06 18:31:04,587 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 18:31:04,587 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 18:31:04,603 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 18:31:04,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 43 transitions, 96 flow [2025-02-06 18:31:04,612 INFO L124 PetriNetUnfolderBase]: 4/48 cut-off events. [2025-02-06 18:31:04,612 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 18:31:04,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 48 events. 4/48 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 103 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 39. Up to 3 conditions per place. [2025-02-06 18:31:04,613 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 43 transitions, 96 flow [2025-02-06 18:31:04,613 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 43 transitions, 96 flow [2025-02-06 18:31:04,614 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:31:04,614 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;@773fd22c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:31:04,614 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-02-06 18:31:04,616 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:31:04,616 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-02-06 18:31:04,616 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 18:31:04,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:31:04,616 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 18:31:04,617 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-06 18:31:04,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:31:04,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1425277515, now seen corresponding path program 1 times [2025-02-06 18:31:04,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:31:04,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350634573] [2025-02-06 18:31:04,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:31:04,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:31:04,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 18:31:04,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 18:31:04,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:31:04,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:31:04,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-06 18:31:04,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:31:04,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350634573] [2025-02-06 18:31:04,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350634573] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:31:04,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:31:04,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:31:04,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987476103] [2025-02-06 18:31:04,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:31:04,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:31:04,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:31:04,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:31:04,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:31:04,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2025-02-06 18:31:04,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 43 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-06 18:31:04,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:31:04,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2025-02-06 18:31:04,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:31:04,794 INFO L124 PetriNetUnfolderBase]: 388/833 cut-off events. [2025-02-06 18:31:04,794 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-02-06 18:31:04,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1499 conditions, 833 events. 388/833 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4631 event pairs, 144 based on Foata normal form. 81/854 useless extension candidates. Maximal degree in co-relation 1285. Up to 517 conditions per place. [2025-02-06 18:31:04,799 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 31 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2025-02-06 18:31:04,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 181 flow [2025-02-06 18:31:04,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:31:04,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:31:04,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-02-06 18:31:04,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6976744186046512 [2025-02-06 18:31:04,800 INFO L175 Difference]: Start difference. First operand has 44 places, 43 transitions, 96 flow. Second operand 3 states and 90 transitions. [2025-02-06 18:31:04,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 181 flow [2025-02-06 18:31:04,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 50 transitions, 181 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:31:04,801 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 92 flow [2025-02-06 18:31:04,801 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2025-02-06 18:31:04,802 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2025-02-06 18:31:04,802 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 92 flow [2025-02-06 18:31:04,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-06 18:31:04,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:31:04,802 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:31:04,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 18:31:04,802 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-06 18:31:04,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:31:04,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1233929778, now seen corresponding path program 1 times [2025-02-06 18:31:04,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:31:04,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728695341] [2025-02-06 18:31:04,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:31:04,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:31:04,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:31:04,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:31:04,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:31:04,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:31:04,888 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-06 18:31:04,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:31:04,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728695341] [2025-02-06 18:31:04,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728695341] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:31:04,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:31:04,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:31:04,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698925578] [2025-02-06 18:31:04,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:31:04,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:31:04,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:31:04,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:31:04,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:31:04,898 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2025-02-06 18:31:04,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-06 18:31:04,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:31:04,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2025-02-06 18:31:04,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:31:05,009 INFO L124 PetriNetUnfolderBase]: 345/808 cut-off events. [2025-02-06 18:31:05,010 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-02-06 18:31:05,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1456 conditions, 808 events. 345/808 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4667 event pairs, 54 based on Foata normal form. 27/790 useless extension candidates. Maximal degree in co-relation 1187. Up to 447 conditions per place. [2025-02-06 18:31:05,017 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 30 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2025-02-06 18:31:05,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 181 flow [2025-02-06 18:31:05,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:31:05,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:31:05,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-02-06 18:31:05,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6511627906976745 [2025-02-06 18:31:05,020 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 92 flow. Second operand 3 states and 84 transitions. [2025-02-06 18:31:05,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 181 flow [2025-02-06 18:31:05,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 49 transitions, 177 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 18:31:05,021 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 90 flow [2025-02-06 18:31:05,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2025-02-06 18:31:05,022 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -1 predicate places. [2025-02-06 18:31:05,023 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 90 flow [2025-02-06 18:31:05,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-06 18:31:05,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:31:05,023 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-02-06 18:31:05,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 18:31:05,023 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-06 18:31:05,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:31:05,024 INFO L85 PathProgramCache]: Analyzing trace with hash -972255161, now seen corresponding path program 1 times [2025-02-06 18:31:05,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:31:05,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990365252] [2025-02-06 18:31:05,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:31:05,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:31:05,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 18:31:05,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 18:31:05,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:31:05,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:31:05,037 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:31:05,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 18:31:05,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 18:31:05,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:31:05,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:31:05,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:31:05,052 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 18:31:05,052 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-02-06 18:31:05,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-02-06 18:31:05,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-02-06 18:31:05,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-02-06 18:31:05,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-02-06 18:31:05,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-02-06 18:31:05,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-02-06 18:31:05,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-02-06 18:31:05,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-02-06 18:31:05,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-02-06 18:31:05,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-02-06 18:31:05,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-02-06 18:31:05,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-02-06 18:31:05,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 18:31:05,056 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-06 18:31:05,057 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 18:31:05,057 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 18:31:05,086 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 18:31:05,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 62 transitions, 142 flow [2025-02-06 18:31:05,094 INFO L124 PetriNetUnfolderBase]: 6/70 cut-off events. [2025-02-06 18:31:05,094 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 18:31:05,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 70 events. 6/70 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 194 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 57. Up to 4 conditions per place. [2025-02-06 18:31:05,094 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 62 transitions, 142 flow [2025-02-06 18:31:05,095 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 62 transitions, 142 flow [2025-02-06 18:31:05,096 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:31:05,096 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;@773fd22c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:31:05,096 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-02-06 18:31:05,097 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:31:05,098 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-02-06 18:31:05,098 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 18:31:05,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:31:05,098 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 18:31:05,098 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 18:31:05,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:31:05,098 INFO L85 PathProgramCache]: Analyzing trace with hash 409432995, now seen corresponding path program 1 times [2025-02-06 18:31:05,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:31:05,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009494265] [2025-02-06 18:31:05,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:31:05,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:31:05,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 18:31:05,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 18:31:05,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:31:05,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:31:05,129 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-06 18:31:05,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:31:05,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009494265] [2025-02-06 18:31:05,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009494265] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:31:05,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:31:05,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:31:05,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846784928] [2025-02-06 18:31:05,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:31:05,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:31:05,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:31:05,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:31:05,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:31:05,139 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 62 [2025-02-06 18:31:05,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 62 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-06 18:31:05,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:31:05,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 62 [2025-02-06 18:31:05,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:31:05,897 INFO L124 PetriNetUnfolderBase]: 5068/9014 cut-off events. [2025-02-06 18:31:05,897 INFO L125 PetriNetUnfolderBase]: For 473/473 co-relation queries the response was YES. [2025-02-06 18:31:05,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16377 conditions, 9014 events. 5068/9014 cut-off events. For 473/473 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 69760 event pairs, 806 based on Foata normal form. 897/9452 useless extension candidates. Maximal degree in co-relation 8228. Up to 5693 conditions per place. [2025-02-06 18:31:05,943 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 49 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2025-02-06 18:31:05,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 77 transitions, 286 flow [2025-02-06 18:31:05,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:31:05,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:31:05,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2025-02-06 18:31:05,947 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7365591397849462 [2025-02-06 18:31:05,947 INFO L175 Difference]: Start difference. First operand has 63 places, 62 transitions, 142 flow. Second operand 3 states and 137 transitions. [2025-02-06 18:31:05,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 77 transitions, 286 flow [2025-02-06 18:31:05,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 77 transitions, 282 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-02-06 18:31:05,950 INFO L231 Difference]: Finished difference. Result has 63 places, 57 transitions, 134 flow [2025-02-06 18:31:05,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, 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-06 18:31:05,951 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 0 predicate places. [2025-02-06 18:31:05,952 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 57 transitions, 134 flow [2025-02-06 18:31:05,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-06 18:31:05,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:31:05,952 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:31:05,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:31:05,952 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 18:31:05,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:31:05,953 INFO L85 PathProgramCache]: Analyzing trace with hash -192478754, now seen corresponding path program 1 times [2025-02-06 18:31:05,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:31:05,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979784101] [2025-02-06 18:31:05,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:31:05,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:31:05,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:31:05,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:31:05,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:31:05,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:31:06,000 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-06 18:31:06,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:31:06,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979784101] [2025-02-06 18:31:06,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979784101] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:31:06,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:31:06,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:31:06,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706157783] [2025-02-06 18:31:06,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:31:06,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:31:06,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:31:06,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:31:06,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:31:06,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 62 [2025-02-06 18:31:06,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-06 18:31:06,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:31:06,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 62 [2025-02-06 18:31:06,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:31:06,495 INFO L124 PetriNetUnfolderBase]: 4505/8232 cut-off events. [2025-02-06 18:31:06,495 INFO L125 PetriNetUnfolderBase]: For 671/671 co-relation queries the response was YES. [2025-02-06 18:31:06,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15153 conditions, 8232 events. 4505/8232 cut-off events. For 671/671 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 64049 event pairs, 806 based on Foata normal form. 219/8007 useless extension candidates. Maximal degree in co-relation 13624. Up to 4911 conditions per place. [2025-02-06 18:31:06,529 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 48 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2025-02-06 18:31:06,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 76 transitions, 282 flow [2025-02-06 18:31:06,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:31:06,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:31:06,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2025-02-06 18:31:06,531 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6935483870967742 [2025-02-06 18:31:06,531 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 134 flow. Second operand 3 states and 129 transitions. [2025-02-06 18:31:06,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 76 transitions, 282 flow [2025-02-06 18:31:06,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 76 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 18:31:06,535 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 132 flow [2025-02-06 18:31:06,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=62, PETRI_TRANSITIONS=56} [2025-02-06 18:31:06,536 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -1 predicate places. [2025-02-06 18:31:06,536 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 132 flow [2025-02-06 18:31:06,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-06 18:31:06,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:31:06,536 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:31:06,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 18:31:06,536 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 18:31:06,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:31:06,537 INFO L85 PathProgramCache]: Analyzing trace with hash -864625608, now seen corresponding path program 1 times [2025-02-06 18:31:06,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:31:06,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908271893] [2025-02-06 18:31:06,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:31:06,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:31:06,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 18:31:06,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 18:31:06,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:31:06,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:31:06,586 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-06 18:31:06,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:31:06,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908271893] [2025-02-06 18:31:06,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908271893] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:31:06,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:31:06,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:31:06,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626351894] [2025-02-06 18:31:06,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:31:06,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:31:06,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:31:06,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:31:06,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:31:06,597 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 62 [2025-02-06 18:31:06,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-06 18:31:06,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:31:06,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 62 [2025-02-06 18:31:06,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:31:07,162 INFO L124 PetriNetUnfolderBase]: 5065/8982 cut-off events. [2025-02-06 18:31:07,163 INFO L125 PetriNetUnfolderBase]: For 739/739 co-relation queries the response was YES. [2025-02-06 18:31:07,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16757 conditions, 8982 events. 5065/8982 cut-off events. For 739/739 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 68827 event pairs, 824 based on Foata normal form. 216/8768 useless extension candidates. Maximal degree in co-relation 12185. Up to 5648 conditions per place. [2025-02-06 18:31:07,207 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 48 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2025-02-06 18:31:07,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 74 transitions, 277 flow [2025-02-06 18:31:07,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:31:07,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:31:07,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2025-02-06 18:31:07,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6935483870967742 [2025-02-06 18:31:07,208 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 132 flow. Second operand 3 states and 129 transitions. [2025-02-06 18:31:07,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 74 transitions, 277 flow [2025-02-06 18:31:07,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 74 transitions, 269 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 18:31:07,211 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 130 flow [2025-02-06 18:31:07,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2025-02-06 18:31:07,211 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -2 predicate places. [2025-02-06 18:31:07,211 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 130 flow [2025-02-06 18:31:07,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-06 18:31:07,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:31:07,211 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:31:07,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 18:31:07,213 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 18:31:07,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:31:07,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1033589765, now seen corresponding path program 1 times [2025-02-06 18:31:07,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:31:07,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354774301] [2025-02-06 18:31:07,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:31:07,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:31:07,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 18:31:07,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 18:31:07,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:31:07,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:31:07,270 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-06 18:31:07,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:31:07,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354774301] [2025-02-06 18:31:07,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354774301] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:31:07,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:31:07,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:31:07,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869484539] [2025-02-06 18:31:07,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:31:07,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:31:07,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:31:07,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:31:07,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:31:07,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 62 [2025-02-06 18:31:07,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-06 18:31:07,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:31:07,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 62 [2025-02-06 18:31:07,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:31:07,677 INFO L124 PetriNetUnfolderBase]: 4505/8206 cut-off events. [2025-02-06 18:31:07,677 INFO L125 PetriNetUnfolderBase]: For 652/652 co-relation queries the response was YES. [2025-02-06 18:31:07,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15121 conditions, 8206 events. 4505/8206 cut-off events. For 652/652 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 63576 event pairs, 824 based on Foata normal form. 216/8007 useless extension candidates. Maximal degree in co-relation 9347. Up to 4872 conditions per place. [2025-02-06 18:31:07,707 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 47 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2025-02-06 18:31:07,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 73 transitions, 269 flow [2025-02-06 18:31:07,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:31:07,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:31:07,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2025-02-06 18:31:07,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6881720430107527 [2025-02-06 18:31:07,709 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 130 flow. Second operand 3 states and 128 transitions. [2025-02-06 18:31:07,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 73 transitions, 269 flow [2025-02-06 18:31:07,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 73 transitions, 265 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 18:31:07,713 INFO L231 Difference]: Finished difference. Result has 60 places, 54 transitions, 128 flow [2025-02-06 18:31:07,713 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=60, PETRI_TRANSITIONS=54} [2025-02-06 18:31:07,714 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -3 predicate places. [2025-02-06 18:31:07,714 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 128 flow [2025-02-06 18:31:07,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-06 18:31:07,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:31:07,714 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-02-06 18:31:07,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 18:31:07,714 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 18:31:07,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:31:07,715 INFO L85 PathProgramCache]: Analyzing trace with hash 2044002707, now seen corresponding path program 1 times [2025-02-06 18:31:07,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:31:07,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166377993] [2025-02-06 18:31:07,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:31:07,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:31:07,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 18:31:07,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 18:31:07,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:31:07,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:31:07,725 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:31:07,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 18:31:07,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 18:31:07,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:31:07,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:31:07,735 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:31:07,738 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 18:31:07,738 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-02-06 18:31:07,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-02-06 18:31:07,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-02-06 18:31:07,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-02-06 18:31:07,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-02-06 18:31:07,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-02-06 18:31:07,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-02-06 18:31:07,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-02-06 18:31:07,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-02-06 18:31:07,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-02-06 18:31:07,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-02-06 18:31:07,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-02-06 18:31:07,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-02-06 18:31:07,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-02-06 18:31:07,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-02-06 18:31:07,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-02-06 18:31:07,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-02-06 18:31:07,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 18:31:07,739 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 18:31:07,739 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 18:31:07,739 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-06 18:31:07,771 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 18:31:07,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 81 transitions, 190 flow [2025-02-06 18:31:07,780 INFO L124 PetriNetUnfolderBase]: 8/92 cut-off events. [2025-02-06 18:31:07,780 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-06 18:31:07,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 92 events. 8/92 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 279 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 82. Up to 5 conditions per place. [2025-02-06 18:31:07,780 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 81 transitions, 190 flow [2025-02-06 18:31:07,781 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 81 transitions, 190 flow [2025-02-06 18:31:07,781 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:31:07,782 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;@773fd22c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:31:07,782 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-02-06 18:31:07,784 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:31:07,785 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-02-06 18:31:07,787 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 18:31:07,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:31:07,787 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 18:31:07,787 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-06 18:31:07,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:31:07,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1488720253, now seen corresponding path program 1 times [2025-02-06 18:31:07,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:31:07,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947413147] [2025-02-06 18:31:07,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:31:07,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:31:07,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 18:31:07,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 18:31:07,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:31:07,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:31:07,814 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-06 18:31:07,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:31:07,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947413147] [2025-02-06 18:31:07,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947413147] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:31:07,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:31:07,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:31:07,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610448094] [2025-02-06 18:31:07,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:31:07,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:31:07,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:31:07,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:31:07,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:31:07,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 81 [2025-02-06 18:31:07,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 81 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:31:07,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:31:07,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 81 [2025-02-06 18:31:07,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:31:11,913 INFO L124 PetriNetUnfolderBase]: 56332/87830 cut-off events. [2025-02-06 18:31:11,914 INFO L125 PetriNetUnfolderBase]: For 6371/6371 co-relation queries the response was YES. [2025-02-06 18:31:12,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163162 conditions, 87830 events. 56332/87830 cut-off events. For 6371/6371 co-relation queries the response was YES. Maximal size of possible extension queue 3788. Compared 777572 event pairs, 9510 based on Foata normal form. 9153/93232 useless extension candidates. Maximal degree in co-relation 50758. Up to 57853 conditions per place. [2025-02-06 18:31:12,458 INFO L140 encePairwiseOnDemand]: 73/81 looper letters, 67 selfloop transitions, 2 changer transitions 0/104 dead transitions. [2025-02-06 18:31:12,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 104 transitions, 395 flow [2025-02-06 18:31:12,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:31:12,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:31:12,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 184 transitions. [2025-02-06 18:31:12,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.757201646090535 [2025-02-06 18:31:12,459 INFO L175 Difference]: Start difference. First operand has 82 places, 81 transitions, 190 flow. Second operand 3 states and 184 transitions. [2025-02-06 18:31:12,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 104 transitions, 395 flow [2025-02-06 18:31:12,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 104 transitions, 383 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-02-06 18:31:12,463 INFO L231 Difference]: Finished difference. Result has 82 places, 75 transitions, 176 flow [2025-02-06 18:31:12,463 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=82, PETRI_TRANSITIONS=75} [2025-02-06 18:31:12,463 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 0 predicate places. [2025-02-06 18:31:12,463 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 75 transitions, 176 flow [2025-02-06 18:31:12,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:31:12,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:31:12,464 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:31:12,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 18:31:12,464 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-06 18:31:12,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:31:12,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1094312801, now seen corresponding path program 1 times [2025-02-06 18:31:12,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:31:12,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796895734] [2025-02-06 18:31:12,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:31:12,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:31:12,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:31:12,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:31:12,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:31:12,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:31:12,502 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-06 18:31:12,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:31:12,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796895734] [2025-02-06 18:31:12,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796895734] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:31:12,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:31:12,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:31:12,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6238975] [2025-02-06 18:31:12,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:31:12,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:31:12,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:31:12,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:31:12,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:31:12,510 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 81 [2025-02-06 18:31:12,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 75 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:31:12,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:31:12,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 81 [2025-02-06 18:31:12,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:31:16,237 INFO L124 PetriNetUnfolderBase]: 50073/74974 cut-off events. [2025-02-06 18:31:16,238 INFO L125 PetriNetUnfolderBase]: For 5431/5431 co-relation queries the response was YES. [2025-02-06 18:31:16,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144360 conditions, 74974 events. 50073/74974 cut-off events. For 5431/5431 co-relation queries the response was YES. Maximal size of possible extension queue 3551. Compared 594520 event pairs, 27618 based on Foata normal form. 1755/72549 useless extension candidates. Maximal degree in co-relation 143648. Up to 49839 conditions per place. [2025-02-06 18:31:16,662 INFO L140 encePairwiseOnDemand]: 78/81 looper letters, 66 selfloop transitions, 2 changer transitions 0/103 dead transitions. [2025-02-06 18:31:16,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 103 transitions, 383 flow [2025-02-06 18:31:16,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:31:16,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:31:16,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2025-02-06 18:31:16,664 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7160493827160493 [2025-02-06 18:31:16,664 INFO L175 Difference]: Start difference. First operand has 82 places, 75 transitions, 176 flow. Second operand 3 states and 174 transitions. [2025-02-06 18:31:16,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 103 transitions, 383 flow [2025-02-06 18:31:16,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 103 transitions, 379 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 18:31:16,668 INFO L231 Difference]: Finished difference. Result has 81 places, 74 transitions, 174 flow [2025-02-06 18:31:16,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=81, PETRI_TRANSITIONS=74} [2025-02-06 18:31:16,669 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, -1 predicate places. [2025-02-06 18:31:16,669 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 74 transitions, 174 flow [2025-02-06 18:31:16,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:31:16,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:31:16,669 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:31:16,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 18:31:16,669 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-06 18:31:16,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:31:16,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1740467429, now seen corresponding path program 1 times [2025-02-06 18:31:16,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:31:16,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894643583] [2025-02-06 18:31:16,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:31:16,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:31:16,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 18:31:16,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 18:31:16,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:31:16,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:31:16,699 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-06 18:31:16,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:31:16,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894643583] [2025-02-06 18:31:16,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894643583] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:31:16,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:31:16,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:31:16,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81399942] [2025-02-06 18:31:16,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:31:16,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:31:16,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:31:16,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:31:16,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:31:16,706 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 81 [2025-02-06 18:31:16,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 74 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:31:16,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:31:16,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 81 [2025-02-06 18:31:16,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:31:21,038 INFO L124 PetriNetUnfolderBase]: 56329/87974 cut-off events. [2025-02-06 18:31:21,038 INFO L125 PetriNetUnfolderBase]: For 6225/6225 co-relation queries the response was YES. [2025-02-06 18:31:21,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166022 conditions, 87974 events. 56329/87974 cut-off events. For 6225/6225 co-relation queries the response was YES. Maximal size of possible extension queue 3765. Compared 778251 event pairs, 9528 based on Foata normal form. 1752/86016 useless extension candidates. Maximal degree in co-relation 121499. Up to 57808 conditions per place. [2025-02-06 18:31:21,523 INFO L140 encePairwiseOnDemand]: 78/81 looper letters, 66 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2025-02-06 18:31:21,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 101 transitions, 378 flow [2025-02-06 18:31:21,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:31:21,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:31:21,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2025-02-06 18:31:21,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7160493827160493 [2025-02-06 18:31:21,524 INFO L175 Difference]: Start difference. First operand has 81 places, 74 transitions, 174 flow. Second operand 3 states and 174 transitions. [2025-02-06 18:31:21,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 101 transitions, 378 flow [2025-02-06 18:31:21,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 101 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 18:31:21,529 INFO L231 Difference]: Finished difference. Result has 80 places, 73 transitions, 172 flow [2025-02-06 18:31:21,529 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=80, PETRI_TRANSITIONS=73} [2025-02-06 18:31:21,529 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, -2 predicate places. [2025-02-06 18:31:21,529 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 73 transitions, 172 flow [2025-02-06 18:31:21,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:31:21,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:31:21,530 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:31:21,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 18:31:21,530 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-06 18:31:21,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:31:21,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1880084955, now seen corresponding path program 1 times [2025-02-06 18:31:21,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:31:21,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162873482] [2025-02-06 18:31:21,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:31:21,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:31:21,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 18:31:21,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 18:31:21,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:31:21,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:31:21,572 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-06 18:31:21,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:31:21,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162873482] [2025-02-06 18:31:21,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162873482] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:31:21,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:31:21,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:31:21,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516962335] [2025-02-06 18:31:21,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:31:21,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:31:21,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:31:21,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:31:21,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:31:21,581 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 81 [2025-02-06 18:31:21,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 73 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:31:21,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:31:21,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 81 [2025-02-06 18:31:21,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:31:25,742 INFO L124 PetriNetUnfolderBase]: 50073/75358 cut-off events. [2025-02-06 18:31:25,743 INFO L125 PetriNetUnfolderBase]: For 5562/5562 co-relation queries the response was YES. [2025-02-06 18:31:25,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144738 conditions, 75358 events. 50073/75358 cut-off events. For 5562/5562 co-relation queries the response was YES. Maximal size of possible extension queue 3531. Compared 600929 event pairs, 20568 based on Foata normal form. 1752/72983 useless extension candidates. Maximal degree in co-relation 90349. Up to 49800 conditions per place. [2025-02-06 18:31:26,058 INFO L140 encePairwiseOnDemand]: 78/81 looper letters, 65 selfloop transitions, 2 changer transitions 0/100 dead transitions. [2025-02-06 18:31:26,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 100 transitions, 370 flow [2025-02-06 18:31:26,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:31:26,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:31:26,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2025-02-06 18:31:26,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7119341563786008 [2025-02-06 18:31:26,061 INFO L175 Difference]: Start difference. First operand has 80 places, 73 transitions, 172 flow. Second operand 3 states and 173 transitions. [2025-02-06 18:31:26,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 100 transitions, 370 flow [2025-02-06 18:31:26,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 100 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 18:31:26,068 INFO L231 Difference]: Finished difference. Result has 79 places, 72 transitions, 170 flow [2025-02-06 18:31:26,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=79, PETRI_TRANSITIONS=72} [2025-02-06 18:31:26,069 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, -3 predicate places. [2025-02-06 18:31:26,069 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 72 transitions, 170 flow [2025-02-06 18:31:26,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:31:26,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:31:26,069 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:31:26,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 18:31:26,069 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-06 18:31:26,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:31:26,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1234770302, now seen corresponding path program 1 times [2025-02-06 18:31:26,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:31:26,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130645994] [2025-02-06 18:31:26,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:31:26,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:31:26,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 18:31:26,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 18:31:26,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:31:26,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:31:26,122 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-06 18:31:26,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:31:26,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130645994] [2025-02-06 18:31:26,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130645994] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:31:26,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:31:26,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:31:26,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229060207] [2025-02-06 18:31:26,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:31:26,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:31:26,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:31:26,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:31:26,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:31:26,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 81 [2025-02-06 18:31:26,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 72 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:31:26,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:31:26,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 81 [2025-02-06 18:31:26,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:31:30,353 INFO L124 PetriNetUnfolderBase]: 56281/85001 cut-off events. [2025-02-06 18:31:30,354 INFO L125 PetriNetUnfolderBase]: For 6170/6170 co-relation queries the response was YES. [2025-02-06 18:31:30,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162941 conditions, 85001 events. 56281/85001 cut-off events. For 6170/6170 co-relation queries the response was YES. Maximal size of possible extension queue 3860. Compared 695995 event pairs, 15558 based on Foata normal form. 1728/82378 useless extension candidates. Maximal degree in co-relation 101772. Up to 57280 conditions per place. [2025-02-06 18:31:30,782 INFO L140 encePairwiseOnDemand]: 78/81 looper letters, 65 selfloop transitions, 2 changer transitions 0/98 dead transitions. [2025-02-06 18:31:30,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 98 transitions, 365 flow [2025-02-06 18:31:30,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:31:30,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:31:30,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2025-02-06 18:31:30,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7119341563786008 [2025-02-06 18:31:30,783 INFO L175 Difference]: Start difference. First operand has 79 places, 72 transitions, 170 flow. Second operand 3 states and 173 transitions. [2025-02-06 18:31:30,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 98 transitions, 365 flow [2025-02-06 18:31:30,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 98 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 18:31:30,789 INFO L231 Difference]: Finished difference. Result has 78 places, 71 transitions, 168 flow [2025-02-06 18:31:30,789 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=78, PETRI_TRANSITIONS=71} [2025-02-06 18:31:30,789 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, -4 predicate places. [2025-02-06 18:31:30,789 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 71 transitions, 168 flow [2025-02-06 18:31:30,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:31:30,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:31:30,789 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:31:30,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 18:31:30,790 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-06 18:31:30,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:31:30,790 INFO L85 PathProgramCache]: Analyzing trace with hash -376825950, now seen corresponding path program 1 times [2025-02-06 18:31:30,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:31:30,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049247803] [2025-02-06 18:31:30,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:31:30,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:31:30,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:31:30,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:31:30,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:31:30,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:31:30,822 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-06 18:31:30,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:31:30,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049247803] [2025-02-06 18:31:30,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049247803] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:31:30,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:31:30,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:31:30,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83804262] [2025-02-06 18:31:30,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:31:30,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:31:30,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:31:30,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:31:30,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:31:30,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 81 [2025-02-06 18:31:30,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 71 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:31:30,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:31:30,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 81 [2025-02-06 18:31:30,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand