./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 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/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-?-48c9605-m [2025-02-08 13:54:01,673 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:54:01,747 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 13:54:01,753 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:54:01,753 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:54:01,774 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:54:01,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:54:01,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:54:01,775 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:54:01,775 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:54:01,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:54:01,775 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:54:01,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:54:01,776 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:54:01,776 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:54:01,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:54:01,776 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:54:01,776 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 13:54:01,776 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:54:01,776 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 13:54:01,776 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:54:01,776 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:54:01,776 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:54:01,777 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:54:01,777 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:54:01,777 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:54:01,777 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 13:54:01,777 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:54:01,777 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:54:01,777 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:54:01,777 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:54:01,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:54:01,777 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:54:01,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:54:01,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:54:01,778 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:54:01,778 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:54:01,778 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:54:01,778 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:54:01,778 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:54:01,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:54:01,778 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:54:01,778 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:54:01,778 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:54:01,778 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:54:01,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-08 13:54:02,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:54:02,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:54:02,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:54:02,067 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:54:02,067 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:54:02,069 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-08 13:54:03,372 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cb0eaff7c/92389b83a2854a379d557a13f5100820/FLAGa284c1c77 [2025-02-08 13:54:03,773 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:54:03,776 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/09_fmaxsym-zero.i [2025-02-08 13:54:03,792 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cb0eaff7c/92389b83a2854a379d557a13f5100820/FLAGa284c1c77 [2025-02-08 13:54:03,972 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cb0eaff7c/92389b83a2854a379d557a13f5100820 [2025-02-08 13:54:03,974 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:54:03,976 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:54:03,977 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:54:03,977 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:54:03,981 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:54:03,982 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:54:03" (1/1) ... [2025-02-08 13:54:03,983 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cfc6d9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:03, skipping insertion in model container [2025-02-08 13:54:03,983 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:54:03" (1/1) ... [2025-02-08 13:54:04,022 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:54:04,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:54:04,348 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:54:04,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:54:04,416 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:54:04,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:04 WrapperNode [2025-02-08 13:54:04,417 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:54:04,418 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:54:04,418 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:54:04,418 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:54:04,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:04" (1/1) ... [2025-02-08 13:54:04,432 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:04" (1/1) ... [2025-02-08 13:54:04,447 INFO L138 Inliner]: procedures = 164, calls = 26, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 75 [2025-02-08 13:54:04,448 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:54:04,448 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:54:04,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:54:04,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:54:04,454 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:04" (1/1) ... [2025-02-08 13:54:04,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:04" (1/1) ... [2025-02-08 13:54:04,459 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:04" (1/1) ... [2025-02-08 13:54:04,476 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6]. The 0 writes are split as follows [0, 0, 0]. [2025-02-08 13:54:04,476 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:04" (1/1) ... [2025-02-08 13:54:04,476 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:04" (1/1) ... [2025-02-08 13:54:04,482 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:04" (1/1) ... [2025-02-08 13:54:04,483 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:04" (1/1) ... [2025-02-08 13:54:04,484 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:04" (1/1) ... [2025-02-08 13:54:04,484 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:04" (1/1) ... [2025-02-08 13:54:04,486 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:54:04,487 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:54:04,487 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:54:04,487 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:54:04,488 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:04" (1/1) ... [2025-02-08 13:54:04,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:54:04,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:54:04,521 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 13:54:04,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 13:54:04,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 13:54:04,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 13:54:04,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 13:54:04,543 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-08 13:54:04,543 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-08 13:54:04,543 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 13:54:04,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:54:04,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 13:54:04,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 13:54:04,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 13:54:04,544 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 13:54:04,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:54:04,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:54:04,545 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 13:54:04,659 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:54:04,661 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:54:04,837 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 13:54:04,837 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:54:04,968 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:54:04,969 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:54:04,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:54:04 BoogieIcfgContainer [2025-02-08 13:54:04,969 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:54:04,971 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:54:04,971 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:54:04,975 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:54:04,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:54:03" (1/3) ... [2025-02-08 13:54:04,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55fefbae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:54:04, skipping insertion in model container [2025-02-08 13:54:04,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:04" (2/3) ... [2025-02-08 13:54:04,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55fefbae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:54:04, skipping insertion in model container [2025-02-08 13:54:04,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:54:04" (3/3) ... [2025-02-08 13:54:04,979 INFO L128 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym-zero.i [2025-02-08 13:54:04,993 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:54:04,994 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-08 13:54:04,994 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 13:54:05,040 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 13:54:05,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 24 transitions, 52 flow [2025-02-08 13:54:05,093 INFO L124 PetriNetUnfolderBase]: 2/26 cut-off events. [2025-02-08 13:54:05,096 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 13:54:05,100 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 32 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-08 13:54:05,101 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 24 transitions, 52 flow [2025-02-08 13:54:05,106 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 24 transitions, 52 flow [2025-02-08 13:54:05,113 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:54:05,123 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;@3d8894d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:54:05,123 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-02-08 13:54:05,134 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 13:54:05,134 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-02-08 13:54:05,134 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 13:54:05,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:05,136 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 13:54:05,136 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-02-08 13:54:05,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:05,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1597970582, now seen corresponding path program 1 times [2025-02-08 13:54:05,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:05,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683958304] [2025-02-08 13:54:05,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:05,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:05,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:54:05,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:54:05,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:05,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:05,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:05,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:05,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683958304] [2025-02-08 13:54:05,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683958304] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:05,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:05,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:05,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941564708] [2025-02-08 13:54:05,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:05,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:05,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:05,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:05,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:05,510 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 24 [2025-02-08 13:54:05,513 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-08 13:54:05,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:05,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 24 [2025-02-08 13:54:05,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:05,571 INFO L124 PetriNetUnfolderBase]: 19/71 cut-off events. [2025-02-08 13:54:05,572 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 13:54:05,572 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 176 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-08 13:54:05,573 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 13 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2025-02-08 13:54:05,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 23 transitions, 80 flow [2025-02-08 13:54:05,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:05,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:05,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2025-02-08 13:54:05,584 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5972222222222222 [2025-02-08 13:54:05,585 INFO L175 Difference]: Start difference. First operand has 25 places, 24 transitions, 52 flow. Second operand 3 states and 43 transitions. [2025-02-08 13:54:05,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 23 transitions, 80 flow [2025-02-08 13:54:05,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 23 transitions, 80 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 13:54:05,590 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 50 flow [2025-02-08 13:54:05,592 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-08 13:54:05,594 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2025-02-08 13:54:05,595 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 50 flow [2025-02-08 13:54:05,595 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-08 13:54:05,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:05,595 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:54:05,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:54:05,596 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-08 13:54:05,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:05,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1597969108, now seen corresponding path program 1 times [2025-02-08 13:54:05,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:05,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956002781] [2025-02-08 13:54:05,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:05,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:05,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:54:05,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:54:05,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:05,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 13:54:05,613 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 13:54:05,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:54:05,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:54:05,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:05,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 13:54:05,643 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 13:54:05,643 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 13:54:05,644 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-02-08 13:54:05,649 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 9 remaining) [2025-02-08 13:54:05,649 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 9 remaining) [2025-02-08 13:54:05,649 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 9 remaining) [2025-02-08 13:54:05,649 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 9 remaining) [2025-02-08 13:54:05,649 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 9 remaining) [2025-02-08 13:54:05,649 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 9 remaining) [2025-02-08 13:54:05,649 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 9 remaining) [2025-02-08 13:54:05,649 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 9 remaining) [2025-02-08 13:54:05,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 13:54:05,650 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 13:54:05,653 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 13:54:05,653 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 13:54:05,679 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 13:54:05,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 43 transitions, 96 flow [2025-02-08 13:54:05,699 INFO L124 PetriNetUnfolderBase]: 4/48 cut-off events. [2025-02-08 13:54:05,699 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 13:54:05,700 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-08 13:54:05,700 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 43 transitions, 96 flow [2025-02-08 13:54:05,702 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 43 transitions, 96 flow [2025-02-08 13:54:05,703 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:54:05,704 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;@3d8894d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:54:05,704 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-02-08 13:54:05,707 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 13:54:05,707 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-02-08 13:54:05,707 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 13:54:05,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:05,708 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 13:54:05,708 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 13:54:05,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:05,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1424353994, now seen corresponding path program 1 times [2025-02-08 13:54:05,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:05,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968548857] [2025-02-08 13:54:05,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:05,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:05,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:54:05,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:54:05,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:05,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:05,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:05,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:05,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968548857] [2025-02-08 13:54:05,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968548857] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:05,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:05,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:05,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134580648] [2025-02-08 13:54:05,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:05,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:05,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:05,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:05,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:05,801 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2025-02-08 13:54:05,802 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-08 13:54:05,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:05,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2025-02-08 13:54:05,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:06,044 INFO L124 PetriNetUnfolderBase]: 388/833 cut-off events. [2025-02-08 13:54:06,045 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-02-08 13:54:06,089 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 4627 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-08 13:54:06,096 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 31 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2025-02-08 13:54:06,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 181 flow [2025-02-08 13:54:06,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:06,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:06,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-02-08 13:54:06,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6976744186046512 [2025-02-08 13:54:06,098 INFO L175 Difference]: Start difference. First operand has 44 places, 43 transitions, 96 flow. Second operand 3 states and 90 transitions. [2025-02-08 13:54:06,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 181 flow [2025-02-08 13:54:06,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 50 transitions, 181 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 13:54:06,101 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 92 flow [2025-02-08 13:54:06,101 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-08 13:54:06,102 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2025-02-08 13:54:06,102 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 92 flow [2025-02-08 13:54:06,102 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-08 13:54:06,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:06,102 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:06,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:54:06,102 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 13:54:06,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:06,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1205300627, now seen corresponding path program 1 times [2025-02-08 13:54:06,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:06,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146524335] [2025-02-08 13:54:06,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:06,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:06,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:54:06,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:54:06,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:06,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:06,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:06,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:06,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146524335] [2025-02-08 13:54:06,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146524335] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:06,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:06,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:06,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453194503] [2025-02-08 13:54:06,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:06,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:06,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:06,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:06,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:06,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2025-02-08 13:54:06,229 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-08 13:54:06,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:06,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2025-02-08 13:54:06,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:06,377 INFO L124 PetriNetUnfolderBase]: 345/808 cut-off events. [2025-02-08 13:54:06,377 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-02-08 13:54:06,381 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 4655 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-08 13:54:06,385 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 30 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2025-02-08 13:54:06,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 181 flow [2025-02-08 13:54:06,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:06,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:06,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-02-08 13:54:06,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6511627906976745 [2025-02-08 13:54:06,387 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 92 flow. Second operand 3 states and 84 transitions. [2025-02-08 13:54:06,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 181 flow [2025-02-08 13:54:06,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 49 transitions, 177 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:06,389 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 90 flow [2025-02-08 13:54:06,389 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-08 13:54:06,390 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -1 predicate places. [2025-02-08 13:54:06,390 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 90 flow [2025-02-08 13:54:06,390 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-08 13:54:06,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:06,390 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-02-08 13:54:06,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 13:54:06,393 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 13:54:06,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:06,394 INFO L85 PathProgramCache]: Analyzing trace with hash 771478726, now seen corresponding path program 1 times [2025-02-08 13:54:06,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:06,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996826658] [2025-02-08 13:54:06,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:06,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:06,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 13:54:06,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 13:54:06,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:06,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 13:54:06,414 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 13:54:06,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 13:54:06,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 13:54:06,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:06,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 13:54:06,425 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 13:54:06,426 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 13:54:06,426 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-02-08 13:54:06,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-02-08 13:54:06,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-02-08 13:54:06,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-02-08 13:54:06,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-02-08 13:54:06,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-02-08 13:54:06,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-02-08 13:54:06,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-02-08 13:54:06,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-02-08 13:54:06,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-02-08 13:54:06,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-02-08 13:54:06,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-02-08 13:54:06,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-02-08 13:54:06,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 13:54:06,428 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 13:54:06,429 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 13:54:06,429 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 13:54:06,465 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 13:54:06,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 62 transitions, 142 flow [2025-02-08 13:54:06,478 INFO L124 PetriNetUnfolderBase]: 6/70 cut-off events. [2025-02-08 13:54:06,478 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 13:54:06,479 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 192 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-08 13:54:06,479 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 62 transitions, 142 flow [2025-02-08 13:54:06,480 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 62 transitions, 142 flow [2025-02-08 13:54:06,481 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:54:06,482 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;@3d8894d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:54:06,484 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-02-08 13:54:06,487 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 13:54:06,488 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-02-08 13:54:06,488 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 13:54:06,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:06,488 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 13:54:06,488 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 13:54:06,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:06,488 INFO L85 PathProgramCache]: Analyzing trace with hash 410356516, now seen corresponding path program 1 times [2025-02-08 13:54:06,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:06,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582901109] [2025-02-08 13:54:06,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:06,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:06,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:54:06,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:54:06,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:06,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:06,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-08 13:54:06,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:06,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582901109] [2025-02-08 13:54:06,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582901109] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:06,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:06,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:06,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814568434] [2025-02-08 13:54:06,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:06,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:06,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:06,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:06,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:06,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 62 [2025-02-08 13:54:06,586 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-08 13:54:06,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:06,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 62 [2025-02-08 13:54:06,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:07,489 INFO L124 PetriNetUnfolderBase]: 5068/9014 cut-off events. [2025-02-08 13:54:07,490 INFO L125 PetriNetUnfolderBase]: For 475/475 co-relation queries the response was YES. [2025-02-08 13:54:07,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16377 conditions, 9014 events. 5068/9014 cut-off events. For 475/475 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 69624 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-08 13:54:07,563 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 49 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2025-02-08 13:54:07,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 77 transitions, 286 flow [2025-02-08 13:54:07,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:07,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:07,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2025-02-08 13:54:07,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7365591397849462 [2025-02-08 13:54:07,566 INFO L175 Difference]: Start difference. First operand has 63 places, 62 transitions, 142 flow. Second operand 3 states and 137 transitions. [2025-02-08 13:54:07,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 77 transitions, 286 flow [2025-02-08 13:54:07,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 77 transitions, 282 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-02-08 13:54:07,571 INFO L231 Difference]: Finished difference. Result has 63 places, 57 transitions, 134 flow [2025-02-08 13:54:07,571 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-08 13:54:07,572 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 0 predicate places. [2025-02-08 13:54:07,573 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 57 transitions, 134 flow [2025-02-08 13:54:07,573 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-08 13:54:07,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:07,573 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:07,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:54:07,573 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 13:54:07,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:07,574 INFO L85 PathProgramCache]: Analyzing trace with hash -163849603, now seen corresponding path program 1 times [2025-02-08 13:54:07,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:07,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860809661] [2025-02-08 13:54:07,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:07,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:07,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:54:07,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:54:07,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:07,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:07,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:07,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:07,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860809661] [2025-02-08 13:54:07,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860809661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:07,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:07,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:07,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586046916] [2025-02-08 13:54:07,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:07,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:07,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:07,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:07,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:07,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 62 [2025-02-08 13:54:07,657 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-08 13:54:07,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:07,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 62 [2025-02-08 13:54:07,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:08,408 INFO L124 PetriNetUnfolderBase]: 4505/8232 cut-off events. [2025-02-08 13:54:08,408 INFO L125 PetriNetUnfolderBase]: For 671/671 co-relation queries the response was YES. [2025-02-08 13:54:08,425 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 64011 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-08 13:54:08,480 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 48 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2025-02-08 13:54:08,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 76 transitions, 282 flow [2025-02-08 13:54:08,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:08,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:08,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2025-02-08 13:54:08,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6935483870967742 [2025-02-08 13:54:08,483 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 134 flow. Second operand 3 states and 129 transitions. [2025-02-08 13:54:08,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 76 transitions, 282 flow [2025-02-08 13:54:08,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 76 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:08,487 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 132 flow [2025-02-08 13:54:08,487 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-08 13:54:08,488 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -1 predicate places. [2025-02-08 13:54:08,488 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 132 flow [2025-02-08 13:54:08,489 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-08 13:54:08,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:08,489 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:08,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:54:08,489 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 13:54:08,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:08,490 INFO L85 PathProgramCache]: Analyzing trace with hash 879108248, now seen corresponding path program 1 times [2025-02-08 13:54:08,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:08,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544295376] [2025-02-08 13:54:08,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:08,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:08,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 13:54:08,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 13:54:08,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:08,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:08,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:08,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:08,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544295376] [2025-02-08 13:54:08,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544295376] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:08,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:08,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:08,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211908299] [2025-02-08 13:54:08,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:08,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:08,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:08,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:08,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:08,584 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 62 [2025-02-08 13:54:08,585 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-08 13:54:08,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:08,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 62 [2025-02-08 13:54:08,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:09,217 INFO L124 PetriNetUnfolderBase]: 5065/8990 cut-off events. [2025-02-08 13:54:09,218 INFO L125 PetriNetUnfolderBase]: For 745/745 co-relation queries the response was YES. [2025-02-08 13:54:09,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16765 conditions, 8990 events. 5065/8990 cut-off events. For 745/745 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 68867 event pairs, 824 based on Foata normal form. 216/8773 useless extension candidates. Maximal degree in co-relation 12131. Up to 5648 conditions per place. [2025-02-08 13:54:09,263 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 48 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2025-02-08 13:54:09,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 74 transitions, 277 flow [2025-02-08 13:54:09,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:09,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:09,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2025-02-08 13:54:09,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6935483870967742 [2025-02-08 13:54:09,265 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 132 flow. Second operand 3 states and 129 transitions. [2025-02-08 13:54:09,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 74 transitions, 277 flow [2025-02-08 13:54:09,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 74 transitions, 269 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:09,270 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 130 flow [2025-02-08 13:54:09,270 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-08 13:54:09,271 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -2 predicate places. [2025-02-08 13:54:09,271 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 130 flow [2025-02-08 13:54:09,271 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-08 13:54:09,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:09,271 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:09,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 13:54:09,271 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 13:54:09,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:09,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1482552219, now seen corresponding path program 1 times [2025-02-08 13:54:09,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:09,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802546258] [2025-02-08 13:54:09,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:09,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:09,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 13:54:09,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 13:54:09,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:09,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:09,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:09,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:09,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802546258] [2025-02-08 13:54:09,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802546258] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:09,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:09,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:09,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354634405] [2025-02-08 13:54:09,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:09,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:09,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:09,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:09,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:09,362 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 62 [2025-02-08 13:54:09,363 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-08 13:54:09,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:09,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 62 [2025-02-08 13:54:09,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:09,834 INFO L124 PetriNetUnfolderBase]: 4505/8214 cut-off events. [2025-02-08 13:54:09,835 INFO L125 PetriNetUnfolderBase]: For 658/658 co-relation queries the response was YES. [2025-02-08 13:54:09,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15129 conditions, 8214 events. 4505/8214 cut-off events. For 658/658 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 63443 event pairs, 824 based on Foata normal form. 216/8012 useless extension candidates. Maximal degree in co-relation 9347. Up to 4872 conditions per place. [2025-02-08 13:54:09,922 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 47 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2025-02-08 13:54:09,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 73 transitions, 269 flow [2025-02-08 13:54:09,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:09,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:09,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2025-02-08 13:54:09,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6881720430107527 [2025-02-08 13:54:09,924 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 130 flow. Second operand 3 states and 128 transitions. [2025-02-08 13:54:09,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 73 transitions, 269 flow [2025-02-08 13:54:09,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 73 transitions, 265 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:09,927 INFO L231 Difference]: Finished difference. Result has 60 places, 54 transitions, 128 flow [2025-02-08 13:54:09,927 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-08 13:54:09,927 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -3 predicate places. [2025-02-08 13:54:09,928 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 128 flow [2025-02-08 13:54:09,928 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-08 13:54:09,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:09,928 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-02-08 13:54:09,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 13:54:09,928 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-08 13:54:09,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:09,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1990785235, now seen corresponding path program 1 times [2025-02-08 13:54:09,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:09,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984974326] [2025-02-08 13:54:09,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:09,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:09,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:54:09,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:54:09,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:09,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 13:54:09,939 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 13:54:09,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:54:09,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:54:09,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:09,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 13:54:09,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 13:54:09,951 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 13:54:09,951 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-02-08 13:54:09,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-02-08 13:54:09,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-02-08 13:54:09,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-02-08 13:54:09,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-02-08 13:54:09,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-02-08 13:54:09,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-02-08 13:54:09,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-02-08 13:54:09,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-02-08 13:54:09,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-02-08 13:54:09,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-02-08 13:54:09,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-02-08 13:54:09,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-02-08 13:54:09,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-02-08 13:54:09,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-02-08 13:54:09,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-02-08 13:54:09,953 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-02-08 13:54:09,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 13:54:09,953 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-08 13:54:09,954 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 13:54:09,954 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 13:54:09,988 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 13:54:09,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 81 transitions, 190 flow [2025-02-08 13:54:09,997 INFO L124 PetriNetUnfolderBase]: 8/92 cut-off events. [2025-02-08 13:54:09,998 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 13:54:09,998 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-08 13:54:09,998 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 81 transitions, 190 flow [2025-02-08 13:54:09,999 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 81 transitions, 190 flow [2025-02-08 13:54:10,000 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:54:10,000 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;@3d8894d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:54:10,000 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-02-08 13:54:10,002 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 13:54:10,002 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-02-08 13:54:10,002 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 13:54:10,003 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:10,003 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 13:54:10,003 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 13:54:10,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:10,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1487796732, now seen corresponding path program 1 times [2025-02-08 13:54:10,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:10,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479692753] [2025-02-08 13:54:10,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:10,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:10,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:54:10,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:54:10,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:10,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:10,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:10,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:10,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479692753] [2025-02-08 13:54:10,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479692753] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:10,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:10,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:10,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020263277] [2025-02-08 13:54:10,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:10,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:10,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:10,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:10,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:10,057 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 81 [2025-02-08 13:54:10,058 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-08 13:54:10,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:10,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 81 [2025-02-08 13:54:10,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:15,439 INFO L124 PetriNetUnfolderBase]: 56332/87830 cut-off events. [2025-02-08 13:54:15,439 INFO L125 PetriNetUnfolderBase]: For 6371/6371 co-relation queries the response was YES. [2025-02-08 13:54:15,576 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 778227 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-08 13:54:15,943 INFO L140 encePairwiseOnDemand]: 73/81 looper letters, 67 selfloop transitions, 2 changer transitions 0/104 dead transitions. [2025-02-08 13:54:15,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 104 transitions, 395 flow [2025-02-08 13:54:15,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:15,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:15,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 184 transitions. [2025-02-08 13:54:15,944 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.757201646090535 [2025-02-08 13:54:15,944 INFO L175 Difference]: Start difference. First operand has 82 places, 81 transitions, 190 flow. Second operand 3 states and 184 transitions. [2025-02-08 13:54:15,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 104 transitions, 395 flow [2025-02-08 13:54:15,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 104 transitions, 383 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-02-08 13:54:15,948 INFO L231 Difference]: Finished difference. Result has 82 places, 75 transitions, 176 flow [2025-02-08 13:54:15,948 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-08 13:54:15,949 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 0 predicate places. [2025-02-08 13:54:15,949 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 75 transitions, 176 flow [2025-02-08 13:54:15,949 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-08 13:54:15,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:15,949 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:15,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 13:54:15,949 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 13:54:15,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:15,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1122941952, now seen corresponding path program 1 times [2025-02-08 13:54:15,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:15,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232500214] [2025-02-08 13:54:15,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:15,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:15,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:54:15,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:54:15,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:15,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:15,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:15,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:15,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232500214] [2025-02-08 13:54:15,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232500214] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:15,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:15,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:15,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842979] [2025-02-08 13:54:15,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:15,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:15,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:15,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:15,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:15,998 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 81 [2025-02-08 13:54:15,999 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-08 13:54:15,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:15,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 81 [2025-02-08 13:54:15,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:20,070 INFO L124 PetriNetUnfolderBase]: 50073/74974 cut-off events. [2025-02-08 13:54:20,071 INFO L125 PetriNetUnfolderBase]: For 5429/5429 co-relation queries the response was YES. [2025-02-08 13:54:20,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144360 conditions, 74974 events. 50073/74974 cut-off events. For 5429/5429 co-relation queries the response was YES. Maximal size of possible extension queue 3551. Compared 594394 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-08 13:54:20,541 INFO L140 encePairwiseOnDemand]: 78/81 looper letters, 66 selfloop transitions, 2 changer transitions 0/103 dead transitions. [2025-02-08 13:54:20,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 103 transitions, 383 flow [2025-02-08 13:54:20,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:20,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:20,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2025-02-08 13:54:20,543 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7160493827160493 [2025-02-08 13:54:20,543 INFO L175 Difference]: Start difference. First operand has 82 places, 75 transitions, 176 flow. Second operand 3 states and 174 transitions. [2025-02-08 13:54:20,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 103 transitions, 383 flow [2025-02-08 13:54:20,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 103 transitions, 379 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:20,548 INFO L231 Difference]: Finished difference. Result has 81 places, 74 transitions, 174 flow [2025-02-08 13:54:20,548 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-08 13:54:20,549 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, -1 predicate places. [2025-02-08 13:54:20,549 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 74 transitions, 174 flow [2025-02-08 13:54:20,549 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-08 13:54:20,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:20,550 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:20,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 13:54:20,550 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 13:54:20,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:20,550 INFO L85 PathProgramCache]: Analyzing trace with hash 3266427, now seen corresponding path program 1 times [2025-02-08 13:54:20,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:20,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717716113] [2025-02-08 13:54:20,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:20,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:20,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 13:54:20,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 13:54:20,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:20,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:20,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:20,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:20,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717716113] [2025-02-08 13:54:20,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717716113] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:20,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:20,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:20,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624666802] [2025-02-08 13:54:20,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:20,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:20,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:20,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:20,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:20,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 81 [2025-02-08 13:54:20,599 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-08 13:54:20,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:20,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 81 [2025-02-08 13:54:20,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:25,137 INFO L124 PetriNetUnfolderBase]: 56329/87974 cut-off events. [2025-02-08 13:54:25,137 INFO L125 PetriNetUnfolderBase]: For 6225/6225 co-relation queries the response was YES. [2025-02-08 13:54:25,281 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 778292 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-08 13:54:25,559 INFO L140 encePairwiseOnDemand]: 78/81 looper letters, 66 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2025-02-08 13:54:25,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 101 transitions, 378 flow [2025-02-08 13:54:25,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:25,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:25,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2025-02-08 13:54:25,561 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7160493827160493 [2025-02-08 13:54:25,561 INFO L175 Difference]: Start difference. First operand has 81 places, 74 transitions, 174 flow. Second operand 3 states and 174 transitions. [2025-02-08 13:54:25,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 101 transitions, 378 flow [2025-02-08 13:54:25,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 101 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:25,565 INFO L231 Difference]: Finished difference. Result has 80 places, 73 transitions, 172 flow [2025-02-08 13:54:25,565 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-08 13:54:25,565 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, -2 predicate places. [2025-02-08 13:54:25,566 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 73 transitions, 172 flow [2025-02-08 13:54:25,566 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-08 13:54:25,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:25,566 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:25,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 13:54:25,566 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 13:54:25,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:25,567 INFO L85 PathProgramCache]: Analyzing trace with hash 101259643, now seen corresponding path program 1 times [2025-02-08 13:54:25,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:25,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299288930] [2025-02-08 13:54:25,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:25,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:25,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 13:54:25,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 13:54:25,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:25,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:25,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:25,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:25,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299288930] [2025-02-08 13:54:25,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299288930] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:25,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:25,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:25,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563412460] [2025-02-08 13:54:25,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:25,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:25,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:25,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:25,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:25,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 81 [2025-02-08 13:54:25,618 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-08 13:54:25,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:25,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 81 [2025-02-08 13:54:25,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:29,822 INFO L124 PetriNetUnfolderBase]: 50073/75358 cut-off events. [2025-02-08 13:54:29,822 INFO L125 PetriNetUnfolderBase]: For 5562/5562 co-relation queries the response was YES. [2025-02-08 13:54:29,935 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 600974 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-08 13:54:30,178 INFO L140 encePairwiseOnDemand]: 78/81 looper letters, 65 selfloop transitions, 2 changer transitions 0/100 dead transitions. [2025-02-08 13:54:30,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 100 transitions, 370 flow [2025-02-08 13:54:30,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:30,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:30,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2025-02-08 13:54:30,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7119341563786008 [2025-02-08 13:54:30,180 INFO L175 Difference]: Start difference. First operand has 80 places, 73 transitions, 172 flow. Second operand 3 states and 173 transitions. [2025-02-08 13:54:30,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 100 transitions, 370 flow [2025-02-08 13:54:30,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 100 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:30,188 INFO L231 Difference]: Finished difference. Result has 79 places, 72 transitions, 170 flow [2025-02-08 13:54:30,188 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-08 13:54:30,189 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, -3 predicate places. [2025-02-08 13:54:30,189 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 72 transitions, 170 flow [2025-02-08 13:54:30,189 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-08 13:54:30,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:30,190 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:30,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 13:54:30,190 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 13:54:30,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:30,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1181552799, now seen corresponding path program 1 times [2025-02-08 13:54:30,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:30,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428033401] [2025-02-08 13:54:30,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:30,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:30,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:54:30,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:54:30,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:30,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:30,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:30,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:30,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428033401] [2025-02-08 13:54:30,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428033401] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:30,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:30,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:30,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011597085] [2025-02-08 13:54:30,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:30,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:30,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:30,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:30,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:30,248 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 81 [2025-02-08 13:54:30,248 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-08 13:54:30,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:30,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 81 [2025-02-08 13:54:30,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 13:54:34,844 INFO L124 PetriNetUnfolderBase]: 56281/85001 cut-off events. [2025-02-08 13:54:34,845 INFO L125 PetriNetUnfolderBase]: For 6170/6170 co-relation queries the response was YES. [2025-02-08 13:54:34,959 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 695882 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-08 13:54:35,204 INFO L140 encePairwiseOnDemand]: 78/81 looper letters, 65 selfloop transitions, 2 changer transitions 0/98 dead transitions. [2025-02-08 13:54:35,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 98 transitions, 365 flow [2025-02-08 13:54:35,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:54:35,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 13:54:35,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2025-02-08 13:54:35,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7119341563786008 [2025-02-08 13:54:35,205 INFO L175 Difference]: Start difference. First operand has 79 places, 72 transitions, 170 flow. Second operand 3 states and 173 transitions. [2025-02-08 13:54:35,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 98 transitions, 365 flow [2025-02-08 13:54:35,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 98 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 13:54:35,211 INFO L231 Difference]: Finished difference. Result has 78 places, 71 transitions, 168 flow [2025-02-08 13:54:35,211 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-08 13:54:35,211 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, -4 predicate places. [2025-02-08 13:54:35,211 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 71 transitions, 168 flow [2025-02-08 13:54:35,213 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-08 13:54:35,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 13:54:35,213 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:54:35,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 13:54:35,213 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 13:54:35,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:54:35,214 INFO L85 PathProgramCache]: Analyzing trace with hash -2026568543, now seen corresponding path program 1 times [2025-02-08 13:54:35,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:54:35,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113651294] [2025-02-08 13:54:35,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:54:35,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:54:35,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 13:54:35,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 13:54:35,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:54:35,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:54:35,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:54:35,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:54:35,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113651294] [2025-02-08 13:54:35,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113651294] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:54:35,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:54:35,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:54:35,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26193272] [2025-02-08 13:54:35,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:54:35,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:54:35,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:54:35,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:54:35,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:54:35,261 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 81 [2025-02-08 13:54:35,262 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-08 13:54:35,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 13:54:35,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 81 [2025-02-08 13:54:35,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand