./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-word-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-word-trans.wvr.c -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 9cb2b0cbecf02e8cce2fd890595fb88c3204482a27ce7ac6f4ef6fb92949d747 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:49:43,592 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:49:43,650 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 18:49:43,653 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:49:43,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:49:43,667 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:49:43,667 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:49:43,668 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:49:43,668 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:49:43,668 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:49:43,668 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:49:43,668 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:49:43,668 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:49:43,668 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:49:43,668 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:49:43,668 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:49:43,668 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:49:43,668 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 18:49:43,668 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:49:43,668 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 18:49:43,669 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:49:43,669 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:49:43,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:49:43,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:49:43,669 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:49:43,669 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:49:43,669 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 18:49:43,669 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:49:43,669 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:49:43,669 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:49:43,669 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:49:43,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:49:43,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:49:43,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:49:43,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:49:43,669 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:49:43,669 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:49:43,669 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:49:43,670 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:49:43,670 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:49:43,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:49:43,670 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:49:43,670 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:49:43,670 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:49:43,670 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:49:43,670 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 -> 9cb2b0cbecf02e8cce2fd890595fb88c3204482a27ce7ac6f4ef6fb92949d747 [2025-02-06 18:49:43,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:49:43,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:49:43,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:49:43,948 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:49:43,948 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:49:43,949 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2025-02-06 18:49:45,126 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/944ce608f/30d0fcfa34d24e72bbaf2d8ab5942596/FLAGadd5f7ebc [2025-02-06 18:49:45,403 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:49:45,404 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2025-02-06 18:49:45,411 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/944ce608f/30d0fcfa34d24e72bbaf2d8ab5942596/FLAGadd5f7ebc [2025-02-06 18:49:45,702 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/944ce608f/30d0fcfa34d24e72bbaf2d8ab5942596 [2025-02-06 18:49:45,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:49:45,712 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:49:45,713 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:49:45,713 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:49:45,716 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:49:45,717 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:49:45" (1/1) ... [2025-02-06 18:49:45,719 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@110f12b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:45, skipping insertion in model container [2025-02-06 18:49:45,719 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:49:45" (1/1) ... [2025-02-06 18:49:45,735 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:49:45,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:49:45,880 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:49:45,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:49:45,922 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:49:45,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:45 WrapperNode [2025-02-06 18:49:45,923 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:49:45,923 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:49:45,924 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:49:45,924 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:49:45,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:45" (1/1) ... [2025-02-06 18:49:45,933 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:45" (1/1) ... [2025-02-06 18:49:45,951 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 164 [2025-02-06 18:49:45,952 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:49:45,952 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:49:45,952 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:49:45,953 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:49:45,958 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:45" (1/1) ... [2025-02-06 18:49:45,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:45" (1/1) ... [2025-02-06 18:49:45,965 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:45" (1/1) ... [2025-02-06 18:49:45,978 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-02-06 18:49:45,978 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:45" (1/1) ... [2025-02-06 18:49:45,979 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:45" (1/1) ... [2025-02-06 18:49:45,992 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:45" (1/1) ... [2025-02-06 18:49:45,993 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:45" (1/1) ... [2025-02-06 18:49:45,994 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:45" (1/1) ... [2025-02-06 18:49:45,996 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:45" (1/1) ... [2025-02-06 18:49:45,998 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:49:45,999 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:49:45,999 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:49:46,000 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:49:46,000 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:45" (1/1) ... [2025-02-06 18:49:46,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:49:46,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:49:46,024 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 18:49:46,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 18:49:46,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:49:46,043 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 18:49:46,043 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 18:49:46,043 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 18:49:46,043 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 18:49:46,043 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 18:49:46,043 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 18:49:46,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 18:49:46,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 18:49:46,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 18:49:46,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 18:49:46,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 18:49:46,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:49:46,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:49:46,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 18:49:46,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 18:49:46,045 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 18:49:46,144 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:49:46,146 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:49:46,486 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 18:49:46,486 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:49:46,666 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:49:46,670 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 18:49:46,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:49:46 BoogieIcfgContainer [2025-02-06 18:49:46,670 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:49:46,672 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:49:46,672 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:49:46,676 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:49:46,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:49:45" (1/3) ... [2025-02-06 18:49:46,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37adc9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:49:46, skipping insertion in model container [2025-02-06 18:49:46,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:49:45" (2/3) ... [2025-02-06 18:49:46,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37adc9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:49:46, skipping insertion in model container [2025-02-06 18:49:46,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:49:46" (3/3) ... [2025-02-06 18:49:46,679 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-word-trans.wvr.c [2025-02-06 18:49:46,691 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:49:46,695 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-word-trans.wvr.c that has 4 procedures, 75 locations, 1 initial locations, 6 loop locations, and 18 error locations. [2025-02-06 18:49:46,695 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 18:49:46,769 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 18:49:46,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 89 transitions, 199 flow [2025-02-06 18:49:46,877 INFO L124 PetriNetUnfolderBase]: 15/86 cut-off events. [2025-02-06 18:49:46,882 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 18:49:46,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 86 events. 15/86 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 277 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 66. Up to 3 conditions per place. [2025-02-06 18:49:46,885 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 89 transitions, 199 flow [2025-02-06 18:49:46,891 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 84 transitions, 183 flow [2025-02-06 18:49:46,901 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:49:46,916 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;@692a0a5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:49:46,916 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2025-02-06 18:49:46,924 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:49:46,924 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-02-06 18:49:46,924 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:49:46,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:46,925 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 18:49:46,925 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-02-06 18:49:46,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:46,933 INFO L85 PathProgramCache]: Analyzing trace with hash 675301, now seen corresponding path program 1 times [2025-02-06 18:49:46,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:46,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317592076] [2025-02-06 18:49:46,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:46,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:47,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 18:49:47,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 18:49:47,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:47,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:47,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:49:47,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:47,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317592076] [2025-02-06 18:49:47,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317592076] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:47,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:47,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:49:47,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052763925] [2025-02-06 18:49:47,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:47,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:49:47,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:47,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:49:47,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:49:47,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 89 [2025-02-06 18:49:47,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 84 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:47,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:47,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 89 [2025-02-06 18:49:47,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:47,898 INFO L124 PetriNetUnfolderBase]: 3619/6444 cut-off events. [2025-02-06 18:49:47,898 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2025-02-06 18:49:47,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11182 conditions, 6444 events. 3619/6444 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 44950 event pairs, 2208 based on Foata normal form. 3/4781 useless extension candidates. Maximal degree in co-relation 10537. Up to 4530 conditions per place. [2025-02-06 18:49:47,947 INFO L140 encePairwiseOnDemand]: 73/89 looper letters, 50 selfloop transitions, 10 changer transitions 0/93 dead transitions. [2025-02-06 18:49:47,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 93 transitions, 321 flow [2025-02-06 18:49:47,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:49:47,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:49:47,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2025-02-06 18:49:47,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5898876404494382 [2025-02-06 18:49:47,957 INFO L175 Difference]: Start difference. First operand has 79 places, 84 transitions, 183 flow. Second operand 4 states and 210 transitions. [2025-02-06 18:49:47,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 93 transitions, 321 flow [2025-02-06 18:49:47,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 93 transitions, 312 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 18:49:47,965 INFO L231 Difference]: Finished difference. Result has 80 places, 93 transitions, 262 flow [2025-02-06 18:49:47,967 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=262, PETRI_PLACES=80, PETRI_TRANSITIONS=93} [2025-02-06 18:49:47,969 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 1 predicate places. [2025-02-06 18:49:47,969 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 93 transitions, 262 flow [2025-02-06 18:49:47,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:47,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:47,970 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-06 18:49:47,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:49:47,970 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-02-06 18:49:47,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:47,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1356335397, now seen corresponding path program 1 times [2025-02-06 18:49:47,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:47,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354368066] [2025-02-06 18:49:47,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:47,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:47,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 18:49:47,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 18:49:47,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:47,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:48,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:49:48,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:48,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354368066] [2025-02-06 18:49:48,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354368066] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:49:48,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200476456] [2025-02-06 18:49:48,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:48,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:49:48,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:49:48,057 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:49:48,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 18:49:48,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 18:49:48,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 18:49:48,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:48,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:48,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 18:49:48,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:49:48,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:49:48,149 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:49:48,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200476456] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:48,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:49:48,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-06 18:49:48,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430337384] [2025-02-06 18:49:48,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:48,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:49:48,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:48,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:49:48,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:49:48,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 89 [2025-02-06 18:49:48,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 93 transitions, 262 flow. Second operand has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 6 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:48,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:48,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 89 [2025-02-06 18:49:48,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:48,681 INFO L124 PetriNetUnfolderBase]: 3619/6441 cut-off events. [2025-02-06 18:49:48,682 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-02-06 18:49:48,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11136 conditions, 6441 events. 3619/6441 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 44924 event pairs, 2208 based on Foata normal form. 3/4783 useless extension candidates. Maximal degree in co-relation 11063. Up to 4515 conditions per place. [2025-02-06 18:49:48,724 INFO L140 encePairwiseOnDemand]: 76/89 looper letters, 40 selfloop transitions, 17 changer transitions 0/90 dead transitions. [2025-02-06 18:49:48,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 90 transitions, 364 flow [2025-02-06 18:49:48,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:49:48,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:49:48,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 276 transitions. [2025-02-06 18:49:48,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5168539325842697 [2025-02-06 18:49:48,726 INFO L175 Difference]: Start difference. First operand has 80 places, 93 transitions, 262 flow. Second operand 6 states and 276 transitions. [2025-02-06 18:49:48,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 90 transitions, 364 flow [2025-02-06 18:49:48,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 90 transitions, 364 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:49:48,728 INFO L231 Difference]: Finished difference. Result has 82 places, 90 transitions, 284 flow [2025-02-06 18:49:48,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=284, PETRI_PLACES=82, PETRI_TRANSITIONS=90} [2025-02-06 18:49:48,729 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 3 predicate places. [2025-02-06 18:49:48,729 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 90 transitions, 284 flow [2025-02-06 18:49:48,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 6 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:48,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:48,729 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-02-06 18:49:48,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 18:49:48,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:49:48,934 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-02-06 18:49:48,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:48,935 INFO L85 PathProgramCache]: Analyzing trace with hash 903276265, now seen corresponding path program 1 times [2025-02-06 18:49:48,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:48,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410820405] [2025-02-06 18:49:48,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:48,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:48,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:49:48,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:49:48,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:48,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:48,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:49:49,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:49,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410820405] [2025-02-06 18:49:49,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410820405] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:49:49,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224791918] [2025-02-06 18:49:49,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:49,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:49:49,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:49:49,006 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:49:49,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 18:49:49,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:49:49,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:49:49,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:49,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:49,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 18:49:49,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:49:49,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:49:49,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:49:49,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:49:49,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224791918] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:49:49,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:49:49,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-02-06 18:49:49,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121882971] [2025-02-06 18:49:49,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:49:49,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 18:49:49,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:49,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 18:49:49,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 18:49:49,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 89 [2025-02-06 18:49:49,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 90 transitions, 284 flow. Second operand has 12 states, 12 states have (on average 37.083333333333336) internal successors, (445), 12 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:49,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:49,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 89 [2025-02-06 18:49:49,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:49,689 INFO L124 PetriNetUnfolderBase]: 3628/6477 cut-off events. [2025-02-06 18:49:49,689 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2025-02-06 18:49:49,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11277 conditions, 6477 events. 3628/6477 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 45307 event pairs, 2208 based on Foata normal form. 9/4825 useless extension candidates. Maximal degree in co-relation 11065. Up to 4530 conditions per place. [2025-02-06 18:49:49,712 INFO L140 encePairwiseOnDemand]: 76/89 looper letters, 47 selfloop transitions, 37 changer transitions 0/117 dead transitions. [2025-02-06 18:49:49,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 117 transitions, 626 flow [2025-02-06 18:49:49,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 18:49:49,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 18:49:49,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 453 transitions. [2025-02-06 18:49:49,714 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5089887640449439 [2025-02-06 18:49:49,714 INFO L175 Difference]: Start difference. First operand has 82 places, 90 transitions, 284 flow. Second operand 10 states and 453 transitions. [2025-02-06 18:49:49,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 117 transitions, 626 flow [2025-02-06 18:49:49,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 117 transitions, 543 flow, removed 16 selfloop flow, removed 5 redundant places. [2025-02-06 18:49:49,717 INFO L231 Difference]: Finished difference. Result has 89 places, 117 transitions, 499 flow [2025-02-06 18:49:49,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=499, PETRI_PLACES=89, PETRI_TRANSITIONS=117} [2025-02-06 18:49:49,717 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 10 predicate places. [2025-02-06 18:49:49,718 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 117 transitions, 499 flow [2025-02-06 18:49:49,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 37.083333333333336) internal successors, (445), 12 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:49,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:49,718 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:49:49,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 18:49:49,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:49:49,922 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-02-06 18:49:49,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:49,922 INFO L85 PathProgramCache]: Analyzing trace with hash -2115868396, now seen corresponding path program 1 times [2025-02-06 18:49:49,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:49,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264710665] [2025-02-06 18:49:49,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:49,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:49,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 18:49:49,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 18:49:49,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:49,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:50,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:49:50,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:50,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264710665] [2025-02-06 18:49:50,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264710665] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:50,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:50,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:49:50,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602351949] [2025-02-06 18:49:50,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:50,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:49:50,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:50,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:49:50,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:49:50,045 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 89 [2025-02-06 18:49:50,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 117 transitions, 499 flow. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:50,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:50,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 89 [2025-02-06 18:49:50,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:50,730 INFO L124 PetriNetUnfolderBase]: 6605/10634 cut-off events. [2025-02-06 18:49:50,731 INFO L125 PetriNetUnfolderBase]: For 160/160 co-relation queries the response was YES. [2025-02-06 18:49:50,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19461 conditions, 10634 events. 6605/10634 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 68519 event pairs, 3248 based on Foata normal form. 146/8256 useless extension candidates. Maximal degree in co-relation 19363. Up to 6583 conditions per place. [2025-02-06 18:49:50,795 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 131 selfloop transitions, 4 changer transitions 0/168 dead transitions. [2025-02-06 18:49:50,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 168 transitions, 877 flow [2025-02-06 18:49:50,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:49:50,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:49:50,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 257 transitions. [2025-02-06 18:49:50,797 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7219101123595506 [2025-02-06 18:49:50,797 INFO L175 Difference]: Start difference. First operand has 89 places, 117 transitions, 499 flow. Second operand 4 states and 257 transitions. [2025-02-06 18:49:50,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 168 transitions, 877 flow [2025-02-06 18:49:50,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 168 transitions, 840 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-02-06 18:49:50,801 INFO L231 Difference]: Finished difference. Result has 92 places, 120 transitions, 491 flow [2025-02-06 18:49:50,801 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=491, PETRI_PLACES=92, PETRI_TRANSITIONS=120} [2025-02-06 18:49:50,801 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 13 predicate places. [2025-02-06 18:49:50,801 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 120 transitions, 491 flow [2025-02-06 18:49:50,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:50,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:50,802 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:49:50,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 18:49:50,802 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-02-06 18:49:50,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:50,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1167441958, now seen corresponding path program 1 times [2025-02-06 18:49:50,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:50,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537306847] [2025-02-06 18:49:50,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:50,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:50,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 18:49:50,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 18:49:50,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:50,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:50,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:49:50,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:50,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537306847] [2025-02-06 18:49:50,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537306847] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:50,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:50,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:49:50,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395384384] [2025-02-06 18:49:50,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:50,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:49:50,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:50,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:49:50,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:49:50,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 89 [2025-02-06 18:49:50,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 120 transitions, 491 flow. Second operand has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:50,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:50,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 89 [2025-02-06 18:49:50,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:52,370 INFO L124 PetriNetUnfolderBase]: 12414/21860 cut-off events. [2025-02-06 18:49:52,370 INFO L125 PetriNetUnfolderBase]: For 2476/2492 co-relation queries the response was YES. [2025-02-06 18:49:52,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40170 conditions, 21860 events. 12414/21860 cut-off events. For 2476/2492 co-relation queries the response was YES. Maximal size of possible extension queue 1047. Compared 179123 event pairs, 7206 based on Foata normal form. 304/17174 useless extension candidates. Maximal degree in co-relation 40046. Up to 7814 conditions per place. [2025-02-06 18:49:52,515 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 127 selfloop transitions, 11 changer transitions 0/173 dead transitions. [2025-02-06 18:49:52,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 173 transitions, 956 flow [2025-02-06 18:49:52,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:49:52,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:49:52,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 333 transitions. [2025-02-06 18:49:52,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6235955056179775 [2025-02-06 18:49:52,517 INFO L175 Difference]: Start difference. First operand has 92 places, 120 transitions, 491 flow. Second operand 6 states and 333 transitions. [2025-02-06 18:49:52,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 173 transitions, 956 flow [2025-02-06 18:49:52,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 173 transitions, 951 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:49:52,527 INFO L231 Difference]: Finished difference. Result has 99 places, 123 transitions, 541 flow [2025-02-06 18:49:52,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=541, PETRI_PLACES=99, PETRI_TRANSITIONS=123} [2025-02-06 18:49:52,529 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 20 predicate places. [2025-02-06 18:49:52,529 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 123 transitions, 541 flow [2025-02-06 18:49:52,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:52,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:52,529 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:49:52,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 18:49:52,529 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-02-06 18:49:52,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:52,530 INFO L85 PathProgramCache]: Analyzing trace with hash -38697291, now seen corresponding path program 1 times [2025-02-06 18:49:52,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:52,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537057918] [2025-02-06 18:49:52,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:52,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:52,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 18:49:52,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 18:49:52,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:52,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:52,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:49:52,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:52,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537057918] [2025-02-06 18:49:52,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537057918] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:52,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:52,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:49:52,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762701280] [2025-02-06 18:49:52,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:52,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:49:52,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:52,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:49:52,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:49:52,629 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 89 [2025-02-06 18:49:52,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 123 transitions, 541 flow. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:52,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:52,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 89 [2025-02-06 18:49:52,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:54,509 INFO L124 PetriNetUnfolderBase]: 19844/31572 cut-off events. [2025-02-06 18:49:54,509 INFO L125 PetriNetUnfolderBase]: For 3705/4117 co-relation queries the response was YES. [2025-02-06 18:49:54,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61328 conditions, 31572 events. 19844/31572 cut-off events. For 3705/4117 co-relation queries the response was YES. Maximal size of possible extension queue 1071. Compared 230915 event pairs, 9872 based on Foata normal form. 448/26531 useless extension candidates. Maximal degree in co-relation 61201. Up to 19570 conditions per place. [2025-02-06 18:49:54,705 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 137 selfloop transitions, 4 changer transitions 0/176 dead transitions. [2025-02-06 18:49:54,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 176 transitions, 959 flow [2025-02-06 18:49:54,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:49:54,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:49:54,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 255 transitions. [2025-02-06 18:49:54,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7162921348314607 [2025-02-06 18:49:54,709 INFO L175 Difference]: Start difference. First operand has 99 places, 123 transitions, 541 flow. Second operand 4 states and 255 transitions. [2025-02-06 18:49:54,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 176 transitions, 959 flow [2025-02-06 18:49:54,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 176 transitions, 951 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 18:49:54,716 INFO L231 Difference]: Finished difference. Result has 103 places, 126 transitions, 562 flow [2025-02-06 18:49:54,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=562, PETRI_PLACES=103, PETRI_TRANSITIONS=126} [2025-02-06 18:49:54,719 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 24 predicate places. [2025-02-06 18:49:54,719 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 126 transitions, 562 flow [2025-02-06 18:49:54,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:54,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:54,719 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:49:54,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:49:54,719 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-02-06 18:49:54,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:54,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1830961674, now seen corresponding path program 1 times [2025-02-06 18:49:54,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:54,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296745945] [2025-02-06 18:49:54,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:54,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:54,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 18:49:54,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 18:49:54,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:54,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:54,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:49:54,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:54,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296745945] [2025-02-06 18:49:54,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296745945] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:54,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:54,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:49:54,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781731110] [2025-02-06 18:49:54,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:54,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:49:54,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:54,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:49:54,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:49:54,842 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 89 [2025-02-06 18:49:54,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 126 transitions, 562 flow. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:54,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:54,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 89 [2025-02-06 18:49:54,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:58,349 INFO L124 PetriNetUnfolderBase]: 35308/63632 cut-off events. [2025-02-06 18:49:58,349 INFO L125 PetriNetUnfolderBase]: For 18461/18639 co-relation queries the response was YES. [2025-02-06 18:49:58,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125921 conditions, 63632 events. 35308/63632 cut-off events. For 18461/18639 co-relation queries the response was YES. Maximal size of possible extension queue 2501. Compared 609688 event pairs, 20812 based on Foata normal form. 856/55092 useless extension candidates. Maximal degree in co-relation 125706. Up to 21617 conditions per place. [2025-02-06 18:49:58,782 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 158 selfloop transitions, 4 changer transitions 0/198 dead transitions. [2025-02-06 18:49:58,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 198 transitions, 1217 flow [2025-02-06 18:49:58,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:49:58,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:49:58,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2025-02-06 18:49:58,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7106741573033708 [2025-02-06 18:49:58,783 INFO L175 Difference]: Start difference. First operand has 103 places, 126 transitions, 562 flow. Second operand 4 states and 253 transitions. [2025-02-06 18:49:58,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 198 transitions, 1217 flow [2025-02-06 18:49:58,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 198 transitions, 1212 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:49:58,821 INFO L231 Difference]: Finished difference. Result has 107 places, 127 transitions, 582 flow [2025-02-06 18:49:58,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=582, PETRI_PLACES=107, PETRI_TRANSITIONS=127} [2025-02-06 18:49:58,822 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 28 predicate places. [2025-02-06 18:49:58,822 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 127 transitions, 582 flow [2025-02-06 18:49:58,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:58,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:58,822 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:49:58,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 18:49:58,823 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-02-06 18:49:58,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:58,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1199647124, now seen corresponding path program 1 times [2025-02-06 18:49:58,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:58,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002749832] [2025-02-06 18:49:58,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:58,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:58,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:49:58,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:49:58,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:58,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:58,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:49:58,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:58,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002749832] [2025-02-06 18:49:58,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002749832] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:58,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:58,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:49:58,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102520326] [2025-02-06 18:49:58,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:58,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:49:58,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:58,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:49:58,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:49:58,953 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 89 [2025-02-06 18:49:58,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 127 transitions, 582 flow. Second operand has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:49:58,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:58,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 89 [2025-02-06 18:49:58,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:50:05,951 INFO L124 PetriNetUnfolderBase]: 74500/131096 cut-off events. [2025-02-06 18:50:05,951 INFO L125 PetriNetUnfolderBase]: For 23354/23714 co-relation queries the response was YES. [2025-02-06 18:50:06,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253279 conditions, 131096 events. 74500/131096 cut-off events. For 23354/23714 co-relation queries the response was YES. Maximal size of possible extension queue 5019. Compared 1335620 event pairs, 43464 based on Foata normal form. 1584/110065 useless extension candidates. Maximal degree in co-relation 253063. Up to 46472 conditions per place. [2025-02-06 18:50:07,135 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 114 selfloop transitions, 15 changer transitions 0/167 dead transitions. [2025-02-06 18:50:07,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 167 transitions, 950 flow [2025-02-06 18:50:07,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:50:07,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 18:50:07,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 287 transitions. [2025-02-06 18:50:07,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6449438202247191 [2025-02-06 18:50:07,137 INFO L175 Difference]: Start difference. First operand has 107 places, 127 transitions, 582 flow. Second operand 5 states and 287 transitions. [2025-02-06 18:50:07,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 167 transitions, 950 flow [2025-02-06 18:50:07,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 167 transitions, 948 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-06 18:50:07,230 INFO L231 Difference]: Finished difference. Result has 113 places, 128 transitions, 632 flow [2025-02-06 18:50:07,230 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=632, PETRI_PLACES=113, PETRI_TRANSITIONS=128} [2025-02-06 18:50:07,231 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 34 predicate places. [2025-02-06 18:50:07,231 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 128 transitions, 632 flow [2025-02-06 18:50:07,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:50:07,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:50:07,231 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:50:07,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 18:50:07,232 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-02-06 18:50:07,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:50:07,232 INFO L85 PathProgramCache]: Analyzing trace with hash -2088074571, now seen corresponding path program 1 times [2025-02-06 18:50:07,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:50:07,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105698077] [2025-02-06 18:50:07,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:50:07,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:50:07,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 18:50:07,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 18:50:07,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:50:07,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:50:07,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:50:07,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:50:07,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105698077] [2025-02-06 18:50:07,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105698077] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:50:07,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666226] [2025-02-06 18:50:07,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:50:07,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:50:07,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:50:07,348 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:50:07,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 18:50:07,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 18:50:07,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 18:50:07,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:50:07,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:50:07,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 18:50:07,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:50:07,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:50:07,462 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:50:07,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666226] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:50:07,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:50:07,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2025-02-06 18:50:07,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988899420] [2025-02-06 18:50:07,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:50:07,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:50:07,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:50:07,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:50:07,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:50:07,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 89 [2025-02-06 18:50:07,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 128 transitions, 632 flow. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:50:07,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:50:07,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 89 [2025-02-06 18:50:07,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:50:14,215 INFO L124 PetriNetUnfolderBase]: 65028/118644 cut-off events. [2025-02-06 18:50:14,215 INFO L125 PetriNetUnfolderBase]: For 32675/32835 co-relation queries the response was YES. [2025-02-06 18:50:14,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229894 conditions, 118644 events. 65028/118644 cut-off events. For 32675/32835 co-relation queries the response was YES. Maximal size of possible extension queue 4334. Compared 1235091 event pairs, 39960 based on Foata normal form. 1960/103408 useless extension candidates. Maximal degree in co-relation 229670. Up to 79658 conditions per place. [2025-02-06 18:50:15,338 INFO L140 encePairwiseOnDemand]: 87/89 looper letters, 86 selfloop transitions, 1 changer transitions 0/126 dead transitions. [2025-02-06 18:50:15,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 126 transitions, 792 flow [2025-02-06 18:50:15,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:50:15,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:50:15,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2025-02-06 18:50:15,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6329588014981273 [2025-02-06 18:50:15,341 INFO L175 Difference]: Start difference. First operand has 113 places, 128 transitions, 632 flow. Second operand 3 states and 169 transitions. [2025-02-06 18:50:15,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 126 transitions, 792 flow [2025-02-06 18:50:15,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 126 transitions, 765 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 18:50:15,447 INFO L231 Difference]: Finished difference. Result has 109 places, 126 transitions, 593 flow [2025-02-06 18:50:15,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=593, PETRI_PLACES=109, PETRI_TRANSITIONS=126} [2025-02-06 18:50:15,448 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 30 predicate places. [2025-02-06 18:50:15,448 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 126 transitions, 593 flow [2025-02-06 18:50:15,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:50:15,448 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:50:15,449 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:50:15,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 18:50:15,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:50:15,649 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-02-06 18:50:15,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:50:15,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1465645495, now seen corresponding path program 1 times [2025-02-06 18:50:15,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:50:15,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900478284] [2025-02-06 18:50:15,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:50:15,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:50:15,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 18:50:15,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 18:50:15,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:50:15,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:50:15,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:50:15,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:50:15,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900478284] [2025-02-06 18:50:15,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900478284] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:50:15,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:50:15,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:50:15,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124219453] [2025-02-06 18:50:15,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:50:15,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:50:15,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:50:15,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:50:15,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:50:15,767 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 89 [2025-02-06 18:50:15,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 126 transitions, 593 flow. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:50:15,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:50:15,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 89 [2025-02-06 18:50:15,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:50:22,745 INFO L124 PetriNetUnfolderBase]: 71357/126981 cut-off events. [2025-02-06 18:50:22,745 INFO L125 PetriNetUnfolderBase]: For 33643/33887 co-relation queries the response was YES. [2025-02-06 18:50:23,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250643 conditions, 126981 events. 71357/126981 cut-off events. For 33643/33887 co-relation queries the response was YES. Maximal size of possible extension queue 4840. Compared 1303255 event pairs, 42190 based on Foata normal form. 1048/109009 useless extension candidates. Maximal degree in co-relation 250620. Up to 44304 conditions per place. [2025-02-06 18:50:23,721 INFO L140 encePairwiseOnDemand]: 82/89 looper letters, 133 selfloop transitions, 10 changer transitions 0/179 dead transitions. [2025-02-06 18:50:23,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 179 transitions, 1072 flow [2025-02-06 18:50:23,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:50:23,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 18:50:23,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 293 transitions. [2025-02-06 18:50:23,722 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6584269662921348 [2025-02-06 18:50:23,722 INFO L175 Difference]: Start difference. First operand has 109 places, 126 transitions, 593 flow. Second operand 5 states and 293 transitions. [2025-02-06 18:50:23,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 179 transitions, 1072 flow [2025-02-06 18:50:23,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 179 transitions, 1071 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:50:23,832 INFO L231 Difference]: Finished difference. Result has 114 places, 127 transitions, 632 flow [2025-02-06 18:50:23,833 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=632, PETRI_PLACES=114, PETRI_TRANSITIONS=127} [2025-02-06 18:50:23,833 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 35 predicate places. [2025-02-06 18:50:23,833 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 127 transitions, 632 flow [2025-02-06 18:50:23,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:50:23,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:50:23,833 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:50:23,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 18:50:23,834 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 30 more)] === [2025-02-06 18:50:23,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:50:23,834 INFO L85 PathProgramCache]: Analyzing trace with hash 972663841, now seen corresponding path program 1 times [2025-02-06 18:50:23,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:50:23,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289483036] [2025-02-06 18:50:23,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:50:23,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:50:23,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 18:50:23,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 18:50:23,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:50:23,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:50:24,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:50:24,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:50:24,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289483036] [2025-02-06 18:50:24,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289483036] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:50:24,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:50:24,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:50:24,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123687730] [2025-02-06 18:50:24,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:50:24,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:50:24,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:50:24,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:50:24,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:50:24,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 89 [2025-02-06 18:50:24,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 127 transitions, 632 flow. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:50:24,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:50:24,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 89 [2025-02-06 18:50:24,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand