./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-node-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-node-symm.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9db11e263e78e3a6bd75c2a0c3dda64920ec857df2fbb1d0b7b1072a48f36a31 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:25:15,642 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:25:15,697 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:25:15,700 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:25:15,700 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:25:15,721 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:25:15,722 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:25:15,722 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:25:15,723 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:25:15,723 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:25:15,723 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:25:15,724 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:25:15,724 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:25:15,724 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:25:15,724 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:25:15,724 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:25:15,724 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:25:15,724 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:25:15,724 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:25:15,724 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:25:15,724 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:25:15,724 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:25:15,724 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:25:15,724 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:25:15,724 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:25:15,724 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:25:15,724 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:25:15,725 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:25:15,725 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:25:15,725 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:25:15,725 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:25:15,725 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:25:15,725 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:25:15,726 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:25:15,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:25:15,726 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:25:15,726 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:25:15,726 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:25:15,726 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:25:15,726 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:25:15,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:25:15,726 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:25:15,726 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:25:15,726 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:25:15,727 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:25:15,727 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9db11e263e78e3a6bd75c2a0c3dda64920ec857df2fbb1d0b7b1072a48f36a31 [2025-03-04 15:25:15,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:25:15,959 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:25:15,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:25:15,961 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:25:15,961 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:25:15,962 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-symm.wvr.c [2025-03-04 15:25:17,137 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba5587e59/4ea4ae474c7f4bb899178a2e73a3aee3/FLAGcf1b77bdc [2025-03-04 15:25:17,412 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:25:17,412 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-symm.wvr.c [2025-03-04 15:25:17,424 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba5587e59/4ea4ae474c7f4bb899178a2e73a3aee3/FLAGcf1b77bdc [2025-03-04 15:25:17,440 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba5587e59/4ea4ae474c7f4bb899178a2e73a3aee3 [2025-03-04 15:25:17,443 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:25:17,444 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:25:17,445 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:25:17,445 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:25:17,448 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:25:17,449 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:25:17" (1/1) ... [2025-03-04 15:25:17,450 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19d8af91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:17, skipping insertion in model container [2025-03-04 15:25:17,450 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:25:17" (1/1) ... [2025-03-04 15:25:17,466 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:25:17,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:25:17,615 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:25:17,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:25:17,662 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:25:17,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:17 WrapperNode [2025-03-04 15:25:17,663 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:25:17,664 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:25:17,664 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:25:17,664 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:25:17,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:17" (1/1) ... [2025-03-04 15:25:17,675 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:17" (1/1) ... [2025-03-04 15:25:17,705 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 19, calls inlined = 25, statements flattened = 325 [2025-03-04 15:25:17,705 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:25:17,706 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:25:17,706 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:25:17,706 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:25:17,712 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:17" (1/1) ... [2025-03-04 15:25:17,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:17" (1/1) ... [2025-03-04 15:25:17,719 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:17" (1/1) ... [2025-03-04 15:25:17,736 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 10, 6]. 56 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 4 writes are split as follows [0, 2, 2]. [2025-03-04 15:25:17,737 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:17" (1/1) ... [2025-03-04 15:25:17,737 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:17" (1/1) ... [2025-03-04 15:25:17,742 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:17" (1/1) ... [2025-03-04 15:25:17,745 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:17" (1/1) ... [2025-03-04 15:25:17,747 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:17" (1/1) ... [2025-03-04 15:25:17,747 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:17" (1/1) ... [2025-03-04 15:25:17,749 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:25:17,753 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:25:17,753 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:25:17,753 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:25:17,754 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:17" (1/1) ... [2025-03-04 15:25:17,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:25:17,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:25:17,781 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:25:17,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:25:17,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:25:17,798 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:25:17,798 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:25:17,798 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:25:17,798 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:25:17,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:25:17,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:25:17,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:25:17,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:25:17,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:25:17,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:25:17,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:25:17,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:25:17,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:25:17,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:25:17,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:25:17,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:25:17,800 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:25:17,900 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:25:17,901 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:25:18,393 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:25:18,393 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:25:18,693 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:25:18,694 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:25:18,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:25:18 BoogieIcfgContainer [2025-03-04 15:25:18,695 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:25:18,696 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:25:18,697 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:25:18,700 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:25:18,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:25:17" (1/3) ... [2025-03-04 15:25:18,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7850fb8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:25:18, skipping insertion in model container [2025-03-04 15:25:18,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:17" (2/3) ... [2025-03-04 15:25:18,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7850fb8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:25:18, skipping insertion in model container [2025-03-04 15:25:18,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:25:18" (3/3) ... [2025-03-04 15:25:18,703 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-symm.wvr.c [2025-03-04 15:25:18,714 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:25:18,716 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-symm.wvr.c that has 3 procedures, 88 locations, 1 initial locations, 4 loop locations, and 30 error locations. [2025-03-04 15:25:18,716 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:25:18,772 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:25:18,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 97 transitions, 208 flow [2025-03-04 15:25:18,834 INFO L124 PetriNetUnfolderBase]: 10/95 cut-off events. [2025-03-04 15:25:18,835 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:25:18,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 95 events. 10/95 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 252 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2025-03-04 15:25:18,838 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 97 transitions, 208 flow [2025-03-04 15:25:18,841 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 94 transitions, 200 flow [2025-03-04 15:25:18,849 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:25:18,856 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;@32676a6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:25:18,856 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2025-03-04 15:25:18,859 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:25:18,860 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-03-04 15:25:18,860 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:25:18,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:18,861 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-04 15:25:18,861 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:25:18,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:18,864 INFO L85 PathProgramCache]: Analyzing trace with hash 29570, now seen corresponding path program 1 times [2025-03-04 15:25:18,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:18,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810902264] [2025-03-04 15:25:18,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:18,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:18,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:25:18,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:25:18,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:18,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:18,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:25:19,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:19,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810902264] [2025-03-04 15:25:19,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810902264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:19,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:19,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:19,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957420078] [2025-03-04 15:25:19,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:19,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:19,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:19,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:19,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:19,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-03-04 15:25:19,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 94 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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-03-04 15:25:19,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:19,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-03-04 15:25:19,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:19,249 INFO L124 PetriNetUnfolderBase]: 285/731 cut-off events. [2025-03-04 15:25:19,252 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-03-04 15:25:19,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1209 conditions, 731 events. 285/731 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4323 event pairs, 176 based on Foata normal form. 4/575 useless extension candidates. Maximal degree in co-relation 1096. Up to 450 conditions per place. [2025-03-04 15:25:19,258 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 41 selfloop transitions, 1 changer transitions 2/90 dead transitions. [2025-03-04 15:25:19,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 90 transitions, 278 flow [2025-03-04 15:25:19,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:19,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:19,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2025-03-04 15:25:19,271 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-04 15:25:19,272 INFO L175 Difference]: Start difference. First operand has 91 places, 94 transitions, 200 flow. Second operand 3 states and 194 transitions. [2025-03-04 15:25:19,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 90 transitions, 278 flow [2025-03-04 15:25:19,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 90 transitions, 270 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:25:19,278 INFO L231 Difference]: Finished difference. Result has 85 places, 88 transitions, 181 flow [2025-03-04 15:25:19,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=85, PETRI_TRANSITIONS=88} [2025-03-04 15:25:19,284 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -6 predicate places. [2025-03-04 15:25:19,285 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 88 transitions, 181 flow [2025-03-04 15:25:19,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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-03-04 15:25:19,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:19,285 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:25:19,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:25:19,286 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:25:19,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:19,287 INFO L85 PathProgramCache]: Analyzing trace with hash 917489, now seen corresponding path program 1 times [2025-03-04 15:25:19,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:19,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729434824] [2025-03-04 15:25:19,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:19,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:19,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:25:19,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:25:19,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:19,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:19,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:25:19,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:19,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729434824] [2025-03-04 15:25:19,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729434824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:19,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:19,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:19,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776978585] [2025-03-04 15:25:19,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:19,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:19,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:19,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:19,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:19,353 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-03-04 15:25:19,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 88 transitions, 181 flow. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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-03-04 15:25:19,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:19,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-03-04 15:25:19,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:19,461 INFO L124 PetriNetUnfolderBase]: 285/727 cut-off events. [2025-03-04 15:25:19,461 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 15:25:19,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 727 events. 285/727 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4310 event pairs, 176 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 1180. Up to 447 conditions per place. [2025-03-04 15:25:19,467 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 39 selfloop transitions, 1 changer transitions 0/86 dead transitions. [2025-03-04 15:25:19,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 86 transitions, 257 flow [2025-03-04 15:25:19,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:19,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:19,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2025-03-04 15:25:19,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6494845360824743 [2025-03-04 15:25:19,469 INFO L175 Difference]: Start difference. First operand has 85 places, 88 transitions, 181 flow. Second operand 3 states and 189 transitions. [2025-03-04 15:25:19,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 86 transitions, 257 flow [2025-03-04 15:25:19,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 86 transitions, 256 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:19,470 INFO L231 Difference]: Finished difference. Result has 82 places, 86 transitions, 178 flow [2025-03-04 15:25:19,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=82, PETRI_TRANSITIONS=86} [2025-03-04 15:25:19,471 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -9 predicate places. [2025-03-04 15:25:19,471 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 86 transitions, 178 flow [2025-03-04 15:25:19,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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-03-04 15:25:19,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:19,471 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:25:19,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:25:19,471 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:25:19,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:19,471 INFO L85 PathProgramCache]: Analyzing trace with hash 881734808, now seen corresponding path program 1 times [2025-03-04 15:25:19,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:19,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470351074] [2025-03-04 15:25:19,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:19,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:19,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:25:19,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:25:19,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:19,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:19,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:25:19,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:19,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470351074] [2025-03-04 15:25:19,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470351074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:19,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:19,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:19,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70898226] [2025-03-04 15:25:19,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:19,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:19,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:19,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:19,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:19,607 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-03-04 15:25:19,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 86 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 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-03-04 15:25:19,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:19,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-03-04 15:25:19,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:19,769 INFO L124 PetriNetUnfolderBase]: 287/735 cut-off events. [2025-03-04 15:25:19,769 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 15:25:19,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1205 conditions, 735 events. 287/735 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4329 event pairs, 176 based on Foata normal form. 2/577 useless extension candidates. Maximal degree in co-relation 1198. Up to 454 conditions per place. [2025-03-04 15:25:19,772 INFO L140 encePairwiseOnDemand]: 85/97 looper letters, 42 selfloop transitions, 8 changer transitions 0/92 dead transitions. [2025-03-04 15:25:19,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 92 transitions, 290 flow [2025-03-04 15:25:19,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:19,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:19,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2025-03-04 15:25:19,774 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6443298969072165 [2025-03-04 15:25:19,774 INFO L175 Difference]: Start difference. First operand has 82 places, 86 transitions, 178 flow. Second operand 4 states and 250 transitions. [2025-03-04 15:25:19,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 92 transitions, 290 flow [2025-03-04 15:25:19,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 92 transitions, 289 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:19,778 INFO L231 Difference]: Finished difference. Result has 86 places, 92 transitions, 235 flow [2025-03-04 15:25:19,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=235, PETRI_PLACES=86, PETRI_TRANSITIONS=92} [2025-03-04 15:25:19,779 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -5 predicate places. [2025-03-04 15:25:19,779 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 92 transitions, 235 flow [2025-03-04 15:25:19,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 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-03-04 15:25:19,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:19,779 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:25:19,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:25:19,780 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:25:19,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:19,780 INFO L85 PathProgramCache]: Analyzing trace with hash 881734859, now seen corresponding path program 1 times [2025-03-04 15:25:19,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:19,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405400140] [2025-03-04 15:25:19,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:19,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:19,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:25:19,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:25:19,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:19,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:19,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:25:19,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:19,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405400140] [2025-03-04 15:25:19,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405400140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:19,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:19,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:19,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390413519] [2025-03-04 15:25:19,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:19,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:19,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:19,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:19,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:19,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-03-04 15:25:19,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 92 transitions, 235 flow. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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-03-04 15:25:19,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:19,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-03-04 15:25:19,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:19,944 INFO L124 PetriNetUnfolderBase]: 287/733 cut-off events. [2025-03-04 15:25:19,945 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 15:25:19,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1227 conditions, 733 events. 287/733 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4343 event pairs, 176 based on Foata normal form. 2/580 useless extension candidates. Maximal degree in co-relation 1218. Up to 455 conditions per place. [2025-03-04 15:25:19,948 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 47 selfloop transitions, 1 changer transitions 0/90 dead transitions. [2025-03-04 15:25:19,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 90 transitions, 327 flow [2025-03-04 15:25:19,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:19,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:19,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2025-03-04 15:25:19,949 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6563573883161512 [2025-03-04 15:25:19,949 INFO L175 Difference]: Start difference. First operand has 86 places, 92 transitions, 235 flow. Second operand 3 states and 191 transitions. [2025-03-04 15:25:19,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 90 transitions, 327 flow [2025-03-04 15:25:19,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 90 transitions, 321 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:19,950 INFO L231 Difference]: Finished difference. Result has 85 places, 90 transitions, 227 flow [2025-03-04 15:25:19,951 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=227, PETRI_PLACES=85, PETRI_TRANSITIONS=90} [2025-03-04 15:25:19,951 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -6 predicate places. [2025-03-04 15:25:19,951 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 90 transitions, 227 flow [2025-03-04 15:25:19,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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-03-04 15:25:19,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:19,951 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:25:19,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:25:19,951 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:25:19,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:19,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1563977666, now seen corresponding path program 1 times [2025-03-04 15:25:19,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:19,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243043786] [2025-03-04 15:25:19,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:19,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:19,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:25:19,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:25:19,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:19,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:20,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:25:20,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:20,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243043786] [2025-03-04 15:25:20,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243043786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:20,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:20,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:20,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169924480] [2025-03-04 15:25:20,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:20,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:20,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:20,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:20,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:20,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-03-04 15:25:20,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 90 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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-03-04 15:25:20,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:20,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-03-04 15:25:20,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:20,114 INFO L124 PetriNetUnfolderBase]: 287/731 cut-off events. [2025-03-04 15:25:20,115 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-04 15:25:20,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1220 conditions, 731 events. 287/731 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4315 event pairs, 176 based on Foata normal form. 1/578 useless extension candidates. Maximal degree in co-relation 1210. Up to 453 conditions per place. [2025-03-04 15:25:20,121 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 45 selfloop transitions, 1 changer transitions 0/88 dead transitions. [2025-03-04 15:25:20,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 88 transitions, 315 flow [2025-03-04 15:25:20,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:20,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:20,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2025-03-04 15:25:20,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6494845360824743 [2025-03-04 15:25:20,123 INFO L175 Difference]: Start difference. First operand has 85 places, 90 transitions, 227 flow. Second operand 3 states and 189 transitions. [2025-03-04 15:25:20,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 88 transitions, 315 flow [2025-03-04 15:25:20,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 88 transitions, 314 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:20,128 INFO L231 Difference]: Finished difference. Result has 84 places, 88 transitions, 224 flow [2025-03-04 15:25:20,128 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=84, PETRI_TRANSITIONS=88} [2025-03-04 15:25:20,128 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -7 predicate places. [2025-03-04 15:25:20,129 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 88 transitions, 224 flow [2025-03-04 15:25:20,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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-03-04 15:25:20,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:20,129 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:20,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:25:20,131 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:25:20,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:20,131 INFO L85 PathProgramCache]: Analyzing trace with hash -257479206, now seen corresponding path program 1 times [2025-03-04 15:25:20,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:20,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951441175] [2025-03-04 15:25:20,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:20,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:20,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:25:20,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:25:20,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:20,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:20,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:25:20,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:20,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951441175] [2025-03-04 15:25:20,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951441175] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:25:20,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440815818] [2025-03-04 15:25:20,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:20,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:20,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:25:20,232 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:25:20,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 15:25:20,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:25:20,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:25:20,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:20,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:20,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:25:20,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:25:20,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:25:20,361 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:25:20,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440815818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:20,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:25:20,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 15:25:20,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676794690] [2025-03-04 15:25:20,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:20,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:25:20,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:20,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:25:20,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:25:20,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-03-04 15:25:20,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 88 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 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-03-04 15:25:20,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:20,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-03-04 15:25:20,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:20,542 INFO L124 PetriNetUnfolderBase]: 287/729 cut-off events. [2025-03-04 15:25:20,542 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-04 15:25:20,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1219 conditions, 729 events. 287/729 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4303 event pairs, 176 based on Foata normal form. 2/575 useless extension candidates. Maximal degree in co-relation 1208. Up to 444 conditions per place. [2025-03-04 15:25:20,547 INFO L140 encePairwiseOnDemand]: 87/97 looper letters, 34 selfloop transitions, 14 changer transitions 0/86 dead transitions. [2025-03-04 15:25:20,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 86 transitions, 312 flow [2025-03-04 15:25:20,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:25:20,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:25:20,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 344 transitions. [2025-03-04 15:25:20,549 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5910652920962199 [2025-03-04 15:25:20,550 INFO L175 Difference]: Start difference. First operand has 84 places, 88 transitions, 224 flow. Second operand 6 states and 344 transitions. [2025-03-04 15:25:20,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 86 transitions, 312 flow [2025-03-04 15:25:20,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 86 transitions, 311 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:20,553 INFO L231 Difference]: Finished difference. Result has 86 places, 86 transitions, 243 flow [2025-03-04 15:25:20,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=243, PETRI_PLACES=86, PETRI_TRANSITIONS=86} [2025-03-04 15:25:20,555 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -5 predicate places. [2025-03-04 15:25:20,555 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 86 transitions, 243 flow [2025-03-04 15:25:20,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 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-03-04 15:25:20,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:20,556 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:25:20,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 15:25:20,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 15:25:20,757 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:25:20,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:20,757 INFO L85 PathProgramCache]: Analyzing trace with hash 608080049, now seen corresponding path program 1 times [2025-03-04 15:25:20,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:20,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266999296] [2025-03-04 15:25:20,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:20,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:20,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:25:20,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:25:20,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:20,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:20,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:25:20,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:20,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266999296] [2025-03-04 15:25:20,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266999296] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:25:20,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591445294] [2025-03-04 15:25:20,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:20,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:20,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:25:20,843 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:25:20,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 15:25:20,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:25:20,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:25:20,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:20,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:20,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:25:20,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:25:20,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:25:20,920 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:25:20,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:25:20,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591445294] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:25:20,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:25:20,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 15:25:20,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983745161] [2025-03-04 15:25:20,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:25:20,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:25:20,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:20,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:25:20,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:25:20,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-03-04 15:25:20,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 86 transitions, 243 flow. Second operand has 12 states, 12 states have (on average 50.166666666666664) internal successors, (602), 12 states have internal predecessors, (602), 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-03-04 15:25:20,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:20,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-03-04 15:25:20,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:21,185 INFO L124 PetriNetUnfolderBase]: 293/753 cut-off events. [2025-03-04 15:25:21,186 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-03-04 15:25:21,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1311 conditions, 753 events. 293/753 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4461 event pairs, 176 based on Foata normal form. 6/599 useless extension candidates. Maximal degree in co-relation 1300. Up to 458 conditions per place. [2025-03-04 15:25:21,190 INFO L140 encePairwiseOnDemand]: 87/97 looper letters, 40 selfloop transitions, 26 changer transitions 0/104 dead transitions. [2025-03-04 15:25:21,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 104 transitions, 483 flow [2025-03-04 15:25:21,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:25:21,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:25:21,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 562 transitions. [2025-03-04 15:25:21,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5793814432989691 [2025-03-04 15:25:21,193 INFO L175 Difference]: Start difference. First operand has 86 places, 86 transitions, 243 flow. Second operand 10 states and 562 transitions. [2025-03-04 15:25:21,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 104 transitions, 483 flow [2025-03-04 15:25:21,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 104 transitions, 423 flow, removed 16 selfloop flow, removed 4 redundant places. [2025-03-04 15:25:21,196 INFO L231 Difference]: Finished difference. Result has 94 places, 104 transitions, 379 flow [2025-03-04 15:25:21,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=379, PETRI_PLACES=94, PETRI_TRANSITIONS=104} [2025-03-04 15:25:21,198 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 3 predicate places. [2025-03-04 15:25:21,198 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 104 transitions, 379 flow [2025-03-04 15:25:21,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 50.166666666666664) internal successors, (602), 12 states have internal predecessors, (602), 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-03-04 15:25:21,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:21,199 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:21,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:25:21,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 15:25:21,400 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:25:21,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:21,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1755288568, now seen corresponding path program 1 times [2025-03-04 15:25:21,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:21,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126255468] [2025-03-04 15:25:21,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:21,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:21,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:25:21,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:25:21,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:21,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:21,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:25:21,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:21,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126255468] [2025-03-04 15:25:21,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126255468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:21,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:21,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:21,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839645105] [2025-03-04 15:25:21,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:21,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:21,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:21,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:21,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:21,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-03-04 15:25:21,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 104 transitions, 379 flow. Second operand has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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-03-04 15:25:21,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:21,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-03-04 15:25:21,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:21,612 INFO L124 PetriNetUnfolderBase]: 295/761 cut-off events. [2025-03-04 15:25:21,612 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-03-04 15:25:21,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1339 conditions, 761 events. 295/761 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4539 event pairs, 176 based on Foata normal form. 2/607 useless extension candidates. Maximal degree in co-relation 1326. Up to 478 conditions per place. [2025-03-04 15:25:21,616 INFO L140 encePairwiseOnDemand]: 85/97 looper letters, 66 selfloop transitions, 8 changer transitions 0/110 dead transitions. [2025-03-04 15:25:21,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 110 transitions, 539 flow [2025-03-04 15:25:21,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:21,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:21,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2025-03-04 15:25:21,618 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6443298969072165 [2025-03-04 15:25:21,619 INFO L175 Difference]: Start difference. First operand has 94 places, 104 transitions, 379 flow. Second operand 4 states and 250 transitions. [2025-03-04 15:25:21,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 110 transitions, 539 flow [2025-03-04 15:25:21,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 110 transitions, 517 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-04 15:25:21,624 INFO L231 Difference]: Finished difference. Result has 97 places, 110 transitions, 415 flow [2025-03-04 15:25:21,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=415, PETRI_PLACES=97, PETRI_TRANSITIONS=110} [2025-03-04 15:25:21,626 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 6 predicate places. [2025-03-04 15:25:21,626 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 110 transitions, 415 flow [2025-03-04 15:25:21,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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-03-04 15:25:21,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:21,626 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:21,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:25:21,627 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:25:21,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:21,627 INFO L85 PathProgramCache]: Analyzing trace with hash 575769812, now seen corresponding path program 1 times [2025-03-04 15:25:21,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:21,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732478363] [2025-03-04 15:25:21,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:21,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:21,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:25:21,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:25:21,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:21,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:21,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:25:21,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:21,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732478363] [2025-03-04 15:25:21,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732478363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:21,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:21,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:21,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122718457] [2025-03-04 15:25:21,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:21,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:21,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:21,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:21,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:21,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-03-04 15:25:21,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 110 transitions, 415 flow. Second operand has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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-03-04 15:25:21,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:21,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-03-04 15:25:21,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:21,856 INFO L124 PetriNetUnfolderBase]: 294/760 cut-off events. [2025-03-04 15:25:21,856 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-03-04 15:25:21,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1349 conditions, 760 events. 294/760 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4473 event pairs, 176 based on Foata normal form. 1/609 useless extension candidates. Maximal degree in co-relation 1333. Up to 474 conditions per place. [2025-03-04 15:25:21,859 INFO L140 encePairwiseOnDemand]: 93/97 looper letters, 66 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2025-03-04 15:25:21,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 109 transitions, 549 flow [2025-03-04 15:25:21,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:21,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:21,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2025-03-04 15:25:21,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.615979381443299 [2025-03-04 15:25:21,860 INFO L175 Difference]: Start difference. First operand has 97 places, 110 transitions, 415 flow. Second operand 4 states and 239 transitions. [2025-03-04 15:25:21,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 109 transitions, 549 flow [2025-03-04 15:25:21,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 109 transitions, 543 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:21,862 INFO L231 Difference]: Finished difference. Result has 99 places, 109 transitions, 411 flow [2025-03-04 15:25:21,863 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=411, PETRI_PLACES=99, PETRI_TRANSITIONS=109} [2025-03-04 15:25:21,863 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 8 predicate places. [2025-03-04 15:25:21,863 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 109 transitions, 411 flow [2025-03-04 15:25:21,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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-03-04 15:25:21,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:21,863 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:21,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:25:21,863 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:25:21,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:21,864 INFO L85 PathProgramCache]: Analyzing trace with hash -349184558, now seen corresponding path program 1 times [2025-03-04 15:25:21,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:21,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192483822] [2025-03-04 15:25:21,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:21,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:21,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:25:21,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:25:21,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:21,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:21,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:25:21,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:21,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192483822] [2025-03-04 15:25:21,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192483822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:21,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:21,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:21,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488796060] [2025-03-04 15:25:21,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:21,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:21,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:21,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:21,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:21,940 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-03-04 15:25:21,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 109 transitions, 411 flow. Second operand has 4 states, 4 states have (on average 51.5) internal successors, (206), 4 states have internal predecessors, (206), 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-03-04 15:25:21,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:21,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-03-04 15:25:21,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:22,050 INFO L124 PetriNetUnfolderBase]: 293/759 cut-off events. [2025-03-04 15:25:22,051 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-03-04 15:25:22,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1345 conditions, 759 events. 293/759 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4411 event pairs, 176 based on Foata normal form. 1/608 useless extension candidates. Maximal degree in co-relation 1328. Up to 473 conditions per place. [2025-03-04 15:25:22,055 INFO L140 encePairwiseOnDemand]: 93/97 looper letters, 65 selfloop transitions, 3 changer transitions 0/108 dead transitions. [2025-03-04 15:25:22,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 108 transitions, 543 flow [2025-03-04 15:25:22,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:22,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:22,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2025-03-04 15:25:22,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.615979381443299 [2025-03-04 15:25:22,056 INFO L175 Difference]: Start difference. First operand has 99 places, 109 transitions, 411 flow. Second operand 4 states and 239 transitions. [2025-03-04 15:25:22,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 108 transitions, 543 flow [2025-03-04 15:25:22,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 108 transitions, 539 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:25:22,060 INFO L231 Difference]: Finished difference. Result has 100 places, 108 transitions, 409 flow [2025-03-04 15:25:22,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=409, PETRI_PLACES=100, PETRI_TRANSITIONS=108} [2025-03-04 15:25:22,061 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 9 predicate places. [2025-03-04 15:25:22,061 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 108 transitions, 409 flow [2025-03-04 15:25:22,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.5) internal successors, (206), 4 states have internal predecessors, (206), 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-03-04 15:25:22,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:22,061 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2025-03-04 15:25:22,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:25:22,062 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:25:22,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:22,062 INFO L85 PathProgramCache]: Analyzing trace with hash -446996429, now seen corresponding path program 2 times [2025-03-04 15:25:22,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:22,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858712044] [2025-03-04 15:25:22,062 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:25:22,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:22,069 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 15:25:22,072 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-04 15:25:22,073 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:25:22,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:22,114 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:25:22,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:22,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858712044] [2025-03-04 15:25:22,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858712044] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:25:22,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749266149] [2025-03-04 15:25:22,115 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:25:22,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:22,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:25:22,118 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:25:22,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 15:25:22,167 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 15:25:22,175 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-04 15:25:22,175 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:25:22,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:22,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:25:22,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:25:22,195 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:25:22,195 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:25:22,222 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:25:22,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749266149] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:25:22,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:25:22,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-03-04 15:25:22,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630012955] [2025-03-04 15:25:22,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:25:22,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:25:22,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:22,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:25:22,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:25:22,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 97 [2025-03-04 15:25:22,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 108 transitions, 409 flow. Second operand has 5 states, 5 states have (on average 46.6) internal successors, (233), 5 states have internal predecessors, (233), 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-03-04 15:25:22,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:22,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 97 [2025-03-04 15:25:22,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:22,375 INFO L124 PetriNetUnfolderBase]: 293/757 cut-off events. [2025-03-04 15:25:22,376 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-03-04 15:25:22,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1336 conditions, 757 events. 293/757 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4395 event pairs, 176 based on Foata normal form. 2/607 useless extension candidates. Maximal degree in co-relation 1319. Up to 453 conditions per place. [2025-03-04 15:25:22,379 INFO L140 encePairwiseOnDemand]: 86/97 looper letters, 37 selfloop transitions, 31 changer transitions 0/106 dead transitions. [2025-03-04 15:25:22,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 106 transitions, 525 flow [2025-03-04 15:25:22,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:25:22,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:25:22,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 267 transitions. [2025-03-04 15:25:22,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5505154639175258 [2025-03-04 15:25:22,380 INFO L175 Difference]: Start difference. First operand has 100 places, 108 transitions, 409 flow. Second operand 5 states and 267 transitions. [2025-03-04 15:25:22,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 106 transitions, 525 flow [2025-03-04 15:25:22,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 106 transitions, 501 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-03-04 15:25:22,383 INFO L231 Difference]: Finished difference. Result has 96 places, 106 transitions, 427 flow [2025-03-04 15:25:22,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=427, PETRI_PLACES=96, PETRI_TRANSITIONS=106} [2025-03-04 15:25:22,384 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 5 predicate places. [2025-03-04 15:25:22,384 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 106 transitions, 427 flow [2025-03-04 15:25:22,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.6) internal successors, (233), 5 states have internal predecessors, (233), 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-03-04 15:25:22,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:22,384 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:22,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:25:22,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:22,587 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:25:22,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:22,589 INFO L85 PathProgramCache]: Analyzing trace with hash -370650077, now seen corresponding path program 1 times [2025-03-04 15:25:22,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:22,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580545782] [2025-03-04 15:25:22,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:22,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:22,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:25:22,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:25:22,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:22,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:22,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:25:22,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:22,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580545782] [2025-03-04 15:25:22,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580545782] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:25:22,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393857997] [2025-03-04 15:25:22,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:22,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:22,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:25:22,685 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:25:22,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 15:25:22,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:25:22,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:25:22,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:22,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:22,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 15:25:22,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:25:22,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:25:22,896 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:25:23,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:25:23,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393857997] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:25:23,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:25:23,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-04 15:25:23,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524620927] [2025-03-04 15:25:23,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:25:23,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 15:25:23,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:23,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 15:25:23,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-03-04 15:25:23,209 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 97 [2025-03-04 15:25:23,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 106 transitions, 427 flow. Second operand has 19 states, 19 states have (on average 42.8421052631579) internal successors, (814), 19 states have internal predecessors, (814), 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-03-04 15:25:23,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:23,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 97 [2025-03-04 15:25:23,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:23,622 INFO L124 PetriNetUnfolderBase]: 580/1484 cut-off events. [2025-03-04 15:25:23,623 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2025-03-04 15:25:23,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2599 conditions, 1484 events. 580/1484 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10365 event pairs, 352 based on Foata normal form. 3/1178 useless extension candidates. Maximal degree in co-relation 2586. Up to 453 conditions per place. [2025-03-04 15:25:23,629 INFO L140 encePairwiseOnDemand]: 81/97 looper letters, 74 selfloop transitions, 47 changer transitions 0/155 dead transitions. [2025-03-04 15:25:23,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 155 transitions, 879 flow [2025-03-04 15:25:23,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 15:25:23,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 15:25:23,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 835 transitions. [2025-03-04 15:25:23,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4782359679266896 [2025-03-04 15:25:23,632 INFO L175 Difference]: Start difference. First operand has 96 places, 106 transitions, 427 flow. Second operand 18 states and 835 transitions. [2025-03-04 15:25:23,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 155 transitions, 879 flow [2025-03-04 15:25:23,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 155 transitions, 787 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:25:23,635 INFO L231 Difference]: Finished difference. Result has 109 places, 126 transitions, 621 flow [2025-03-04 15:25:23,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=621, PETRI_PLACES=109, PETRI_TRANSITIONS=126} [2025-03-04 15:25:23,636 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 18 predicate places. [2025-03-04 15:25:23,637 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 126 transitions, 621 flow [2025-03-04 15:25:23,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 42.8421052631579) internal successors, (814), 19 states have internal predecessors, (814), 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-03-04 15:25:23,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:23,637 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:23,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 15:25:23,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:23,838 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:25:23,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:23,838 INFO L85 PathProgramCache]: Analyzing trace with hash -470521624, now seen corresponding path program 1 times [2025-03-04 15:25:23,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:23,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564665852] [2025-03-04 15:25:23,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:23,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:23,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:25:23,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:25:23,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:23,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:23,903 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 15:25:23,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:23,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564665852] [2025-03-04 15:25:23,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564665852] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:25:23,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753640071] [2025-03-04 15:25:23,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:23,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:23,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:25:23,906 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:25:23,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 15:25:23,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:25:23,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:25:23,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:23,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:23,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:25:23,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:25:23,992 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 15:25:23,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:25:24,027 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 15:25:24,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753640071] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:25:24,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:25:24,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 15:25:24,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282456390] [2025-03-04 15:25:24,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:25:24,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:25:24,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:24,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:25:24,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:25:24,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-03-04 15:25:24,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 126 transitions, 621 flow. Second operand has 12 states, 12 states have (on average 50.833333333333336) internal successors, (610), 12 states have internal predecessors, (610), 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-03-04 15:25:24,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:24,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-03-04 15:25:24,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:24,276 INFO L124 PetriNetUnfolderBase]: 589/1520 cut-off events. [2025-03-04 15:25:24,277 INFO L125 PetriNetUnfolderBase]: For 224/224 co-relation queries the response was YES. [2025-03-04 15:25:24,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2747 conditions, 1520 events. 589/1520 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10742 event pairs, 352 based on Foata normal form. 9/1229 useless extension candidates. Maximal degree in co-relation 2734. Up to 936 conditions per place. [2025-03-04 15:25:24,282 INFO L140 encePairwiseOnDemand]: 87/97 looper letters, 75 selfloop transitions, 44 changer transitions 0/153 dead transitions. [2025-03-04 15:25:24,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 153 transitions, 1027 flow [2025-03-04 15:25:24,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:25:24,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:25:24,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 562 transitions. [2025-03-04 15:25:24,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5793814432989691 [2025-03-04 15:25:24,284 INFO L175 Difference]: Start difference. First operand has 109 places, 126 transitions, 621 flow. Second operand 10 states and 562 transitions. [2025-03-04 15:25:24,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 153 transitions, 1027 flow [2025-03-04 15:25:24,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 153 transitions, 943 flow, removed 25 selfloop flow, removed 4 redundant places. [2025-03-04 15:25:24,288 INFO L231 Difference]: Finished difference. Result has 117 places, 153 transitions, 841 flow [2025-03-04 15:25:24,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=841, PETRI_PLACES=117, PETRI_TRANSITIONS=153} [2025-03-04 15:25:24,289 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 26 predicate places. [2025-03-04 15:25:24,289 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 153 transitions, 841 flow [2025-03-04 15:25:24,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 50.833333333333336) internal successors, (610), 12 states have internal predecessors, (610), 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-03-04 15:25:24,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:24,290 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:24,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 15:25:24,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 15:25:24,491 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:25:24,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:24,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1477729040, now seen corresponding path program 1 times [2025-03-04 15:25:24,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:24,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072746742] [2025-03-04 15:25:24,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:24,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:24,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:25:24,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:25:24,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:24,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:24,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:25:24,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:24,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072746742] [2025-03-04 15:25:24,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072746742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:24,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:24,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:24,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928177638] [2025-03-04 15:25:24,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:24,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:24,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:24,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:24,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:24,581 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 97 [2025-03-04 15:25:24,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 153 transitions, 841 flow. Second operand has 4 states, 4 states have (on average 51.5) internal successors, (206), 4 states have internal predecessors, (206), 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-03-04 15:25:24,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:24,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 97 [2025-03-04 15:25:24,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:24,784 INFO L124 PetriNetUnfolderBase]: 1107/2530 cut-off events. [2025-03-04 15:25:24,785 INFO L125 PetriNetUnfolderBase]: For 255/255 co-relation queries the response was YES. [2025-03-04 15:25:24,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4612 conditions, 2530 events. 1107/2530 cut-off events. For 255/255 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 18895 event pairs, 322 based on Foata normal form. 80/2123 useless extension candidates. Maximal degree in co-relation 4596. Up to 898 conditions per place. [2025-03-04 15:25:24,796 INFO L140 encePairwiseOnDemand]: 89/97 looper letters, 145 selfloop transitions, 5 changer transitions 0/180 dead transitions. [2025-03-04 15:25:24,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 180 transitions, 1197 flow [2025-03-04 15:25:24,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:24,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:24,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2025-03-04 15:25:24,797 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6804123711340206 [2025-03-04 15:25:24,797 INFO L175 Difference]: Start difference. First operand has 117 places, 153 transitions, 841 flow. Second operand 4 states and 264 transitions. [2025-03-04 15:25:24,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 180 transitions, 1197 flow [2025-03-04 15:25:24,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 180 transitions, 1159 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-03-04 15:25:24,802 INFO L231 Difference]: Finished difference. Result has 120 places, 155 transitions, 837 flow [2025-03-04 15:25:24,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=837, PETRI_PLACES=120, PETRI_TRANSITIONS=155} [2025-03-04 15:25:24,803 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 29 predicate places. [2025-03-04 15:25:24,803 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 155 transitions, 837 flow [2025-03-04 15:25:24,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.5) internal successors, (206), 4 states have internal predecessors, (206), 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-03-04 15:25:24,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:24,804 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:24,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 15:25:24,804 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:25:24,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:24,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1435040919, now seen corresponding path program 1 times [2025-03-04 15:25:24,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:24,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340018285] [2025-03-04 15:25:24,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:24,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:24,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 15:25:24,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:25:24,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:24,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:24,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:25:24,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:24,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340018285] [2025-03-04 15:25:24,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340018285] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:25:24,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621191515] [2025-03-04 15:25:24,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:24,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:24,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:25:24,987 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:25:24,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 15:25:25,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 15:25:25,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:25:25,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:25,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:25,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:25:25,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:25:25,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:25:25,105 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:25:25,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621191515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:25,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:25:25,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-04 15:25:25,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119820688] [2025-03-04 15:25:25,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:25,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:25,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:25,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:25,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:25:25,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-03-04 15:25:25,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 155 transitions, 837 flow. Second operand has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 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-03-04 15:25:25,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:25,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-03-04 15:25:25,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:25,302 INFO L124 PetriNetUnfolderBase]: 727/1958 cut-off events. [2025-03-04 15:25:25,302 INFO L125 PetriNetUnfolderBase]: For 624/672 co-relation queries the response was YES. [2025-03-04 15:25:25,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3776 conditions, 1958 events. 727/1958 cut-off events. For 624/672 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 15016 event pairs, 456 based on Foata normal form. 28/1645 useless extension candidates. Maximal degree in co-relation 3757. Up to 1173 conditions per place. [2025-03-04 15:25:25,316 INFO L140 encePairwiseOnDemand]: 93/97 looper letters, 112 selfloop transitions, 5 changer transitions 0/153 dead transitions. [2025-03-04 15:25:25,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 153 transitions, 1060 flow [2025-03-04 15:25:25,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:25,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:25,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2025-03-04 15:25:25,318 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.615979381443299 [2025-03-04 15:25:25,318 INFO L175 Difference]: Start difference. First operand has 120 places, 155 transitions, 837 flow. Second operand 4 states and 239 transitions. [2025-03-04 15:25:25,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 153 transitions, 1060 flow [2025-03-04 15:25:25,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 153 transitions, 1060 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:25:25,323 INFO L231 Difference]: Finished difference. Result has 123 places, 153 transitions, 836 flow [2025-03-04 15:25:25,323 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=836, PETRI_PLACES=123, PETRI_TRANSITIONS=153} [2025-03-04 15:25:25,324 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 32 predicate places. [2025-03-04 15:25:25,324 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 153 transitions, 836 flow [2025-03-04 15:25:25,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 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-03-04 15:25:25,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:25,324 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:25,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 15:25:25,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 15:25:25,528 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:25:25,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:25,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1472991311, now seen corresponding path program 1 times [2025-03-04 15:25:25,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:25,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307809086] [2025-03-04 15:25:25,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:25,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:25,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 15:25:25,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 15:25:25,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:25,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:25,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:25:25,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:25,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307809086] [2025-03-04 15:25:25,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307809086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:25,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:25,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:25,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535596836] [2025-03-04 15:25:25,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:25,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:25,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:25,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:25,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:25,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-03-04 15:25:25,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 153 transitions, 836 flow. Second operand has 4 states, 4 states have (on average 53.5) internal successors, (214), 4 states have internal predecessors, (214), 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-03-04 15:25:25,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:25,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-03-04 15:25:25,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:25,777 INFO L124 PetriNetUnfolderBase]: 725/1956 cut-off events. [2025-03-04 15:25:25,777 INFO L125 PetriNetUnfolderBase]: For 634/682 co-relation queries the response was YES. [2025-03-04 15:25:25,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3774 conditions, 1956 events. 725/1956 cut-off events. For 634/682 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 14901 event pairs, 456 based on Foata normal form. 28/1643 useless extension candidates. Maximal degree in co-relation 3753. Up to 1171 conditions per place. [2025-03-04 15:25:25,786 INFO L140 encePairwiseOnDemand]: 93/97 looper letters, 110 selfloop transitions, 5 changer transitions 0/151 dead transitions. [2025-03-04 15:25:25,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 151 transitions, 1055 flow [2025-03-04 15:25:25,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:25,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:25,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2025-03-04 15:25:25,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.615979381443299 [2025-03-04 15:25:25,788 INFO L175 Difference]: Start difference. First operand has 123 places, 153 transitions, 836 flow. Second operand 4 states and 239 transitions. [2025-03-04 15:25:25,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 151 transitions, 1055 flow [2025-03-04 15:25:25,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 151 transitions, 1049 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:25:25,792 INFO L231 Difference]: Finished difference. Result has 124 places, 151 transitions, 829 flow [2025-03-04 15:25:25,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=819, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=829, PETRI_PLACES=124, PETRI_TRANSITIONS=151} [2025-03-04 15:25:25,793 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 33 predicate places. [2025-03-04 15:25:25,793 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 151 transitions, 829 flow [2025-03-04 15:25:25,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.5) internal successors, (214), 4 states have internal predecessors, (214), 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-03-04 15:25:25,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:25,794 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:25,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 15:25:25,794 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:25:25,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:25,794 INFO L85 PathProgramCache]: Analyzing trace with hash -615288463, now seen corresponding path program 1 times [2025-03-04 15:25:25,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:25,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414903454] [2025-03-04 15:25:25,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:25,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:25,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 15:25:25,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 15:25:25,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:25,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:26,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:25:26,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:26,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414903454] [2025-03-04 15:25:26,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414903454] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:25:26,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249981800] [2025-03-04 15:25:26,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:26,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:26,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:25:26,180 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:25:26,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 15:25:26,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 15:25:26,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 15:25:26,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:26,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:26,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 15:25:26,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:25:26,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:25:26,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 15:25:26,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:25:26,470 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:25:26,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-04 15:25:26,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2025-03-04 15:25:26,599 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:25:26,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249981800] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:25:26,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:25:26,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2025-03-04 15:25:26,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661890324] [2025-03-04 15:25:26,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:25:26,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 15:25:26,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:26,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 15:25:26,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-03-04 15:25:26,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 97 [2025-03-04 15:25:26,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 151 transitions, 829 flow. Second operand has 17 states, 17 states have (on average 45.05882352941177) internal successors, (766), 17 states have internal predecessors, (766), 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-03-04 15:25:26,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:26,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 97 [2025-03-04 15:25:26,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:27,852 INFO L124 PetriNetUnfolderBase]: 2711/6818 cut-off events. [2025-03-04 15:25:27,853 INFO L125 PetriNetUnfolderBase]: For 1924/1968 co-relation queries the response was YES. [2025-03-04 15:25:27,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13238 conditions, 6818 events. 2711/6818 cut-off events. For 1924/1968 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 63557 event pairs, 730 based on Foata normal form. 44/5905 useless extension candidates. Maximal degree in co-relation 13217. Up to 876 conditions per place. [2025-03-04 15:25:27,892 INFO L140 encePairwiseOnDemand]: 84/97 looper letters, 286 selfloop transitions, 46 changer transitions 0/366 dead transitions. [2025-03-04 15:25:27,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 366 transitions, 2446 flow [2025-03-04 15:25:27,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 15:25:27,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 15:25:27,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 812 transitions. [2025-03-04 15:25:27,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5580756013745705 [2025-03-04 15:25:27,896 INFO L175 Difference]: Start difference. First operand has 124 places, 151 transitions, 829 flow. Second operand 15 states and 812 transitions. [2025-03-04 15:25:27,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 366 transitions, 2446 flow [2025-03-04 15:25:27,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 366 transitions, 2432 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:25:27,914 INFO L231 Difference]: Finished difference. Result has 139 places, 164 transitions, 1022 flow [2025-03-04 15:25:27,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1022, PETRI_PLACES=139, PETRI_TRANSITIONS=164} [2025-03-04 15:25:27,915 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 48 predicate places. [2025-03-04 15:25:27,915 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 164 transitions, 1022 flow [2025-03-04 15:25:27,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 45.05882352941177) internal successors, (766), 17 states have internal predecessors, (766), 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-03-04 15:25:27,915 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:27,916 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:27,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 15:25:28,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:28,120 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:25:28,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:28,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1894103014, now seen corresponding path program 1 times [2025-03-04 15:25:28,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:28,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640366342] [2025-03-04 15:25:28,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:28,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:28,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 15:25:28,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:25:28,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:28,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:28,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:25:28,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:28,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640366342] [2025-03-04 15:25:28,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640366342] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:25:28,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697492369] [2025-03-04 15:25:28,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:28,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:28,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:25:28,461 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:25:28,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 15:25:28,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 15:25:28,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:25:28,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:28,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:28,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 15:25:28,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:25:28,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-04 15:25:28,803 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 15:25:28,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2025-03-04 15:25:28,809 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:25:28,809 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:25:28,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-04 15:25:28,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2025-03-04 15:25:28,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:25:28,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697492369] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:25:28,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:25:28,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2025-03-04 15:25:28,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445162814] [2025-03-04 15:25:28,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:25:28,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 15:25:28,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:28,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 15:25:28,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-03-04 15:25:29,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 97 [2025-03-04 15:25:29,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 164 transitions, 1022 flow. Second operand has 17 states, 17 states have (on average 43.1764705882353) internal successors, (734), 17 states have internal predecessors, (734), 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-03-04 15:25:29,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:29,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 97 [2025-03-04 15:25:29,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:30,092 INFO L124 PetriNetUnfolderBase]: 3243/7370 cut-off events. [2025-03-04 15:25:30,093 INFO L125 PetriNetUnfolderBase]: For 4221/4265 co-relation queries the response was YES. [2025-03-04 15:25:30,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15836 conditions, 7370 events. 3243/7370 cut-off events. For 4221/4265 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 65080 event pairs, 912 based on Foata normal form. 124/6533 useless extension candidates. Maximal degree in co-relation 15812. Up to 1166 conditions per place. [2025-03-04 15:25:30,120 INFO L140 encePairwiseOnDemand]: 84/97 looper letters, 291 selfloop transitions, 46 changer transitions 0/368 dead transitions. [2025-03-04 15:25:30,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 368 transitions, 2592 flow [2025-03-04 15:25:30,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 15:25:30,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 15:25:30,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 781 transitions. [2025-03-04 15:25:30,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5367697594501718 [2025-03-04 15:25:30,123 INFO L175 Difference]: Start difference. First operand has 139 places, 164 transitions, 1022 flow. Second operand 15 states and 781 transitions. [2025-03-04 15:25:30,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 368 transitions, 2592 flow [2025-03-04 15:25:30,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 368 transitions, 2573 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-04 15:25:30,135 INFO L231 Difference]: Finished difference. Result has 150 places, 167 transitions, 1135 flow [2025-03-04 15:25:30,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=990, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1135, PETRI_PLACES=150, PETRI_TRANSITIONS=167} [2025-03-04 15:25:30,136 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 59 predicate places. [2025-03-04 15:25:30,136 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 167 transitions, 1135 flow [2025-03-04 15:25:30,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 43.1764705882353) internal successors, (734), 17 states have internal predecessors, (734), 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-03-04 15:25:30,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:30,137 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:30,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 15:25:30,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 15:25:30,337 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:25:30,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:30,338 INFO L85 PathProgramCache]: Analyzing trace with hash 36281079, now seen corresponding path program 1 times [2025-03-04 15:25:30,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:30,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686699784] [2025-03-04 15:25:30,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:30,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:30,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 15:25:30,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:25:30,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:30,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:30,408 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:25:30,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:30,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686699784] [2025-03-04 15:25:30,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686699784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:30,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:30,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:30,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192838413] [2025-03-04 15:25:30,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:30,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:30,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:30,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:30,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:30,426 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 97 [2025-03-04 15:25:30,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 167 transitions, 1135 flow. Second operand has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 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-03-04 15:25:30,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:30,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 97 [2025-03-04 15:25:30,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:31,114 INFO L124 PetriNetUnfolderBase]: 4403/10010 cut-off events. [2025-03-04 15:25:31,114 INFO L125 PetriNetUnfolderBase]: For 8819/8977 co-relation queries the response was YES. [2025-03-04 15:25:31,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22497 conditions, 10010 events. 4403/10010 cut-off events. For 8819/8977 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 94086 event pairs, 1508 based on Foata normal form. 426/8935 useless extension candidates. Maximal degree in co-relation 22471. Up to 3692 conditions per place. [2025-03-04 15:25:31,158 INFO L140 encePairwiseOnDemand]: 89/97 looper letters, 178 selfloop transitions, 5 changer transitions 0/218 dead transitions. [2025-03-04 15:25:31,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 218 transitions, 1809 flow [2025-03-04 15:25:31,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:31,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:31,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2025-03-04 15:25:31,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6752577319587629 [2025-03-04 15:25:31,160 INFO L175 Difference]: Start difference. First operand has 150 places, 167 transitions, 1135 flow. Second operand 4 states and 262 transitions. [2025-03-04 15:25:31,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 218 transitions, 1809 flow [2025-03-04 15:25:31,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 218 transitions, 1721 flow, removed 2 selfloop flow, removed 10 redundant places. [2025-03-04 15:25:31,175 INFO L231 Difference]: Finished difference. Result has 145 places, 169 transitions, 1109 flow [2025-03-04 15:25:31,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=1073, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1109, PETRI_PLACES=145, PETRI_TRANSITIONS=169} [2025-03-04 15:25:31,176 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 54 predicate places. [2025-03-04 15:25:31,176 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 169 transitions, 1109 flow [2025-03-04 15:25:31,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 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-03-04 15:25:31,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:31,176 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:31,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 15:25:31,176 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:25:31,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:31,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1688678142, now seen corresponding path program 2 times [2025-03-04 15:25:31,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:31,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475778324] [2025-03-04 15:25:31,177 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:25:31,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:31,184 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-04 15:25:31,188 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 33 statements. [2025-03-04 15:25:31,189 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:25:31,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:31,225 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 15:25:31,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:31,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475778324] [2025-03-04 15:25:31,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475778324] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:25:31,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45145787] [2025-03-04 15:25:31,225 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:25:31,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:31,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:25:31,227 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:25:31,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 15:25:31,289 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-04 15:25:31,301 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 33 statements. [2025-03-04 15:25:31,301 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:25:31,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:31,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:25:31,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:25:31,326 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 15:25:31,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:25:31,401 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 15:25:31,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45145787] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:25:31,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:25:31,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-03-04 15:25:31,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160296257] [2025-03-04 15:25:31,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:25:31,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:25:31,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:31,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:25:31,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:25:31,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 97 [2025-03-04 15:25:31,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 169 transitions, 1109 flow. Second operand has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 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-03-04 15:25:31,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:31,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 97 [2025-03-04 15:25:31,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:32,175 INFO L124 PetriNetUnfolderBase]: 3129/8529 cut-off events. [2025-03-04 15:25:32,175 INFO L125 PetriNetUnfolderBase]: For 7121/7329 co-relation queries the response was YES. [2025-03-04 15:25:32,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19077 conditions, 8529 events. 3129/8529 cut-off events. For 7121/7329 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 87031 event pairs, 2120 based on Foata normal form. 149/7697 useless extension candidates. Maximal degree in co-relation 19051. Up to 4741 conditions per place. [2025-03-04 15:25:32,204 INFO L140 encePairwiseOnDemand]: 86/97 looper letters, 78 selfloop transitions, 50 changer transitions 0/167 dead transitions. [2025-03-04 15:25:32,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 167 transitions, 1345 flow [2025-03-04 15:25:32,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:25:32,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:25:32,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 267 transitions. [2025-03-04 15:25:32,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5505154639175258 [2025-03-04 15:25:32,206 INFO L175 Difference]: Start difference. First operand has 145 places, 169 transitions, 1109 flow. Second operand 5 states and 267 transitions. [2025-03-04 15:25:32,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 167 transitions, 1345 flow [2025-03-04 15:25:32,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 167 transitions, 1313 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-03-04 15:25:32,225 INFO L231 Difference]: Finished difference. Result has 143 places, 167 transitions, 1157 flow [2025-03-04 15:25:32,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=1057, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1157, PETRI_PLACES=143, PETRI_TRANSITIONS=167} [2025-03-04 15:25:32,226 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 52 predicate places. [2025-03-04 15:25:32,226 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 167 transitions, 1157 flow [2025-03-04 15:25:32,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 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-03-04 15:25:32,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:32,226 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:32,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 15:25:32,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:32,433 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:25:32,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:32,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1412349620, now seen corresponding path program 1 times [2025-03-04 15:25:32,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:32,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929739521] [2025-03-04 15:25:32,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:32,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:32,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 15:25:32,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 15:25:32,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:32,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:32,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:25:32,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:32,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929739521] [2025-03-04 15:25:32,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929739521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:32,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:32,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:32,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976991091] [2025-03-04 15:25:32,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:32,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:32,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:32,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:32,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:32,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 97 [2025-03-04 15:25:32,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 167 transitions, 1157 flow. Second operand has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 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-03-04 15:25:32,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:32,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 97 [2025-03-04 15:25:32,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:33,160 INFO L124 PetriNetUnfolderBase]: 3893/9525 cut-off events. [2025-03-04 15:25:33,160 INFO L125 PetriNetUnfolderBase]: For 8508/8722 co-relation queries the response was YES. [2025-03-04 15:25:33,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21916 conditions, 9525 events. 3893/9525 cut-off events. For 8508/8722 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 92692 event pairs, 1438 based on Foata normal form. 270/8799 useless extension candidates. Maximal degree in co-relation 21892. Up to 3484 conditions per place. [2025-03-04 15:25:33,204 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 153 selfloop transitions, 11 changer transitions 0/193 dead transitions. [2025-03-04 15:25:33,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 193 transitions, 1557 flow [2025-03-04 15:25:33,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:33,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:33,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 261 transitions. [2025-03-04 15:25:33,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6726804123711341 [2025-03-04 15:25:33,205 INFO L175 Difference]: Start difference. First operand has 143 places, 167 transitions, 1157 flow. Second operand 4 states and 261 transitions. [2025-03-04 15:25:33,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 193 transitions, 1557 flow [2025-03-04 15:25:33,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 193 transitions, 1450 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 15:25:33,228 INFO L231 Difference]: Finished difference. Result has 141 places, 164 transitions, 1048 flow [2025-03-04 15:25:33,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=1026, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1048, PETRI_PLACES=141, PETRI_TRANSITIONS=164} [2025-03-04 15:25:33,229 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 50 predicate places. [2025-03-04 15:25:33,229 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 164 transitions, 1048 flow [2025-03-04 15:25:33,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 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-03-04 15:25:33,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:33,229 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:33,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 15:25:33,229 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:25:33,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:33,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1412348627, now seen corresponding path program 1 times [2025-03-04 15:25:33,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:33,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877662027] [2025-03-04 15:25:33,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:33,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:33,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 15:25:33,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 15:25:33,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:33,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:33,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:25:33,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:33,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877662027] [2025-03-04 15:25:33,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877662027] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:25:33,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773787550] [2025-03-04 15:25:33,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:33,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:33,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:25:33,680 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:25:33,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 15:25:33,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 15:25:33,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 15:25:33,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:33,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:33,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-04 15:25:33,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:25:33,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 15:25:33,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:25:33,908 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:25:33,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 15:25:33,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-04 15:25:34,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 15:25:34,040 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:25:34,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:25:34,090 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_376) c_~get_2~0.base) (+ (* c_~id_0~0 4) c_~get_2~0.offset))))) is different from false [2025-03-04 15:25:34,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:25:34,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2025-03-04 15:25:34,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:25:34,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 39 [2025-03-04 15:25:34,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2025-03-04 15:25:34,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2025-03-04 15:25:34,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773787550] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:25:34,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:25:34,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-04 15:25:34,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251545482] [2025-03-04 15:25:34,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:25:34,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 15:25:34,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:34,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 15:25:34,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=352, Unknown=1, NotChecked=38, Total=462 [2025-03-04 15:25:34,266 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 97 [2025-03-04 15:25:34,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 164 transitions, 1048 flow. Second operand has 22 states, 22 states have (on average 32.72727272727273) internal successors, (720), 22 states have internal predecessors, (720), 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-03-04 15:25:34,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:34,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 97 [2025-03-04 15:25:34,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:35,338 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~id_0~0 4) c_~get_2~0.offset))) (and (<= 0 c_~id_0~0) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_118| Int)) (or (forall ((v_ArrVal_376 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_118| v_ArrVal_376) c_~get_2~0.base) .cse0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_118|) 0)))) (forall ((v_ArrVal_376 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_376) c_~get_2~0.base) .cse0)))))) is different from false [2025-03-04 15:25:37,160 INFO L124 PetriNetUnfolderBase]: 8984/17086 cut-off events. [2025-03-04 15:25:37,161 INFO L125 PetriNetUnfolderBase]: For 12022/12681 co-relation queries the response was YES. [2025-03-04 15:25:37,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42701 conditions, 17086 events. 8984/17086 cut-off events. For 12022/12681 co-relation queries the response was YES. Maximal size of possible extension queue 759. Compared 148267 event pairs, 1831 based on Foata normal form. 357/16445 useless extension candidates. Maximal degree in co-relation 42679. Up to 2617 conditions per place. [2025-03-04 15:25:37,232 INFO L140 encePairwiseOnDemand]: 80/97 looper letters, 395 selfloop transitions, 90 changer transitions 0/504 dead transitions. [2025-03-04 15:25:37,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 504 transitions, 3524 flow [2025-03-04 15:25:37,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-04 15:25:37,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-04 15:25:37,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1198 transitions. [2025-03-04 15:25:37,234 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42587984358336295 [2025-03-04 15:25:37,234 INFO L175 Difference]: Start difference. First operand has 141 places, 164 transitions, 1048 flow. Second operand 29 states and 1198 transitions. [2025-03-04 15:25:37,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 504 transitions, 3524 flow [2025-03-04 15:25:37,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 504 transitions, 3476 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:25:37,289 INFO L231 Difference]: Finished difference. Result has 176 places, 214 transitions, 1732 flow [2025-03-04 15:25:37,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=1032, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=1732, PETRI_PLACES=176, PETRI_TRANSITIONS=214} [2025-03-04 15:25:37,290 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 85 predicate places. [2025-03-04 15:25:37,290 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 214 transitions, 1732 flow [2025-03-04 15:25:37,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 32.72727272727273) internal successors, (720), 22 states have internal predecessors, (720), 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-03-04 15:25:37,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:37,290 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:37,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 15:25:37,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 15:25:37,491 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:25:37,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:37,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1124714374, now seen corresponding path program 1 times [2025-03-04 15:25:37,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:37,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048088533] [2025-03-04 15:25:37,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:37,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:37,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 15:25:37,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 15:25:37,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:37,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:38,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:25:38,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:38,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048088533] [2025-03-04 15:25:38,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048088533] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:25:38,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910070884] [2025-03-04 15:25:38,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:38,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:38,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:25:38,006 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:25:38,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 15:25:38,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 15:25:38,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 15:25:38,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:38,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:38,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 15:25:38,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:25:38,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 15:25:38,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-04 15:25:38,269 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:25:38,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 15:25:38,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-04 15:25:38,498 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 15:25:38,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2025-03-04 15:25:38,506 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:25:38,506 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:25:38,549 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_412 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_412) c_~get_2~0.base) (+ (* c_~id_0~0 4) c_~get_2~0.offset)) 9223372039002259456)) is different from false [2025-03-04 15:25:38,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:25:38,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-03-04 15:25:38,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:25:38,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 33 [2025-03-04 15:25:38,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-03-04 15:25:38,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2025-03-04 15:25:38,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910070884] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:25:38,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:25:38,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-03-04 15:25:38,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243681044] [2025-03-04 15:25:38,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:25:38,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 15:25:38,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:38,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 15:25:38,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=381, Unknown=1, NotChecked=40, Total=506 [2025-03-04 15:25:38,713 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 97 [2025-03-04 15:25:38,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 214 transitions, 1732 flow. Second operand has 23 states, 23 states have (on average 35.391304347826086) internal successors, (814), 23 states have internal predecessors, (814), 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-03-04 15:25:38,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:38,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 97 [2025-03-04 15:25:38,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:39,370 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~id_0~0 4) c_~get_2~0.offset))) (and (<= 0 c_~id_0~0) (forall ((v_ArrVal_412 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_412) c_~get_2~0.base) .cse0) 9223372039002259456)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_121| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_121|) 0)) (forall ((v_ArrVal_412 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_121| v_ArrVal_412) c_~get_2~0.base) .cse0) 9223372039002259456)))))) is different from false [2025-03-04 15:25:41,505 INFO L124 PetriNetUnfolderBase]: 9901/18840 cut-off events. [2025-03-04 15:25:41,505 INFO L125 PetriNetUnfolderBase]: For 37209/37722 co-relation queries the response was YES. [2025-03-04 15:25:41,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52058 conditions, 18840 events. 9901/18840 cut-off events. For 37209/37722 co-relation queries the response was YES. Maximal size of possible extension queue 839. Compared 165587 event pairs, 2220 based on Foata normal form. 170/17683 useless extension candidates. Maximal degree in co-relation 52026. Up to 3427 conditions per place. [2025-03-04 15:25:41,635 INFO L140 encePairwiseOnDemand]: 82/97 looper letters, 365 selfloop transitions, 61 changer transitions 0/453 dead transitions. [2025-03-04 15:25:41,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 453 transitions, 3949 flow [2025-03-04 15:25:41,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 15:25:41,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 15:25:41,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 936 transitions. [2025-03-04 15:25:41,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4386129334582943 [2025-03-04 15:25:41,637 INFO L175 Difference]: Start difference. First operand has 176 places, 214 transitions, 1732 flow. Second operand 22 states and 936 transitions. [2025-03-04 15:25:41,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 453 transitions, 3949 flow [2025-03-04 15:25:41,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 453 transitions, 3827 flow, removed 17 selfloop flow, removed 8 redundant places. [2025-03-04 15:25:41,729 INFO L231 Difference]: Finished difference. Result has 192 places, 227 transitions, 1865 flow [2025-03-04 15:25:41,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=1641, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1865, PETRI_PLACES=192, PETRI_TRANSITIONS=227} [2025-03-04 15:25:41,730 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 101 predicate places. [2025-03-04 15:25:41,730 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 227 transitions, 1865 flow [2025-03-04 15:25:41,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 35.391304347826086) internal successors, (814), 23 states have internal predecessors, (814), 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-03-04 15:25:41,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:41,730 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:41,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 15:25:41,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 15:25:41,931 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:25:41,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:41,931 INFO L85 PathProgramCache]: Analyzing trace with hash 833135389, now seen corresponding path program 1 times [2025-03-04 15:25:41,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:41,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634297231] [2025-03-04 15:25:41,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:41,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:41,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 15:25:41,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 15:25:41,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:41,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:42,296 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:25:42,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:42,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634297231] [2025-03-04 15:25:42,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634297231] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:25:42,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114374580] [2025-03-04 15:25:42,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:42,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:42,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:25:42,299 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:25:42,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 15:25:42,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 15:25:42,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 15:25:42,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:42,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:42,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 15:25:42,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:25:42,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 15:25:42,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:25:42,517 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:25:42,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 15:25:42,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 15:25:42,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 15:25:42,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:25:42,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:25:42,675 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_447 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_447) c_~get_2~0.base) (+ (* c_~id_0~0 4) c_~get_2~0.offset)) 2147483648)) is different from false [2025-03-04 15:25:42,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:25:42,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-03-04 15:25:42,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:25:42,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 33 [2025-03-04 15:25:42,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-03-04 15:25:42,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2025-03-04 15:25:42,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114374580] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:25:42,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:25:42,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2025-03-04 15:25:42,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299357977] [2025-03-04 15:25:42,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:25:42,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 15:25:42,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:42,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 15:25:42,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=390, Unknown=1, NotChecked=40, Total=506 [2025-03-04 15:25:42,825 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 97 [2025-03-04 15:25:42,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 227 transitions, 1865 flow. Second operand has 23 states, 23 states have (on average 32.65217391304348) internal successors, (751), 23 states have internal predecessors, (751), 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-03-04 15:25:42,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:42,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 97 [2025-03-04 15:25:42,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:45,541 INFO L124 PetriNetUnfolderBase]: 9886/18456 cut-off events. [2025-03-04 15:25:45,541 INFO L125 PetriNetUnfolderBase]: For 25980/27001 co-relation queries the response was YES. [2025-03-04 15:25:45,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53251 conditions, 18456 events. 9886/18456 cut-off events. For 25980/27001 co-relation queries the response was YES. Maximal size of possible extension queue 803. Compared 158582 event pairs, 2556 based on Foata normal form. 940/18358 useless extension candidates. Maximal degree in co-relation 53217. Up to 3883 conditions per place. [2025-03-04 15:25:45,624 INFO L140 encePairwiseOnDemand]: 77/97 looper letters, 397 selfloop transitions, 102 changer transitions 18/541 dead transitions. [2025-03-04 15:25:45,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 541 transitions, 4310 flow [2025-03-04 15:25:45,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 15:25:45,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-04 15:25:45,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1272 transitions. [2025-03-04 15:25:45,626 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4230129697372797 [2025-03-04 15:25:45,626 INFO L175 Difference]: Start difference. First operand has 192 places, 227 transitions, 1865 flow. Second operand 31 states and 1272 transitions. [2025-03-04 15:25:45,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 541 transitions, 4310 flow [2025-03-04 15:25:45,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 541 transitions, 4228 flow, removed 10 selfloop flow, removed 13 redundant places. [2025-03-04 15:25:45,737 INFO L231 Difference]: Finished difference. Result has 215 places, 253 transitions, 2234 flow [2025-03-04 15:25:45,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=1799, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=2234, PETRI_PLACES=215, PETRI_TRANSITIONS=253} [2025-03-04 15:25:45,738 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 124 predicate places. [2025-03-04 15:25:45,738 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 253 transitions, 2234 flow [2025-03-04 15:25:45,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 32.65217391304348) internal successors, (751), 23 states have internal predecessors, (751), 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-03-04 15:25:45,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:45,738 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:45,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 15:25:45,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 15:25:45,939 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:25:45,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:45,939 INFO L85 PathProgramCache]: Analyzing trace with hash 506377403, now seen corresponding path program 1 times [2025-03-04 15:25:45,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:45,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627764085] [2025-03-04 15:25:45,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:45,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:45,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 15:25:45,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 15:25:45,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:45,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:46,298 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:25:46,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:46,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627764085] [2025-03-04 15:25:46,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627764085] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:25:46,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353709616] [2025-03-04 15:25:46,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:46,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:46,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:25:46,301 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:25:46,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 15:25:46,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 15:25:46,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 15:25:46,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:46,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:46,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 15:25:46,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:25:46,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 15:25:46,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-04 15:25:46,537 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:25:46,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 15:25:46,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2025-03-04 15:25:46,708 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 15:25:46,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2025-03-04 15:25:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:25:46,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:25:46,759 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_483 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_483) c_~get_2~0.base) (+ (* c_~id_0~0 4) c_~get_2~0.offset)) 4294967296))) is different from false [2025-03-04 15:25:46,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:25:46,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2025-03-04 15:25:46,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:25:46,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 39 [2025-03-04 15:25:46,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2025-03-04 15:25:46,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2025-03-04 15:25:46,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353709616] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:25:46,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:25:46,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-03-04 15:25:46,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466205570] [2025-03-04 15:25:46,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:25:46,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 15:25:46,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:46,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 15:25:46,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=381, Unknown=1, NotChecked=40, Total=506 [2025-03-04 15:25:46,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 97 [2025-03-04 15:25:46,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 253 transitions, 2234 flow. Second operand has 23 states, 23 states have (on average 35.391304347826086) internal successors, (814), 23 states have internal predecessors, (814), 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-03-04 15:25:46,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:46,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 97 [2025-03-04 15:25:46,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:48,549 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~id_0~0 4) c_~get_2~0.offset))) (and (<= 0 c_~id_0~0) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_127| Int)) (or (forall ((v_ArrVal_483 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_127| v_ArrVal_483) c_~get_2~0.base) .cse0) 4294967296))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_127|) 0)))) (forall ((v_ArrVal_483 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_483) c_~get_2~0.base) .cse0) 4294967296))))) is different from false [2025-03-04 15:25:50,542 INFO L124 PetriNetUnfolderBase]: 9910/18781 cut-off events. [2025-03-04 15:25:50,542 INFO L125 PetriNetUnfolderBase]: For 57653/59086 co-relation queries the response was YES. [2025-03-04 15:25:50,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59703 conditions, 18781 events. 9910/18781 cut-off events. For 57653/59086 co-relation queries the response was YES. Maximal size of possible extension queue 828. Compared 163781 event pairs, 2712 based on Foata normal form. 620/18231 useless extension candidates. Maximal degree in co-relation 59662. Up to 3983 conditions per place. [2025-03-04 15:25:50,641 INFO L140 encePairwiseOnDemand]: 82/97 looper letters, 370 selfloop transitions, 61 changer transitions 0/470 dead transitions. [2025-03-04 15:25:50,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 470 transitions, 4565 flow [2025-03-04 15:25:50,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 15:25:50,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 15:25:50,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 921 transitions. [2025-03-04 15:25:50,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43158388003748827 [2025-03-04 15:25:50,642 INFO L175 Difference]: Start difference. First operand has 215 places, 253 transitions, 2234 flow. Second operand 22 states and 921 transitions. [2025-03-04 15:25:50,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 470 transitions, 4565 flow [2025-03-04 15:25:50,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 470 transitions, 4393 flow, removed 13 selfloop flow, removed 15 redundant places. [2025-03-04 15:25:50,836 INFO L231 Difference]: Finished difference. Result has 222 places, 256 transitions, 2265 flow [2025-03-04 15:25:50,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2095, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2265, PETRI_PLACES=222, PETRI_TRANSITIONS=256} [2025-03-04 15:25:50,836 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 131 predicate places. [2025-03-04 15:25:50,836 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 256 transitions, 2265 flow [2025-03-04 15:25:50,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 35.391304347826086) internal successors, (814), 23 states have internal predecessors, (814), 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-03-04 15:25:50,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:50,837 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:50,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 15:25:51,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-04 15:25:51,037 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:25:51,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:51,038 INFO L85 PathProgramCache]: Analyzing trace with hash 976083130, now seen corresponding path program 1 times [2025-03-04 15:25:51,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:51,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534633281] [2025-03-04 15:25:51,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:51,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:51,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 15:25:51,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 15:25:51,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:51,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:51,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:25:51,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:51,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534633281] [2025-03-04 15:25:51,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534633281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:51,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:51,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:25:51,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014144024] [2025-03-04 15:25:51,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:51,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:25:51,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:51,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:25:51,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:25:51,123 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 97 [2025-03-04 15:25:51,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 256 transitions, 2265 flow. Second operand has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 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-03-04 15:25:51,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:51,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 97 [2025-03-04 15:25:51,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:52,522 INFO L124 PetriNetUnfolderBase]: 7213/14969 cut-off events. [2025-03-04 15:25:52,522 INFO L125 PetriNetUnfolderBase]: For 34453/34755 co-relation queries the response was YES. [2025-03-04 15:25:52,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46942 conditions, 14969 events. 7213/14969 cut-off events. For 34453/34755 co-relation queries the response was YES. Maximal size of possible extension queue 749. Compared 137554 event pairs, 2779 based on Foata normal form. 382/14683 useless extension candidates. Maximal degree in co-relation 46900. Up to 6502 conditions per place. [2025-03-04 15:25:52,612 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 274 selfloop transitions, 35 changer transitions 10/353 dead transitions. [2025-03-04 15:25:52,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 353 transitions, 3469 flow [2025-03-04 15:25:52,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:25:52,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:25:52,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 370 transitions. [2025-03-04 15:25:52,613 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6357388316151202 [2025-03-04 15:25:52,614 INFO L175 Difference]: Start difference. First operand has 222 places, 256 transitions, 2265 flow. Second operand 6 states and 370 transitions. [2025-03-04 15:25:52,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 353 transitions, 3469 flow [2025-03-04 15:25:52,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 353 transitions, 3270 flow, removed 12 selfloop flow, removed 19 redundant places. [2025-03-04 15:25:52,898 INFO L231 Difference]: Finished difference. Result has 208 places, 253 transitions, 2189 flow [2025-03-04 15:25:52,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2050, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2189, PETRI_PLACES=208, PETRI_TRANSITIONS=253} [2025-03-04 15:25:52,898 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 117 predicate places. [2025-03-04 15:25:52,898 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 253 transitions, 2189 flow [2025-03-04 15:25:52,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 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-03-04 15:25:52,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:52,899 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:52,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 15:25:52,899 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:25:52,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:52,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1482168759, now seen corresponding path program 1 times [2025-03-04 15:25:52,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:52,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91685730] [2025-03-04 15:25:52,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:52,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:52,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 15:25:52,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 15:25:52,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:52,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:52,945 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:25:52,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:52,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91685730] [2025-03-04 15:25:52,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91685730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:52,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:52,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:52,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990486144] [2025-03-04 15:25:52,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:52,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:52,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:52,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:52,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:52,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 97 [2025-03-04 15:25:52,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 253 transitions, 2189 flow. Second operand has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 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-03-04 15:25:52,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:52,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 97 [2025-03-04 15:25:52,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:54,688 INFO L124 PetriNetUnfolderBase]: 6324/14718 cut-off events. [2025-03-04 15:25:54,688 INFO L125 PetriNetUnfolderBase]: For 43445/43859 co-relation queries the response was YES. [2025-03-04 15:25:54,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45141 conditions, 14718 events. 6324/14718 cut-off events. For 43445/43859 co-relation queries the response was YES. Maximal size of possible extension queue 734. Compared 147098 event pairs, 2502 based on Foata normal form. 367/14086 useless extension candidates. Maximal degree in co-relation 45100. Up to 5903 conditions per place. [2025-03-04 15:25:54,761 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 341 selfloop transitions, 11 changer transitions 0/393 dead transitions. [2025-03-04 15:25:54,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 393 transitions, 4203 flow [2025-03-04 15:25:54,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:54,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:54,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2025-03-04 15:25:54,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6675257731958762 [2025-03-04 15:25:54,762 INFO L175 Difference]: Start difference. First operand has 208 places, 253 transitions, 2189 flow. Second operand 4 states and 259 transitions. [2025-03-04 15:25:54,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 393 transitions, 4203 flow [2025-03-04 15:25:54,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 393 transitions, 4046 flow, removed 27 selfloop flow, removed 4 redundant places. [2025-03-04 15:25:54,897 INFO L231 Difference]: Finished difference. Result has 207 places, 250 transitions, 2126 flow [2025-03-04 15:25:54,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2104, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2126, PETRI_PLACES=207, PETRI_TRANSITIONS=250} [2025-03-04 15:25:54,897 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 116 predicate places. [2025-03-04 15:25:54,897 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 250 transitions, 2126 flow [2025-03-04 15:25:54,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 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-03-04 15:25:54,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:54,898 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:54,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 15:25:54,898 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:25:54,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:54,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1482169752, now seen corresponding path program 1 times [2025-03-04 15:25:54,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:54,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885057944] [2025-03-04 15:25:54,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:54,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:54,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 15:25:54,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 15:25:54,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:54,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:55,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:25:55,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:55,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885057944] [2025-03-04 15:25:55,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885057944] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:25:55,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167049478] [2025-03-04 15:25:55,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:55,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:55,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:25:55,152 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:25:55,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 15:25:55,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 15:25:55,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 15:25:55,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:55,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:55,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 15:25:55,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:25:55,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:25:55,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 15:25:55,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:25:55,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:25:55,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-04 15:25:55,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2025-03-04 15:25:55,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:25:55,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167049478] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:25:55,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:25:55,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-04 15:25:55,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245445220] [2025-03-04 15:25:55,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:25:55,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 15:25:55,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:55,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 15:25:55,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-03-04 15:25:55,674 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 97 [2025-03-04 15:25:55,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 250 transitions, 2126 flow. Second operand has 17 states, 17 states have (on average 39.0) internal successors, (663), 17 states have internal predecessors, (663), 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-03-04 15:25:55,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:55,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 97 [2025-03-04 15:25:55,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:57,335 INFO L124 PetriNetUnfolderBase]: 8500/16282 cut-off events. [2025-03-04 15:25:57,336 INFO L125 PetriNetUnfolderBase]: For 49941/50729 co-relation queries the response was YES. [2025-03-04 15:25:57,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52494 conditions, 16282 events. 8500/16282 cut-off events. For 49941/50729 co-relation queries the response was YES. Maximal size of possible extension queue 737. Compared 141137 event pairs, 2013 based on Foata normal form. 270/15924 useless extension candidates. Maximal degree in co-relation 52454. Up to 2664 conditions per place. [2025-03-04 15:25:57,458 INFO L140 encePairwiseOnDemand]: 82/97 looper letters, 797 selfloop transitions, 78 changer transitions 10/923 dead transitions. [2025-03-04 15:25:57,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 923 transitions, 8690 flow [2025-03-04 15:25:57,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 15:25:57,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 15:25:57,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1073 transitions. [2025-03-04 15:25:57,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5028116213683224 [2025-03-04 15:25:57,459 INFO L175 Difference]: Start difference. First operand has 207 places, 250 transitions, 2126 flow. Second operand 22 states and 1073 transitions. [2025-03-04 15:25:57,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 923 transitions, 8690 flow [2025-03-04 15:25:57,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 923 transitions, 8642 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:25:57,594 INFO L231 Difference]: Finished difference. Result has 232 places, 274 transitions, 2497 flow [2025-03-04 15:25:57,594 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2110, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2497, PETRI_PLACES=232, PETRI_TRANSITIONS=274} [2025-03-04 15:25:57,595 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 141 predicate places. [2025-03-04 15:25:57,595 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 274 transitions, 2497 flow [2025-03-04 15:25:57,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 39.0) internal successors, (663), 17 states have internal predecessors, (663), 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-03-04 15:25:57,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:57,595 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:57,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 15:25:57,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:57,796 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:25:57,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:57,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1297378878, now seen corresponding path program 1 times [2025-03-04 15:25:57,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:57,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827034550] [2025-03-04 15:25:57,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:57,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:57,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 15:25:57,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 15:25:57,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:57,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:58,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:25:58,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:58,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827034550] [2025-03-04 15:25:58,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827034550] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:25:58,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622135548] [2025-03-04 15:25:58,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:58,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:58,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:25:58,083 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:25:58,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 15:25:58,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 15:25:58,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 15:25:58,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:58,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:58,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 15:25:58,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:25:58,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:25:58,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 15:25:58,333 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:25:58,334 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:25:58,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-04 15:25:58,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2025-03-04 15:25:58,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:25:58,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622135548] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:25:58,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:25:58,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-03-04 15:25:58,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749723607] [2025-03-04 15:25:58,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:25:58,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 15:25:58,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:58,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 15:25:58,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-03-04 15:25:58,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 97 [2025-03-04 15:25:58,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 274 transitions, 2497 flow. Second operand has 18 states, 18 states have (on average 39.77777777777778) internal successors, (716), 18 states have internal predecessors, (716), 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-03-04 15:25:58,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:58,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 97 [2025-03-04 15:25:58,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:00,446 INFO L124 PetriNetUnfolderBase]: 7484/15046 cut-off events. [2025-03-04 15:26:00,446 INFO L125 PetriNetUnfolderBase]: For 50790/51474 co-relation queries the response was YES. [2025-03-04 15:26:00,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51171 conditions, 15046 events. 7484/15046 cut-off events. For 50790/51474 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 134696 event pairs, 2327 based on Foata normal form. 767/15286 useless extension candidates. Maximal degree in co-relation 51124. Up to 3252 conditions per place. [2025-03-04 15:26:00,594 INFO L140 encePairwiseOnDemand]: 79/97 looper letters, 700 selfloop transitions, 83 changer transitions 160/986 dead transitions. [2025-03-04 15:26:00,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 986 transitions, 9515 flow [2025-03-04 15:26:00,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 15:26:00,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-04 15:26:00,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1180 transitions. [2025-03-04 15:26:00,596 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.506872852233677 [2025-03-04 15:26:00,596 INFO L175 Difference]: Start difference. First operand has 232 places, 274 transitions, 2497 flow. Second operand 24 states and 1180 transitions. [2025-03-04 15:26:00,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 986 transitions, 9515 flow [2025-03-04 15:26:00,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 986 transitions, 9438 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-03-04 15:26:00,747 INFO L231 Difference]: Finished difference. Result has 256 places, 294 transitions, 2789 flow [2025-03-04 15:26:00,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2420, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2789, PETRI_PLACES=256, PETRI_TRANSITIONS=294} [2025-03-04 15:26:00,748 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 165 predicate places. [2025-03-04 15:26:00,748 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 294 transitions, 2789 flow [2025-03-04 15:26:00,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 39.77777777777778) internal successors, (716), 18 states have internal predecessors, (716), 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-03-04 15:26:00,749 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:00,749 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:00,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 15:26:00,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 15:26:00,950 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:26:00,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:00,950 INFO L85 PathProgramCache]: Analyzing trace with hash 35445713, now seen corresponding path program 2 times [2025-03-04 15:26:00,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:00,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253171258] [2025-03-04 15:26:00,950 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:26:00,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:00,958 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-04 15:26:00,967 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 15:26:00,967 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:26:00,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:01,082 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:26:01,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:01,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253171258] [2025-03-04 15:26:01,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253171258] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:01,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481260646] [2025-03-04 15:26:01,082 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:26:01,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:01,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:01,084 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:01,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 15:26:01,151 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-04 15:26:01,173 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 15:26:01,173 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:26:01,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:01,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 15:26:01,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:01,288 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:26:01,288 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:01,425 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:26:01,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481260646] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:01,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:01,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-03-04 15:26:01,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058194418] [2025-03-04 15:26:01,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:01,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 15:26:01,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:01,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 15:26:01,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2025-03-04 15:26:01,598 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 97 [2025-03-04 15:26:01,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 294 transitions, 2789 flow. Second operand has 27 states, 27 states have (on average 42.851851851851855) internal successors, (1157), 27 states have internal predecessors, (1157), 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-03-04 15:26:01,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:01,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 97 [2025-03-04 15:26:01,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:03,140 INFO L124 PetriNetUnfolderBase]: 4598/11471 cut-off events. [2025-03-04 15:26:03,140 INFO L125 PetriNetUnfolderBase]: For 41472/41842 co-relation queries the response was YES. [2025-03-04 15:26:03,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41009 conditions, 11471 events. 4598/11471 cut-off events. For 41472/41842 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 110423 event pairs, 3482 based on Foata normal form. 172/11369 useless extension candidates. Maximal degree in co-relation 40954. Up to 2729 conditions per place. [2025-03-04 15:26:03,239 INFO L140 encePairwiseOnDemand]: 87/97 looper letters, 240 selfloop transitions, 137 changer transitions 0/441 dead transitions. [2025-03-04 15:26:03,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 441 transitions, 4396 flow [2025-03-04 15:26:03,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 15:26:03,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 15:26:03,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 940 transitions. [2025-03-04 15:26:03,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4845360824742268 [2025-03-04 15:26:03,240 INFO L175 Difference]: Start difference. First operand has 256 places, 294 transitions, 2789 flow. Second operand 20 states and 940 transitions. [2025-03-04 15:26:03,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 441 transitions, 4396 flow [2025-03-04 15:26:03,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 441 transitions, 4313 flow, removed 5 selfloop flow, removed 8 redundant places. [2025-03-04 15:26:03,464 INFO L231 Difference]: Finished difference. Result has 270 places, 362 transitions, 3454 flow [2025-03-04 15:26:03,464 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2706, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3454, PETRI_PLACES=270, PETRI_TRANSITIONS=362} [2025-03-04 15:26:03,465 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 179 predicate places. [2025-03-04 15:26:03,465 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 362 transitions, 3454 flow [2025-03-04 15:26:03,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 42.851851851851855) internal successors, (1157), 27 states have internal predecessors, (1157), 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-03-04 15:26:03,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:03,465 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:03,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 15:26:03,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:03,667 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:26:03,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:03,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1812237873, now seen corresponding path program 1 times [2025-03-04 15:26:03,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:03,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398388354] [2025-03-04 15:26:03,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:03,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:03,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 15:26:03,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 15:26:03,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:03,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:03,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:26:03,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:03,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398388354] [2025-03-04 15:26:03,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398388354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:03,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:03,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:26:03,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886431741] [2025-03-04 15:26:03,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:03,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:03,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:03,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:03,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:03,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 97 [2025-03-04 15:26:03,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 362 transitions, 3454 flow. Second operand has 4 states, 4 states have (on average 53.5) internal successors, (214), 4 states have internal predecessors, (214), 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-03-04 15:26:03,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:03,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 97 [2025-03-04 15:26:03,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:05,093 INFO L124 PetriNetUnfolderBase]: 6302/13418 cut-off events. [2025-03-04 15:26:05,094 INFO L125 PetriNetUnfolderBase]: For 49792/50394 co-relation queries the response was YES. [2025-03-04 15:26:05,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48297 conditions, 13418 events. 6302/13418 cut-off events. For 49792/50394 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 118086 event pairs, 2607 based on Foata normal form. 417/13608 useless extension candidates. Maximal degree in co-relation 48239. Up to 5867 conditions per place. [2025-03-04 15:26:05,152 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 331 selfloop transitions, 16 changer transitions 102/495 dead transitions. [2025-03-04 15:26:05,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 495 transitions, 5510 flow [2025-03-04 15:26:05,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:26:05,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:26:05,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 257 transitions. [2025-03-04 15:26:05,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6623711340206185 [2025-03-04 15:26:05,153 INFO L175 Difference]: Start difference. First operand has 270 places, 362 transitions, 3454 flow. Second operand 4 states and 257 transitions. [2025-03-04 15:26:05,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 495 transitions, 5510 flow [2025-03-04 15:26:05,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 495 transitions, 5384 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-03-04 15:26:05,340 INFO L231 Difference]: Finished difference. Result has 262 places, 295 transitions, 2783 flow [2025-03-04 15:26:05,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=3250, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2783, PETRI_PLACES=262, PETRI_TRANSITIONS=295} [2025-03-04 15:26:05,340 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 171 predicate places. [2025-03-04 15:26:05,340 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 295 transitions, 2783 flow [2025-03-04 15:26:05,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.5) internal successors, (214), 4 states have internal predecessors, (214), 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-03-04 15:26:05,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:05,341 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:05,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 15:26:05,341 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:26:05,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:05,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1550222445, now seen corresponding path program 2 times [2025-03-04 15:26:05,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:05,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657904888] [2025-03-04 15:26:05,341 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:26:05,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:05,349 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-04 15:26:05,355 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 15:26:05,355 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:26:05,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:05,513 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:26:05,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:05,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657904888] [2025-03-04 15:26:05,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657904888] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:05,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568404654] [2025-03-04 15:26:05,513 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:26:05,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:05,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:05,515 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:05,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 15:26:05,588 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-04 15:26:05,613 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 15:26:05,613 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:26:05,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:05,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 15:26:05,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:05,739 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:26:05,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:05,894 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:26:05,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568404654] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:05,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:05,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2025-03-04 15:26:05,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707142956] [2025-03-04 15:26:05,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:05,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 15:26:05,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:05,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 15:26:05,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2025-03-04 15:26:06,081 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 97 [2025-03-04 15:26:06,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 295 transitions, 2783 flow. Second operand has 28 states, 28 states have (on average 42.92857142857143) internal successors, (1202), 28 states have internal predecessors, (1202), 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-03-04 15:26:06,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:06,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 97 [2025-03-04 15:26:06,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:07,204 INFO L124 PetriNetUnfolderBase]: 2984/7408 cut-off events. [2025-03-04 15:26:07,204 INFO L125 PetriNetUnfolderBase]: For 29311/29737 co-relation queries the response was YES. [2025-03-04 15:26:07,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27720 conditions, 7408 events. 2984/7408 cut-off events. For 29311/29737 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 65096 event pairs, 2174 based on Foata normal form. 165/7497 useless extension candidates. Maximal degree in co-relation 27661. Up to 2744 conditions per place. [2025-03-04 15:26:07,263 INFO L140 encePairwiseOnDemand]: 87/97 looper letters, 193 selfloop transitions, 105 changer transitions 46/399 dead transitions. [2025-03-04 15:26:07,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 399 transitions, 4191 flow [2025-03-04 15:26:07,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 15:26:07,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 15:26:07,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 948 transitions. [2025-03-04 15:26:07,264 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.488659793814433 [2025-03-04 15:26:07,264 INFO L175 Difference]: Start difference. First operand has 262 places, 295 transitions, 2783 flow. Second operand 20 states and 948 transitions. [2025-03-04 15:26:07,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 399 transitions, 4191 flow [2025-03-04 15:26:07,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 399 transitions, 4151 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-04 15:26:07,374 INFO L231 Difference]: Finished difference. Result has 281 places, 315 transitions, 3216 flow [2025-03-04 15:26:07,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2742, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3216, PETRI_PLACES=281, PETRI_TRANSITIONS=315} [2025-03-04 15:26:07,374 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 190 predicate places. [2025-03-04 15:26:07,375 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 315 transitions, 3216 flow [2025-03-04 15:26:07,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 42.92857142857143) internal successors, (1202), 28 states have internal predecessors, (1202), 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-03-04 15:26:07,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:07,375 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:07,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 15:26:07,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:07,578 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:26:07,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:07,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1109322705, now seen corresponding path program 3 times [2025-03-04 15:26:07,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:07,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045456529] [2025-03-04 15:26:07,580 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:26:07,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:07,588 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 4 equivalence classes. [2025-03-04 15:26:07,618 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 43 statements. [2025-03-04 15:26:07,618 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 15:26:07,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:07,814 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 15:26:07,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:07,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045456529] [2025-03-04 15:26:07,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045456529] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:07,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541922864] [2025-03-04 15:26:07,815 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:26:07,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:07,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:07,817 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:07,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 15:26:07,905 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 4 equivalence classes. [2025-03-04 15:26:07,928 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 43 statements. [2025-03-04 15:26:07,929 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 15:26:07,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:07,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 15:26:07,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:07,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-04 15:26:08,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2025-03-04 15:26:08,048 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 15:26:08,048 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:26:08,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541922864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:08,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:26:08,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2025-03-04 15:26:08,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357666463] [2025-03-04 15:26:08,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:08,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 15:26:08,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:08,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:26:08,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:26:08,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 97 [2025-03-04 15:26:08,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 315 transitions, 3216 flow. Second operand has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 7 states have internal predecessors, (373), 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-03-04 15:26:08,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:08,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 97 [2025-03-04 15:26:08,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:09,206 INFO L124 PetriNetUnfolderBase]: 3037/7243 cut-off events. [2025-03-04 15:26:09,206 INFO L125 PetriNetUnfolderBase]: For 26803/27277 co-relation queries the response was YES. [2025-03-04 15:26:09,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27046 conditions, 7243 events. 3037/7243 cut-off events. For 26803/27277 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 62255 event pairs, 650 based on Foata normal form. 235/7470 useless extension candidates. Maximal degree in co-relation 26986. Up to 2924 conditions per place. [2025-03-04 15:26:09,251 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 249 selfloop transitions, 59 changer transitions 0/359 dead transitions. [2025-03-04 15:26:09,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 359 transitions, 4191 flow [2025-03-04 15:26:09,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:26:09,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:26:09,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 405 transitions. [2025-03-04 15:26:09,252 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5964653902798233 [2025-03-04 15:26:09,252 INFO L175 Difference]: Start difference. First operand has 281 places, 315 transitions, 3216 flow. Second operand 7 states and 405 transitions. [2025-03-04 15:26:09,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 359 transitions, 4191 flow [2025-03-04 15:26:09,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 359 transitions, 4039 flow, removed 0 selfloop flow, removed 13 redundant places. [2025-03-04 15:26:09,364 INFO L231 Difference]: Finished difference. Result has 272 places, 312 transitions, 3159 flow [2025-03-04 15:26:09,364 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=3041, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3159, PETRI_PLACES=272, PETRI_TRANSITIONS=312} [2025-03-04 15:26:09,365 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 181 predicate places. [2025-03-04 15:26:09,365 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 312 transitions, 3159 flow [2025-03-04 15:26:09,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 7 states have internal predecessors, (373), 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-03-04 15:26:09,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:09,365 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:09,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 15:26:09,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:09,566 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:26:09,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:09,566 INFO L85 PathProgramCache]: Analyzing trace with hash 29235642, now seen corresponding path program 2 times [2025-03-04 15:26:09,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:09,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80574507] [2025-03-04 15:26:09,566 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:26:09,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:09,575 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-04 15:26:09,609 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 15:26:09,609 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:26:09,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:09,782 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 15:26:09,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:09,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80574507] [2025-03-04 15:26:09,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80574507] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:09,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511421906] [2025-03-04 15:26:09,783 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:26:09,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:09,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:09,785 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:09,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 15:26:09,861 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-04 15:26:09,885 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 15:26:09,885 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:26:09,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:09,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 15:26:09,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:09,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-04 15:26:09,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2025-03-04 15:26:09,981 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 15:26:09,981 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:26:09,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511421906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:09,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:26:09,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2025-03-04 15:26:09,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231333525] [2025-03-04 15:26:09,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:09,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 15:26:09,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:09,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:26:09,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:26:10,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-03-04 15:26:10,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 312 transitions, 3159 flow. Second operand has 7 states, 7 states have (on average 52.42857142857143) internal successors, (367), 7 states have internal predecessors, (367), 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-03-04 15:26:10,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:10,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-03-04 15:26:10,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:11,077 INFO L124 PetriNetUnfolderBase]: 2911/7039 cut-off events. [2025-03-04 15:26:11,077 INFO L125 PetriNetUnfolderBase]: For 28079/28501 co-relation queries the response was YES. [2025-03-04 15:26:11,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26750 conditions, 7039 events. 2911/7039 cut-off events. For 28079/28501 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 60542 event pairs, 650 based on Foata normal form. 217/7248 useless extension candidates. Maximal degree in co-relation 26690. Up to 2720 conditions per place. [2025-03-04 15:26:11,141 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 236 selfloop transitions, 59 changer transitions 12/358 dead transitions. [2025-03-04 15:26:11,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 358 transitions, 4150 flow [2025-03-04 15:26:11,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:26:11,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:26:11,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 397 transitions. [2025-03-04 15:26:11,142 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5846833578792342 [2025-03-04 15:26:11,142 INFO L175 Difference]: Start difference. First operand has 272 places, 312 transitions, 3159 flow. Second operand 7 states and 397 transitions. [2025-03-04 15:26:11,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 358 transitions, 4150 flow [2025-03-04 15:26:11,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 358 transitions, 4028 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-04 15:26:11,265 INFO L231 Difference]: Finished difference. Result has 270 places, 305 transitions, 3078 flow [2025-03-04 15:26:11,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=3032, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3078, PETRI_PLACES=270, PETRI_TRANSITIONS=305} [2025-03-04 15:26:11,265 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 179 predicate places. [2025-03-04 15:26:11,266 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 305 transitions, 3078 flow [2025-03-04 15:26:11,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 52.42857142857143) internal successors, (367), 7 states have internal predecessors, (367), 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-03-04 15:26:11,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:11,266 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:11,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-04 15:26:11,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:11,466 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:26:11,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:11,467 INFO L85 PathProgramCache]: Analyzing trace with hash -112517805, now seen corresponding path program 3 times [2025-03-04 15:26:11,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:11,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849224675] [2025-03-04 15:26:11,467 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:26:11,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:11,476 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 5 equivalence classes. [2025-03-04 15:26:11,503 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 42 of 45 statements. [2025-03-04 15:26:11,503 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 15:26:11,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:11,816 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 15:26:11,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:11,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849224675] [2025-03-04 15:26:11,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849224675] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:11,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649748080] [2025-03-04 15:26:11,817 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:26:11,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:11,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:11,819 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:11,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 15:26:11,898 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 5 equivalence classes. [2025-03-04 15:26:11,927 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 42 of 45 statements. [2025-03-04 15:26:11,928 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 15:26:11,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:11,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 15:26:11,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:11,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 15:26:11,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-04 15:26:12,045 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:26:12,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 15:26:12,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2025-03-04 15:26:12,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2025-03-04 15:26:12,148 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 15:26:12,148 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:12,203 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_828 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_828) c_~get_2~0.base) (+ (* c_~id_0~0 4) c_~get_2~0.offset))))) is different from false [2025-03-04 15:26:12,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:26:12,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2025-03-04 15:26:12,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:26:12,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 41 [2025-03-04 15:26:12,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2025-03-04 15:26:12,358 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 5 not checked. [2025-03-04 15:26:12,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649748080] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:12,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:12,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2025-03-04 15:26:12,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026690358] [2025-03-04 15:26:12,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:12,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 15:26:12,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:12,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 15:26:12,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=430, Unknown=1, NotChecked=42, Total=552 [2025-03-04 15:26:12,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 97 [2025-03-04 15:26:12,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 305 transitions, 3078 flow. Second operand has 24 states, 24 states have (on average 33.041666666666664) internal successors, (793), 24 states have internal predecessors, (793), 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-03-04 15:26:12,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:12,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 97 [2025-03-04 15:26:12,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:13,912 INFO L124 PetriNetUnfolderBase]: 4373/8371 cut-off events. [2025-03-04 15:26:13,912 INFO L125 PetriNetUnfolderBase]: For 28880/29586 co-relation queries the response was YES. [2025-03-04 15:26:13,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31446 conditions, 8371 events. 4373/8371 cut-off events. For 28880/29586 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 63317 event pairs, 650 based on Foata normal form. 433/8777 useless extension candidates. Maximal degree in co-relation 31386. Up to 2500 conditions per place. [2025-03-04 15:26:13,952 INFO L140 encePairwiseOnDemand]: 83/97 looper letters, 389 selfloop transitions, 87 changer transitions 0/510 dead transitions. [2025-03-04 15:26:13,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 510 transitions, 5574 flow [2025-03-04 15:26:13,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:26:13,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:26:13,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 507 transitions. [2025-03-04 15:26:13,953 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4020618556701031 [2025-03-04 15:26:13,953 INFO L175 Difference]: Start difference. First operand has 270 places, 305 transitions, 3078 flow. Second operand 13 states and 507 transitions. [2025-03-04 15:26:13,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 510 transitions, 5574 flow [2025-03-04 15:26:14,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 510 transitions, 5395 flow, removed 0 selfloop flow, removed 13 redundant places. [2025-03-04 15:26:14,055 INFO L231 Difference]: Finished difference. Result has 268 places, 303 transitions, 3081 flow [2025-03-04 15:26:14,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2907, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3081, PETRI_PLACES=268, PETRI_TRANSITIONS=303} [2025-03-04 15:26:14,056 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 177 predicate places. [2025-03-04 15:26:14,056 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 303 transitions, 3081 flow [2025-03-04 15:26:14,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 33.041666666666664) internal successors, (793), 24 states have internal predecessors, (793), 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-03-04 15:26:14,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:14,057 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:14,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-04 15:26:14,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-03-04 15:26:14,257 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:26:14,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:14,258 INFO L85 PathProgramCache]: Analyzing trace with hash -400152058, now seen corresponding path program 2 times [2025-03-04 15:26:14,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:14,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298521216] [2025-03-04 15:26:14,258 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:26:14,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:14,265 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-04 15:26:14,276 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 15:26:14,276 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:26:14,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:14,549 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 15:26:14,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:14,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298521216] [2025-03-04 15:26:14,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298521216] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:14,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435567896] [2025-03-04 15:26:14,549 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:26:14,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:14,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:14,551 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:14,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 15:26:14,633 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-04 15:26:14,661 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 15:26:14,662 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:26:14,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:14,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 15:26:14,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:14,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 15:26:14,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-04 15:26:14,811 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:26:14,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 15:26:14,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-04 15:26:15,159 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 15:26:15,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2025-03-04 15:26:15,181 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 11 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:26:15,181 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:15,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:26:15,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-03-04 15:26:15,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:26:15,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 33 [2025-03-04 15:26:15,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-03-04 15:26:15,787 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:26:15,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435567896] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:15,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:15,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 19, 19] total 44 [2025-03-04 15:26:15,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58496449] [2025-03-04 15:26:15,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:15,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-04 15:26:15,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:15,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-04 15:26:15,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1758, Unknown=2, NotChecked=0, Total=1980 [2025-03-04 15:26:16,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 97 [2025-03-04 15:26:16,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 303 transitions, 3081 flow. Second operand has 45 states, 45 states have (on average 28.466666666666665) internal successors, (1281), 45 states have internal predecessors, (1281), 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-03-04 15:26:16,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:16,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 97 [2025-03-04 15:26:16,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:19,494 INFO L124 PetriNetUnfolderBase]: 7308/13853 cut-off events. [2025-03-04 15:26:19,495 INFO L125 PetriNetUnfolderBase]: For 59955/61046 co-relation queries the response was YES. [2025-03-04 15:26:19,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52629 conditions, 13853 events. 7308/13853 cut-off events. For 59955/61046 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 111095 event pairs, 1104 based on Foata normal form. 361/14193 useless extension candidates. Maximal degree in co-relation 52574. Up to 3234 conditions per place. [2025-03-04 15:26:19,582 INFO L140 encePairwiseOnDemand]: 82/97 looper letters, 393 selfloop transitions, 102 changer transitions 4/530 dead transitions. [2025-03-04 15:26:19,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 530 transitions, 5896 flow [2025-03-04 15:26:19,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 15:26:19,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-04 15:26:19,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 888 transitions. [2025-03-04 15:26:19,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33906071019473083 [2025-03-04 15:26:19,585 INFO L175 Difference]: Start difference. First operand has 268 places, 303 transitions, 3081 flow. Second operand 27 states and 888 transitions. [2025-03-04 15:26:19,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 530 transitions, 5896 flow [2025-03-04 15:26:19,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 530 transitions, 5581 flow, removed 0 selfloop flow, removed 13 redundant places. [2025-03-04 15:26:19,747 INFO L231 Difference]: Finished difference. Result has 279 places, 326 transitions, 3325 flow [2025-03-04 15:26:19,747 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2876, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=3325, PETRI_PLACES=279, PETRI_TRANSITIONS=326} [2025-03-04 15:26:19,748 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 188 predicate places. [2025-03-04 15:26:19,748 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 326 transitions, 3325 flow [2025-03-04 15:26:19,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 28.466666666666665) internal successors, (1281), 45 states have internal predecessors, (1281), 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-03-04 15:26:19,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:19,749 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:19,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-04 15:26:19,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-03-04 15:26:19,949 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:26:19,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:19,950 INFO L85 PathProgramCache]: Analyzing trace with hash 806916253, now seen corresponding path program 2 times [2025-03-04 15:26:19,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:19,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898294334] [2025-03-04 15:26:19,950 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:26:19,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:19,957 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-04 15:26:19,969 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 15:26:19,969 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:26:19,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:20,277 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 15:26:20,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:20,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898294334] [2025-03-04 15:26:20,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898294334] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:20,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295645049] [2025-03-04 15:26:20,278 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:26:20,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:20,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:20,282 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:20,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 15:26:20,379 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-04 15:26:20,410 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 15:26:20,410 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:26:20,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:20,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-04 15:26:20,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:20,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 15:26:20,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-04 15:26:20,573 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:26:20,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 15:26:20,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-04 15:26:21,012 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 15:26:21,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2025-03-04 15:26:21,069 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 11 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:26:21,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:21,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:26:21,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-03-04 15:26:21,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:26:21,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 33 [2025-03-04 15:26:21,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-03-04 15:26:21,705 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:26:21,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295645049] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:21,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:21,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 21, 21] total 46 [2025-03-04 15:26:21,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883692128] [2025-03-04 15:26:21,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:21,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-04 15:26:21,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:21,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-04 15:26:21,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1942, Unknown=1, NotChecked=0, Total=2162 [2025-03-04 15:26:22,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 97 [2025-03-04 15:26:22,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 326 transitions, 3325 flow. Second operand has 47 states, 47 states have (on average 26.361702127659573) internal successors, (1239), 47 states have internal predecessors, (1239), 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-03-04 15:26:22,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:22,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 97 [2025-03-04 15:26:22,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:25,583 INFO L124 PetriNetUnfolderBase]: 7054/13041 cut-off events. [2025-03-04 15:26:25,583 INFO L125 PetriNetUnfolderBase]: For 43481/44547 co-relation queries the response was YES. [2025-03-04 15:26:25,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48064 conditions, 13041 events. 7054/13041 cut-off events. For 43481/44547 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 102279 event pairs, 1040 based on Foata normal form. 691/13567 useless extension candidates. Maximal degree in co-relation 48009. Up to 1920 conditions per place. [2025-03-04 15:26:25,635 INFO L140 encePairwiseOnDemand]: 80/97 looper letters, 517 selfloop transitions, 117 changer transitions 308/968 dead transitions. [2025-03-04 15:26:25,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 968 transitions, 9923 flow [2025-03-04 15:26:25,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-04 15:26:25,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-03-04 15:26:25,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 1306 transitions. [2025-03-04 15:26:25,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.345228654507005 [2025-03-04 15:26:25,637 INFO L175 Difference]: Start difference. First operand has 279 places, 326 transitions, 3325 flow. Second operand 39 states and 1306 transitions. [2025-03-04 15:26:25,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 968 transitions, 9923 flow [2025-03-04 15:26:25,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 968 transitions, 9636 flow, removed 61 selfloop flow, removed 19 redundant places. [2025-03-04 15:26:25,737 INFO L231 Difference]: Finished difference. Result has 297 places, 317 transitions, 3231 flow [2025-03-04 15:26:25,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=3144, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=3231, PETRI_PLACES=297, PETRI_TRANSITIONS=317} [2025-03-04 15:26:25,738 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 206 predicate places. [2025-03-04 15:26:25,738 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 317 transitions, 3231 flow [2025-03-04 15:26:25,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 26.361702127659573) internal successors, (1239), 47 states have internal predecessors, (1239), 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-03-04 15:26:25,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:25,739 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:25,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-04 15:26:25,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-04 15:26:25,939 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:26:25,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:25,940 INFO L85 PathProgramCache]: Analyzing trace with hash 480158267, now seen corresponding path program 2 times [2025-03-04 15:26:25,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:25,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557736689] [2025-03-04 15:26:25,940 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:26:25,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:25,947 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-04 15:26:25,958 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 15:26:25,958 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:26:25,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:26,225 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 15:26:26,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:26,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557736689] [2025-03-04 15:26:26,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557736689] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:26,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721092050] [2025-03-04 15:26:26,226 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:26:26,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:26,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:26,228 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:26,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-04 15:26:26,320 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-04 15:26:26,352 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 15:26:26,352 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:26:26,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:26,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-04 15:26:26,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:26,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 15:26:26,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-04 15:26:26,534 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:26:26,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 15:26:26,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2025-03-04 15:26:26,880 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 15:26:26,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2025-03-04 15:26:26,896 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 11 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:26:26,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:27,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:26:27,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2025-03-04 15:26:27,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:26:27,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 39 [2025-03-04 15:26:27,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2025-03-04 15:26:27,483 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:26:27,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721092050] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:27,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:27,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 19, 19] total 43 [2025-03-04 15:26:27,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196153444] [2025-03-04 15:26:27,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:27,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-04 15:26:27,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:27,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-04 15:26:27,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1683, Unknown=1, NotChecked=0, Total=1892 [2025-03-04 15:26:27,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 97 [2025-03-04 15:26:27,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 317 transitions, 3231 flow. Second operand has 44 states, 44 states have (on average 28.522727272727273) internal successors, (1255), 44 states have internal predecessors, (1255), 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-03-04 15:26:27,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:27,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 97 [2025-03-04 15:26:27,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:30,184 INFO L124 PetriNetUnfolderBase]: 4316/8765 cut-off events. [2025-03-04 15:26:30,184 INFO L125 PetriNetUnfolderBase]: For 37740/38161 co-relation queries the response was YES. [2025-03-04 15:26:30,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33537 conditions, 8765 events. 4316/8765 cut-off events. For 37740/38161 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 68153 event pairs, 544 based on Foata normal form. 150/8865 useless extension candidates. Maximal degree in co-relation 33489. Up to 2335 conditions per place. [2025-03-04 15:26:30,231 INFO L140 encePairwiseOnDemand]: 85/97 looper letters, 292 selfloop transitions, 37 changer transitions 129/483 dead transitions. [2025-03-04 15:26:30,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 483 transitions, 5383 flow [2025-03-04 15:26:30,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 15:26:30,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-04 15:26:30,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 800 transitions. [2025-03-04 15:26:30,233 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3436426116838488 [2025-03-04 15:26:30,233 INFO L175 Difference]: Start difference. First operand has 297 places, 317 transitions, 3231 flow. Second operand 24 states and 800 transitions. [2025-03-04 15:26:30,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 483 transitions, 5383 flow [2025-03-04 15:26:30,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 483 transitions, 5063 flow, removed 43 selfloop flow, removed 34 redundant places. [2025-03-04 15:26:30,339 INFO L231 Difference]: Finished difference. Result has 273 places, 232 transitions, 2283 flow [2025-03-04 15:26:30,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=3024, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2283, PETRI_PLACES=273, PETRI_TRANSITIONS=232} [2025-03-04 15:26:30,339 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 182 predicate places. [2025-03-04 15:26:30,339 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 232 transitions, 2283 flow [2025-03-04 15:26:30,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 28.522727272727273) internal successors, (1255), 44 states have internal predecessors, (1255), 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-03-04 15:26:30,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:30,340 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:30,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-04 15:26:30,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:30,544 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:26:30,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:30,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1836002504, now seen corresponding path program 2 times [2025-03-04 15:26:30,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:30,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11101067] [2025-03-04 15:26:30,545 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:26:30,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:30,554 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-03-04 15:26:30,575 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 15:26:30,575 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:26:30,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:30,826 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 15:26:30,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:30,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11101067] [2025-03-04 15:26:30,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11101067] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:30,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642806398] [2025-03-04 15:26:30,827 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:26:30,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:30,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:30,829 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:30,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-04 15:26:30,945 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-03-04 15:26:30,978 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 15:26:30,978 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:26:30,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:30,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-04 15:26:30,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:31,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 15:26:31,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-04 15:26:31,276 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 15:26:31,276 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:31,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-04 15:26:31,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2025-03-04 15:26:31,487 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 15:26:31,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642806398] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:31,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:31,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 15, 11] total 28 [2025-03-04 15:26:31,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659940589] [2025-03-04 15:26:31,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:31,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 15:26:31,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:31,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 15:26:31,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2025-03-04 15:26:31,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 97 [2025-03-04 15:26:31,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 232 transitions, 2283 flow. Second operand has 29 states, 29 states have (on average 34.241379310344826) internal successors, (993), 29 states have internal predecessors, (993), 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-03-04 15:26:31,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:31,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 97 [2025-03-04 15:26:31,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:33,631 INFO L124 PetriNetUnfolderBase]: 5637/11345 cut-off events. [2025-03-04 15:26:33,631 INFO L125 PetriNetUnfolderBase]: For 36287/36527 co-relation queries the response was YES. [2025-03-04 15:26:33,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39574 conditions, 11345 events. 5637/11345 cut-off events. For 36287/36527 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 93964 event pairs, 544 based on Foata normal form. 400/11702 useless extension candidates. Maximal degree in co-relation 39549. Up to 1848 conditions per place. [2025-03-04 15:26:33,691 INFO L140 encePairwiseOnDemand]: 79/97 looper letters, 720 selfloop transitions, 97 changer transitions 8/857 dead transitions. [2025-03-04 15:26:33,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 857 transitions, 8882 flow [2025-03-04 15:26:33,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-04 15:26:33,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-04 15:26:33,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1139 transitions. [2025-03-04 15:26:33,693 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4049057945254177 [2025-03-04 15:26:33,693 INFO L175 Difference]: Start difference. First operand has 273 places, 232 transitions, 2283 flow. Second operand 29 states and 1139 transitions. [2025-03-04 15:26:33,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 857 transitions, 8882 flow [2025-03-04 15:26:33,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 857 transitions, 8028 flow, removed 37 selfloop flow, removed 31 redundant places. [2025-03-04 15:26:33,863 INFO L231 Difference]: Finished difference. Result has 252 places, 265 transitions, 2581 flow [2025-03-04 15:26:33,863 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=1966, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=2581, PETRI_PLACES=252, PETRI_TRANSITIONS=265} [2025-03-04 15:26:33,863 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 161 predicate places. [2025-03-04 15:26:33,864 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 265 transitions, 2581 flow [2025-03-04 15:26:33,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 34.241379310344826) internal successors, (993), 29 states have internal predecessors, (993), 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-03-04 15:26:33,864 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:33,864 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:33,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-03-04 15:26:34,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-04 15:26:34,065 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:26:34,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:34,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1081503710, now seen corresponding path program 2 times [2025-03-04 15:26:34,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:34,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71063037] [2025-03-04 15:26:34,065 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:26:34,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:34,075 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-04 15:26:34,095 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 15:26:34,095 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:26:34,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:34,295 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 15:26:34,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:34,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71063037] [2025-03-04 15:26:34,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71063037] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:34,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801347851] [2025-03-04 15:26:34,296 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:26:34,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:34,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:34,298 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:34,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-04 15:26:34,391 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-04 15:26:34,416 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 15:26:34,416 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:26:34,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:34,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 15:26:34,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:34,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-04 15:26:34,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2025-03-04 15:26:34,527 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 15:26:34,527 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:26:34,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801347851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:34,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:26:34,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 12 [2025-03-04 15:26:34,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146744704] [2025-03-04 15:26:34,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:34,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:26:34,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:34,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:26:34,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-04 15:26:34,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 97 [2025-03-04 15:26:34,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 265 transitions, 2581 flow. Second operand has 9 states, 9 states have (on average 50.111111111111114) internal successors, (451), 9 states have internal predecessors, (451), 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-03-04 15:26:34,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:34,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 97 [2025-03-04 15:26:34,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:35,512 INFO L124 PetriNetUnfolderBase]: 3341/8049 cut-off events. [2025-03-04 15:26:35,513 INFO L125 PetriNetUnfolderBase]: For 16734/16862 co-relation queries the response was YES. [2025-03-04 15:26:35,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26010 conditions, 8049 events. 3341/8049 cut-off events. For 16734/16862 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 70694 event pairs, 544 based on Foata normal form. 400/8407 useless extension candidates. Maximal degree in co-relation 25987. Up to 1452 conditions per place. [2025-03-04 15:26:35,538 INFO L140 encePairwiseOnDemand]: 88/97 looper letters, 0 selfloop transitions, 0 changer transitions 456/456 dead transitions. [2025-03-04 15:26:35,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 456 transitions, 4729 flow [2025-03-04 15:26:35,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:26:35,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:26:35,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 553 transitions. [2025-03-04 15:26:35,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5701030927835051 [2025-03-04 15:26:35,539 INFO L175 Difference]: Start difference. First operand has 252 places, 265 transitions, 2581 flow. Second operand 10 states and 553 transitions. [2025-03-04 15:26:35,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 456 transitions, 4729 flow [2025-03-04 15:26:35,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 456 transitions, 4552 flow, removed 12 selfloop flow, removed 15 redundant places. [2025-03-04 15:26:35,589 INFO L231 Difference]: Finished difference. Result has 242 places, 0 transitions, 0 flow [2025-03-04 15:26:35,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2400, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=0, PETRI_PLACES=242, PETRI_TRANSITIONS=0} [2025-03-04 15:26:35,590 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 151 predicate places. [2025-03-04 15:26:35,590 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 0 transitions, 0 flow [2025-03-04 15:26:35,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 50.111111111111114) internal successors, (451), 9 states have internal predecessors, (451), 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-03-04 15:26:35,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 44 remaining) [2025-03-04 15:26:35,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 44 remaining) [2025-03-04 15:26:35,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 44 remaining) [2025-03-04 15:26:35,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 44 remaining) [2025-03-04 15:26:35,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 44 remaining) [2025-03-04 15:26:35,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 44 remaining) [2025-03-04 15:26:35,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 44 remaining) [2025-03-04 15:26:35,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 44 remaining) [2025-03-04 15:26:35,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 44 remaining) [2025-03-04 15:26:35,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 44 remaining) [2025-03-04 15:26:35,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 44 remaining) [2025-03-04 15:26:35,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 44 remaining) [2025-03-04 15:26:35,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 44 remaining) [2025-03-04 15:26:35,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 44 remaining) [2025-03-04 15:26:35,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 44 remaining) [2025-03-04 15:26:35,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 44 remaining) [2025-03-04 15:26:35,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 44 remaining) [2025-03-04 15:26:35,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 44 remaining) [2025-03-04 15:26:35,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 44 remaining) [2025-03-04 15:26:35,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 44 remaining) [2025-03-04 15:26:35,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 44 remaining) [2025-03-04 15:26:35,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 44 remaining) [2025-03-04 15:26:35,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 44 remaining) [2025-03-04 15:26:35,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 44 remaining) [2025-03-04 15:26:35,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 44 remaining) [2025-03-04 15:26:35,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 44 remaining) [2025-03-04 15:26:35,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 44 remaining) [2025-03-04 15:26:35,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 44 remaining) [2025-03-04 15:26:35,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 44 remaining) [2025-03-04 15:26:35,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 44 remaining) [2025-03-04 15:26:35,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 44 remaining) [2025-03-04 15:26:35,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 44 remaining) [2025-03-04 15:26:35,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 44 remaining) [2025-03-04 15:26:35,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 44 remaining) [2025-03-04 15:26:35,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 44 remaining) [2025-03-04 15:26:35,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 44 remaining) [2025-03-04 15:26:35,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 44 remaining) [2025-03-04 15:26:35,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 44 remaining) [2025-03-04 15:26:35,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 44 remaining) [2025-03-04 15:26:35,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 44 remaining) [2025-03-04 15:26:35,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 44 remaining) [2025-03-04 15:26:35,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 44 remaining) [2025-03-04 15:26:35,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 44 remaining) [2025-03-04 15:26:35,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 44 remaining) [2025-03-04 15:26:35,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-04 15:26:35,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-04 15:26:35,797 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:35,800 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 15:26:35,801 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 15:26:35,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 03:26:35 BasicIcfg [2025-03-04 15:26:35,803 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 15:26:35,804 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:26:35,804 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:26:35,804 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:26:35,805 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:25:18" (3/4) ... [2025-03-04 15:26:35,806 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 15:26:35,808 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 15:26:35,808 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 15:26:35,814 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 162 nodes and edges [2025-03-04 15:26:35,814 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 71 nodes and edges [2025-03-04 15:26:35,815 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2025-03-04 15:26:35,815 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 15:26:35,891 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 15:26:35,892 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 15:26:35,892 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:26:35,892 INFO L158 Benchmark]: Toolchain (without parser) took 78448.32ms. Allocated memory was 167.8MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 121.7MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 288.4MB. Max. memory is 16.1GB. [2025-03-04 15:26:35,893 INFO L158 Benchmark]: CDTParser took 0.83ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:26:35,893 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.26ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 108.9MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:26:35,893 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.93ms. Allocated memory is still 167.8MB. Free memory was 108.9MB in the beginning and 106.8MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:26:35,893 INFO L158 Benchmark]: Boogie Preprocessor took 44.78ms. Allocated memory is still 167.8MB. Free memory was 106.1MB in the beginning and 104.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:26:35,894 INFO L158 Benchmark]: IcfgBuilder took 941.74ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 102.3MB in the end (delta: 1.7MB). Peak memory consumption was 83.0MB. Max. memory is 16.1GB. [2025-03-04 15:26:35,894 INFO L158 Benchmark]: TraceAbstraction took 77107.24ms. Allocated memory was 167.8MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 101.4MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2025-03-04 15:26:35,894 INFO L158 Benchmark]: Witness Printer took 87.75ms. Allocated memory is still 1.8GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:26:35,895 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.83ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.26ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 108.9MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.93ms. Allocated memory is still 167.8MB. Free memory was 108.9MB in the beginning and 106.8MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.78ms. Allocated memory is still 167.8MB. Free memory was 106.1MB in the beginning and 104.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 941.74ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 102.3MB in the end (delta: 1.7MB). Peak memory consumption was 83.0MB. Max. memory is 16.1GB. * TraceAbstraction took 77107.24ms. Allocated memory was 167.8MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 101.4MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 87.75ms. Allocated memory is still 1.8GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 121]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 121]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 123]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 123]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 121]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 121]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 123]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 123]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 103]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 103]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 103]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 83]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 103]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 83]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 114]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 114]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 114]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 114]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 92]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 92]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 130 locations, 44 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 77.0s, OverallIterations: 40, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 53.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 56 mSolverCounterUnknown, 8594 SdHoareTripleChecker+Valid, 17.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8120 mSDsluCounter, 13168 SdHoareTripleChecker+Invalid, 15.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1367 IncrementalHoareTripleChecker+Unchecked, 13006 mSDsCounter, 645 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29114 IncrementalHoareTripleChecker+Invalid, 31182 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 645 mSolverCounterUnsat, 162 mSDtfsCounter, 29114 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2007 GetRequests, 1194 SyntacticMatches, 24 SemanticMatches, 789 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 7834 ImplicationChecksByTransitivity, 11.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3454occurred in iteration=30, InterpolantAutomatonStates: 492, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 15.4s InterpolantComputationTime, 1977 NumberOfCodeBlocks, 1875 NumberOfCodeBlocksAsserted, 89 NumberOfCheckSat, 2569 ConstructedInterpolants, 256 QuantifiedInterpolants, 25577 SizeOfPredicates, 297 NumberOfNonLiveVariables, 6395 ConjunctsInSsa, 608 ConjunctsInUnsatCore, 85 InterpolantComputations, 20 PerfectInterpolantSequences, 823/1270 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 15:26:35,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE