./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-chromosome-subst.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-chromosome-subst.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 60539e5483ee028af31550fcc6bdc40a30b35263f2407e34b5392a698998aa9c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:23:52,910 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:23:52,957 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:23:52,961 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:23:52,961 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:23:52,978 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:23:52,979 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:23:52,979 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:23:52,979 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:23:52,979 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:23:52,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:23:52,979 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:23:52,979 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:23:52,979 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:23:52,980 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:23:52,980 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:23:52,980 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:23:52,980 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:23:52,980 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:23:52,980 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:23:52,980 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:23:52,980 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:23:52,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:23:52,980 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:23:52,980 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:23:52,980 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:23:52,980 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:23:52,980 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:23:52,980 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:23:52,980 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:23:52,980 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:23:52,980 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:23:52,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:23:52,980 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:23:52,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:23:52,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:23:52,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:23:52,981 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:23:52,981 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:23:52,981 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:23:52,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:23:52,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:23:52,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:23:52,981 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:23:52,981 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:23:52,981 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 -> 60539e5483ee028af31550fcc6bdc40a30b35263f2407e34b5392a698998aa9c [2025-03-04 15:23:53,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:23:53,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:23:53,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:23:53,217 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:23:53,217 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:23:53,219 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-chromosome-subst.wvr.c [2025-03-04 15:23:54,364 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b1f11bc3/58e589a6c78349d4a88300733661f020/FLAGba4111218 [2025-03-04 15:23:54,636 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:23:54,638 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-subst.wvr.c [2025-03-04 15:23:54,644 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b1f11bc3/58e589a6c78349d4a88300733661f020/FLAGba4111218 [2025-03-04 15:23:54,953 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b1f11bc3/58e589a6c78349d4a88300733661f020 [2025-03-04 15:23:54,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:23:54,957 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:23:54,958 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:23:54,959 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:23:54,963 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:23:54,963 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:23:54" (1/1) ... [2025-03-04 15:23:54,966 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28213580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:54, skipping insertion in model container [2025-03-04 15:23:54,966 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:23:54" (1/1) ... [2025-03-04 15:23:54,982 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:23:55,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:23:55,129 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:23:55,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:23:55,172 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:23:55,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:55 WrapperNode [2025-03-04 15:23:55,173 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:23:55,174 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:23:55,174 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:23:55,174 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:23:55,178 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:23:55" (1/1) ... [2025-03-04 15:23:55,183 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:23:55" (1/1) ... [2025-03-04 15:23:55,204 INFO L138 Inliner]: procedures = 25, calls = 33, calls flagged for inlining = 18, calls inlined = 26, statements flattened = 309 [2025-03-04 15:23:55,205 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:23:55,205 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:23:55,207 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:23:55,207 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:23:55,213 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:55" (1/1) ... [2025-03-04 15:23:55,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:55" (1/1) ... [2025-03-04 15:23:55,220 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:55" (1/1) ... [2025-03-04 15:23:55,231 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-04 15:23:55,232 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:55" (1/1) ... [2025-03-04 15:23:55,232 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:55" (1/1) ... [2025-03-04 15:23:55,238 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:55" (1/1) ... [2025-03-04 15:23:55,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:55" (1/1) ... [2025-03-04 15:23:55,245 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:55" (1/1) ... [2025-03-04 15:23:55,246 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:55" (1/1) ... [2025-03-04 15:23:55,249 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:23:55,251 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:23:55,251 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:23:55,251 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:23:55,255 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:55" (1/1) ... [2025-03-04 15:23:55,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:23:55,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:23:55,277 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:23:55,279 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:23:55,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:23:55,294 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:23:55,294 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:23:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:23:55,295 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:23:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 15:23:55,295 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 15:23:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:23:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:23:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:23:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:23:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:23:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:23:55,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:23:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:23:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:23:55,296 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:23:55,377 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:23:55,378 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:23:55,776 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:23:55,777 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:23:56,012 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:23:56,014 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:23:56,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:23:56 BoogieIcfgContainer [2025-03-04 15:23:56,014 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:23:56,016 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:23:56,017 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:23:56,019 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:23:56,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:23:54" (1/3) ... [2025-03-04 15:23:56,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c4abbfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:23:56, skipping insertion in model container [2025-03-04 15:23:56,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:55" (2/3) ... [2025-03-04 15:23:56,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c4abbfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:23:56, skipping insertion in model container [2025-03-04 15:23:56,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:23:56" (3/3) ... [2025-03-04 15:23:56,023 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-subst.wvr.c [2025-03-04 15:23:56,035 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:23:56,036 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-subst.wvr.c that has 4 procedures, 96 locations, 1 initial locations, 6 loop locations, and 30 error locations. [2025-03-04 15:23:56,036 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:23:56,102 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:23:56,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 107 transitions, 235 flow [2025-03-04 15:23:56,162 INFO L124 PetriNetUnfolderBase]: 12/104 cut-off events. [2025-03-04 15:23:56,163 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 15:23:56,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 104 events. 12/104 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 396 event pairs, 0 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2025-03-04 15:23:56,169 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 107 transitions, 235 flow [2025-03-04 15:23:56,172 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 102 transitions, 219 flow [2025-03-04 15:23:56,177 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:23:56,189 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;@249e6304, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:23:56,189 INFO L334 AbstractCegarLoop]: Starting to check reachability of 57 error locations. [2025-03-04 15:23:56,194 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:23:56,194 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:23:56,194 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:23:56,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:56,195 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:23:56,195 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 15:23:56,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:56,198 INFO L85 PathProgramCache]: Analyzing trace with hash 897808, now seen corresponding path program 1 times [2025-03-04 15:23:56,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:56,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309670606] [2025-03-04 15:23:56,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:56,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:56,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:23:56,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:23:56,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:56,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:56,412 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:23:56,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:56,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309670606] [2025-03-04 15:23:56,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309670606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:56,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:56,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:23:56,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899116849] [2025-03-04 15:23:56,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:56,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:56,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:56,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:56,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:56,460 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 107 [2025-03-04 15:23:56,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 102 transitions, 219 flow. Second operand has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 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:23:56,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:56,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 107 [2025-03-04 15:23:56,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:57,311 INFO L124 PetriNetUnfolderBase]: 4133/8574 cut-off events. [2025-03-04 15:23:57,312 INFO L125 PetriNetUnfolderBase]: For 250/250 co-relation queries the response was YES. [2025-03-04 15:23:57,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14289 conditions, 8574 events. 4133/8574 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 75127 event pairs, 2732 based on Foata normal form. 3/6721 useless extension candidates. Maximal degree in co-relation 13590. Up to 5489 conditions per place. [2025-03-04 15:23:57,382 INFO L140 encePairwiseOnDemand]: 91/107 looper letters, 50 selfloop transitions, 10 changer transitions 0/111 dead transitions. [2025-03-04 15:23:57,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 111 transitions, 357 flow [2025-03-04 15:23:57,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:57,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:57,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 282 transitions. [2025-03-04 15:23:57,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6588785046728972 [2025-03-04 15:23:57,397 INFO L175 Difference]: Start difference. First operand has 100 places, 102 transitions, 219 flow. Second operand 4 states and 282 transitions. [2025-03-04 15:23:57,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 111 transitions, 357 flow [2025-03-04 15:23:57,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 111 transitions, 348 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 15:23:57,408 INFO L231 Difference]: Finished difference. Result has 101 places, 111 transitions, 298 flow [2025-03-04 15:23:57,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=298, PETRI_PLACES=101, PETRI_TRANSITIONS=111} [2025-03-04 15:23:57,413 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 1 predicate places. [2025-03-04 15:23:57,415 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 111 transitions, 298 flow [2025-03-04 15:23:57,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 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:23:57,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:57,415 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:23:57,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:23:57,416 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 15:23:57,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:57,416 INFO L85 PathProgramCache]: Analyzing trace with hash 977624890, now seen corresponding path program 1 times [2025-03-04 15:23:57,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:57,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250185553] [2025-03-04 15:23:57,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:57,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:57,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:23:57,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:23:57,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:57,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:57,561 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:23:57,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:57,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250185553] [2025-03-04 15:23:57,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250185553] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:23:57,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077879535] [2025-03-04 15:23:57,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:57,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:57,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:23:57,570 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:23:57,571 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:23:57,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:23:57,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:23:57,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:57,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:57,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:23:57,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:23:57,684 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:23:57,685 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:23:57,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077879535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:57,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:23:57,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:23:57,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469502301] [2025-03-04 15:23:57,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:57,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:23:57,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:57,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:23:57,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:23:57,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 107 [2025-03-04 15:23:57,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 111 transitions, 298 flow. Second operand has 6 states, 6 states have (on average 54.833333333333336) internal successors, (329), 6 states have internal predecessors, (329), 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:23:57,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:57,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 107 [2025-03-04 15:23:57,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:58,352 INFO L124 PetriNetUnfolderBase]: 4133/8571 cut-off events. [2025-03-04 15:23:58,352 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-03-04 15:23:58,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14235 conditions, 8571 events. 4133/8571 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 75135 event pairs, 2732 based on Foata normal form. 3/6723 useless extension candidates. Maximal degree in co-relation 14162. Up to 5474 conditions per place. [2025-03-04 15:23:58,409 INFO L140 encePairwiseOnDemand]: 94/107 looper letters, 40 selfloop transitions, 17 changer transitions 0/108 dead transitions. [2025-03-04 15:23:58,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 108 transitions, 400 flow [2025-03-04 15:23:58,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:23:58,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:23:58,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 384 transitions. [2025-03-04 15:23:58,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5981308411214953 [2025-03-04 15:23:58,421 INFO L175 Difference]: Start difference. First operand has 101 places, 111 transitions, 298 flow. Second operand 6 states and 384 transitions. [2025-03-04 15:23:58,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 108 transitions, 400 flow [2025-03-04 15:23:58,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 108 transitions, 400 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:23:58,424 INFO L231 Difference]: Finished difference. Result has 103 places, 108 transitions, 320 flow [2025-03-04 15:23:58,424 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=320, PETRI_PLACES=103, PETRI_TRANSITIONS=108} [2025-03-04 15:23:58,425 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 3 predicate places. [2025-03-04 15:23:58,425 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 108 transitions, 320 flow [2025-03-04 15:23:58,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 54.833333333333336) internal successors, (329), 6 states have internal predecessors, (329), 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:23:58,426 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:58,426 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:23:58,435 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:23:58,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:58,630 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 15:23:58,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:58,630 INFO L85 PathProgramCache]: Analyzing trace with hash 241601354, now seen corresponding path program 1 times [2025-03-04 15:23:58,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:58,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595619528] [2025-03-04 15:23:58,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:58,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:58,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:23:58,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:23:58,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:58,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:58,713 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:23:58,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:58,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595619528] [2025-03-04 15:23:58,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595619528] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:23:58,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712493770] [2025-03-04 15:23:58,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:58,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:58,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:23:58,715 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:23:58,717 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:23:58,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:23:58,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:23:58,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:58,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:58,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:23:58,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:23:58,796 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:23:58,796 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:23:58,834 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:23:58,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712493770] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:23:58,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:23:58,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 15:23:58,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371775680] [2025-03-04 15:23:58,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:23:58,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:23:58,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:58,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:23:58,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:23:58,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 107 [2025-03-04 15:23:58,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 108 transitions, 320 flow. Second operand has 12 states, 12 states have (on average 55.083333333333336) internal successors, (661), 12 states have internal predecessors, (661), 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:23:58,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:58,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 107 [2025-03-04 15:23:58,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:59,627 INFO L124 PetriNetUnfolderBase]: 4142/8607 cut-off events. [2025-03-04 15:23:59,628 INFO L125 PetriNetUnfolderBase]: For 137/137 co-relation queries the response was YES. [2025-03-04 15:23:59,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14376 conditions, 8607 events. 4142/8607 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 75490 event pairs, 2732 based on Foata normal form. 9/6765 useless extension candidates. Maximal degree in co-relation 14164. Up to 5489 conditions per place. [2025-03-04 15:23:59,679 INFO L140 encePairwiseOnDemand]: 94/107 looper letters, 47 selfloop transitions, 37 changer transitions 0/135 dead transitions. [2025-03-04 15:23:59,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 135 transitions, 662 flow [2025-03-04 15:23:59,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:23:59,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:23:59,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 633 transitions. [2025-03-04 15:23:59,681 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.591588785046729 [2025-03-04 15:23:59,681 INFO L175 Difference]: Start difference. First operand has 103 places, 108 transitions, 320 flow. Second operand 10 states and 633 transitions. [2025-03-04 15:23:59,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 135 transitions, 662 flow [2025-03-04 15:23:59,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 135 transitions, 579 flow, removed 16 selfloop flow, removed 5 redundant places. [2025-03-04 15:23:59,687 INFO L231 Difference]: Finished difference. Result has 110 places, 135 transitions, 535 flow [2025-03-04 15:23:59,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=535, PETRI_PLACES=110, PETRI_TRANSITIONS=135} [2025-03-04 15:23:59,689 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 10 predicate places. [2025-03-04 15:23:59,689 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 135 transitions, 535 flow [2025-03-04 15:23:59,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 55.083333333333336) internal successors, (661), 12 states have internal predecessors, (661), 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:23:59,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:59,690 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:59,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 15:23:59,890 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,SelfDestructingSolverStorable2 [2025-03-04 15:23:59,891 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 15:23:59,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:59,891 INFO L85 PathProgramCache]: Analyzing trace with hash 535276925, now seen corresponding path program 1 times [2025-03-04 15:23:59,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:59,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404343515] [2025-03-04 15:23:59,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:59,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:59,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:23:59,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:23:59,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:59,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:00,016 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:24:00,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:00,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404343515] [2025-03-04 15:24:00,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404343515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:00,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:00,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:24:00,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889138591] [2025-03-04 15:24:00,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:00,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:24:00,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:00,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:24:00,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:24:00,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 107 [2025-03-04 15:24:00,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 135 transitions, 535 flow. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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:24:00,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:00,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 107 [2025-03-04 15:24:00,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:00,596 INFO L124 PetriNetUnfolderBase]: 4139/8604 cut-off events. [2025-03-04 15:24:00,597 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2025-03-04 15:24:00,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14386 conditions, 8604 events. 4139/8604 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 75254 event pairs, 2732 based on Foata normal form. 3/6757 useless extension candidates. Maximal degree in co-relation 14288. Up to 5503 conditions per place. [2025-03-04 15:24:00,636 INFO L140 encePairwiseOnDemand]: 100/107 looper letters, 66 selfloop transitions, 12 changer transitions 0/132 dead transitions. [2025-03-04 15:24:00,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 132 transitions, 677 flow [2025-03-04 15:24:00,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:24:00,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:24:00,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 234 transitions. [2025-03-04 15:24:00,638 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7289719626168224 [2025-03-04 15:24:00,638 INFO L175 Difference]: Start difference. First operand has 110 places, 135 transitions, 535 flow. Second operand 3 states and 234 transitions. [2025-03-04 15:24:00,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 132 transitions, 677 flow [2025-03-04 15:24:00,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 132 transitions, 629 flow, removed 9 selfloop flow, removed 3 redundant places. [2025-03-04 15:24:00,644 INFO L231 Difference]: Finished difference. Result has 109 places, 132 transitions, 497 flow [2025-03-04 15:24:00,644 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=497, PETRI_PLACES=109, PETRI_TRANSITIONS=132} [2025-03-04 15:24:00,645 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 9 predicate places. [2025-03-04 15:24:00,645 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 132 transitions, 497 flow [2025-03-04 15:24:00,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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:24:00,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:00,646 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-03-04 15:24:00,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:24:00,646 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 15:24:00,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:00,647 INFO L85 PathProgramCache]: Analyzing trace with hash -2058468684, now seen corresponding path program 2 times [2025-03-04 15:24:00,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:00,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444833453] [2025-03-04 15:24:00,648 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:24:00,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:00,660 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:24:00,665 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 15:24:00,666 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:24:00,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:00,709 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:24:00,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:00,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444833453] [2025-03-04 15:24:00,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444833453] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:24:00,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951098573] [2025-03-04 15:24:00,710 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:24:00,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:00,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:00,712 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:24:00,715 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:24:00,762 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:24:00,771 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 15:24:00,771 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:24:00,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:00,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:24:00,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:24:00,793 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:24:00,793 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:24:00,823 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:24:00,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951098573] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:24:00,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:24:00,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-03-04 15:24:00,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146004549] [2025-03-04 15:24:00,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:24:00,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:24:00,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:00,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:24:00,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:24:00,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 107 [2025-03-04 15:24:00,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 132 transitions, 497 flow. Second operand has 6 states, 6 states have (on average 55.666666666666664) internal successors, (334), 6 states have internal predecessors, (334), 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:24:00,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:00,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 107 [2025-03-04 15:24:00,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:01,347 INFO L124 PetriNetUnfolderBase]: 4139/8601 cut-off events. [2025-03-04 15:24:01,347 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2025-03-04 15:24:01,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14354 conditions, 8601 events. 4139/8601 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 75172 event pairs, 2732 based on Foata normal form. 3/6756 useless extension candidates. Maximal degree in co-relation 14275. Up to 5476 conditions per place. [2025-03-04 15:24:01,389 INFO L140 encePairwiseOnDemand]: 96/107 looper letters, 43 selfloop transitions, 35 changer transitions 0/129 dead transitions. [2025-03-04 15:24:01,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 129 transitions, 623 flow [2025-03-04 15:24:01,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:01,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:01,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2025-03-04 15:24:01,392 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.616822429906542 [2025-03-04 15:24:01,392 INFO L175 Difference]: Start difference. First operand has 109 places, 132 transitions, 497 flow. Second operand 4 states and 264 transitions. [2025-03-04 15:24:01,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 129 transitions, 623 flow [2025-03-04 15:24:01,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 129 transitions, 569 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-04 15:24:01,396 INFO L231 Difference]: Finished difference. Result has 103 places, 129 transitions, 483 flow [2025-03-04 15:24:01,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=483, PETRI_PLACES=103, PETRI_TRANSITIONS=129} [2025-03-04 15:24:01,397 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 3 predicate places. [2025-03-04 15:24:01,397 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 129 transitions, 483 flow [2025-03-04 15:24:01,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 55.666666666666664) internal successors, (334), 6 states have internal predecessors, (334), 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:24:01,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:01,397 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:01,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 15:24:01,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:01,598 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 15:24:01,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:01,598 INFO L85 PathProgramCache]: Analyzing trace with hash -116554594, now seen corresponding path program 1 times [2025-03-04 15:24:01,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:01,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949016603] [2025-03-04 15:24:01,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:01,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:01,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:24:01,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:24:01,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:01,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:01,692 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:24:01,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:01,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949016603] [2025-03-04 15:24:01,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949016603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:01,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:01,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:24:01,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756275375] [2025-03-04 15:24:01,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:01,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:01,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:01,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:01,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:01,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 107 [2025-03-04 15:24:01,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 129 transitions, 483 flow. Second operand has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 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:24:01,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:01,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 107 [2025-03-04 15:24:01,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:02,454 INFO L124 PetriNetUnfolderBase]: 8070/14747 cut-off events. [2025-03-04 15:24:02,454 INFO L125 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2025-03-04 15:24:02,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25892 conditions, 14747 events. 8070/14747 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 833. Compared 125903 event pairs, 2485 based on Foata normal form. 364/12241 useless extension candidates. Maximal degree in co-relation 25682. Up to 5059 conditions per place. [2025-03-04 15:24:02,532 INFO L140 encePairwiseOnDemand]: 99/107 looper letters, 128 selfloop transitions, 5 changer transitions 0/178 dead transitions. [2025-03-04 15:24:02,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 178 transitions, 853 flow [2025-03-04 15:24:02,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:02,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:02,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 319 transitions. [2025-03-04 15:24:02,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7453271028037384 [2025-03-04 15:24:02,534 INFO L175 Difference]: Start difference. First operand has 103 places, 129 transitions, 483 flow. Second operand 4 states and 319 transitions. [2025-03-04 15:24:02,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 178 transitions, 853 flow [2025-03-04 15:24:02,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 178 transitions, 783 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:24:02,537 INFO L231 Difference]: Finished difference. Result has 105 places, 131 transitions, 447 flow [2025-03-04 15:24:02,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=447, PETRI_PLACES=105, PETRI_TRANSITIONS=131} [2025-03-04 15:24:02,539 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 5 predicate places. [2025-03-04 15:24:02,539 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 131 transitions, 447 flow [2025-03-04 15:24:02,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 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:24:02,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:02,540 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:02,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:24:02,540 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 15:24:02,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:02,541 INFO L85 PathProgramCache]: Analyzing trace with hash 681775760, now seen corresponding path program 1 times [2025-03-04 15:24:02,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:02,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305996862] [2025-03-04 15:24:02,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:02,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:02,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:24:02,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:24:02,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:02,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:02,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:24:02,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:02,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305996862] [2025-03-04 15:24:02,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305996862] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:24:02,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934624643] [2025-03-04 15:24:02,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:02,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:02,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:02,701 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:24:02,702 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:24:02,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:24:02,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:24:02,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:02,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:02,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:24:02,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:24:02,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:24:02,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:24:02,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:24:02,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934624643] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:24:02,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:24:02,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2025-03-04 15:24:02,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775602151] [2025-03-04 15:24:02,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:24:02,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 15:24:02,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:02,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 15:24:02,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:24:02,895 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 107 [2025-03-04 15:24:02,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 131 transitions, 447 flow. Second operand has 11 states, 11 states have (on average 56.45454545454545) internal successors, (621), 11 states have internal predecessors, (621), 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:24:02,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:02,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 107 [2025-03-04 15:24:02,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:03,699 INFO L124 PetriNetUnfolderBase]: 5178/10981 cut-off events. [2025-03-04 15:24:03,699 INFO L125 PetriNetUnfolderBase]: For 1899/2165 co-relation queries the response was YES. [2025-03-04 15:24:03,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19640 conditions, 10981 events. 5178/10981 cut-off events. For 1899/2165 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 101878 event pairs, 3504 based on Foata normal form. 135/8929 useless extension candidates. Maximal degree in co-relation 19481. Up to 6892 conditions per place. [2025-03-04 15:24:03,740 INFO L140 encePairwiseOnDemand]: 97/107 looper letters, 42 selfloop transitions, 32 changer transitions 0/125 dead transitions. [2025-03-04 15:24:03,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 125 transitions, 565 flow [2025-03-04 15:24:03,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:24:03,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:24:03,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 444 transitions. [2025-03-04 15:24:03,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5927903871829105 [2025-03-04 15:24:03,742 INFO L175 Difference]: Start difference. First operand has 105 places, 131 transitions, 447 flow. Second operand 7 states and 444 transitions. [2025-03-04 15:24:03,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 125 transitions, 565 flow [2025-03-04 15:24:03,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 125 transitions, 565 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:24:03,761 INFO L231 Difference]: Finished difference. Result has 111 places, 125 transitions, 481 flow [2025-03-04 15:24:03,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=481, PETRI_PLACES=111, PETRI_TRANSITIONS=125} [2025-03-04 15:24:03,761 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 11 predicate places. [2025-03-04 15:24:03,761 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 125 transitions, 481 flow [2025-03-04 15:24:03,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 56.45454545454545) internal successors, (621), 11 states have internal predecessors, (621), 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:24:03,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:03,762 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:03,768 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:24:03,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:03,963 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 15:24:03,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:03,963 INFO L85 PathProgramCache]: Analyzing trace with hash 935859760, now seen corresponding path program 2 times [2025-03-04 15:24:03,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:03,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328378909] [2025-03-04 15:24:03,963 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:24:03,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:03,976 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-04 15:24:04,006 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 15:24:04,006 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:24:04,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:04,166 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 15:24:04,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:04,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328378909] [2025-03-04 15:24:04,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328378909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:24:04,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295677612] [2025-03-04 15:24:04,167 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:24:04,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:04,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:04,169 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:24:04,170 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:24:04,228 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-04 15:24:04,256 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 15:24:04,256 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:24:04,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:04,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:24:04,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:24:04,355 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 15:24:04,355 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:24:04,408 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 15:24:04,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295677612] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:24:04,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:24:04,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-04 15:24:04,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671021081] [2025-03-04 15:24:04,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:24:04,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 15:24:04,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:04,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 15:24:04,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-04 15:24:04,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 107 [2025-03-04 15:24:04,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 125 transitions, 481 flow. Second operand has 18 states, 18 states have (on average 55.611111111111114) internal successors, (1001), 18 states have internal predecessors, (1001), 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:24:04,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:04,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 107 [2025-03-04 15:24:04,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:05,334 INFO L124 PetriNetUnfolderBase]: 5175/10981 cut-off events. [2025-03-04 15:24:05,334 INFO L125 PetriNetUnfolderBase]: For 1941/2207 co-relation queries the response was YES. [2025-03-04 15:24:05,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19677 conditions, 10981 events. 5175/10981 cut-off events. For 1941/2207 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 101832 event pairs, 3504 based on Foata normal form. 137/8935 useless extension candidates. Maximal degree in co-relation 19484. Up to 6885 conditions per place. [2025-03-04 15:24:05,375 INFO L140 encePairwiseOnDemand]: 97/107 looper letters, 41 selfloop transitions, 33 changer transitions 0/125 dead transitions. [2025-03-04 15:24:05,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 125 transitions, 634 flow [2025-03-04 15:24:05,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:24:05,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 15:24:05,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 672 transitions. [2025-03-04 15:24:05,377 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5709430756159728 [2025-03-04 15:24:05,377 INFO L175 Difference]: Start difference. First operand has 111 places, 125 transitions, 481 flow. Second operand 11 states and 672 transitions. [2025-03-04 15:24:05,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 125 transitions, 634 flow [2025-03-04 15:24:05,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 125 transitions, 610 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:24:05,393 INFO L231 Difference]: Finished difference. Result has 119 places, 125 transitions, 554 flow [2025-03-04 15:24:05,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=554, PETRI_PLACES=119, PETRI_TRANSITIONS=125} [2025-03-04 15:24:05,394 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 19 predicate places. [2025-03-04 15:24:05,394 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 125 transitions, 554 flow [2025-03-04 15:24:05,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 55.611111111111114) internal successors, (1001), 18 states have internal predecessors, (1001), 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:24:05,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:05,395 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:05,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 15:24:05,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:05,596 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 15:24:05,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:05,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1371156944, now seen corresponding path program 3 times [2025-03-04 15:24:05,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:05,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735227126] [2025-03-04 15:24:05,597 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:24:05,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:05,615 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 6 equivalence classes. [2025-03-04 15:24:05,711 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 15:24:05,712 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 15:24:05,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:07,059 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-04 15:24:07,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:07,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735227126] [2025-03-04 15:24:07,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735227126] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:24:07,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764659654] [2025-03-04 15:24:07,060 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:24:07,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:07,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:07,062 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:24:07,063 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:24:07,129 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 6 equivalence classes. [2025-03-04 15:24:07,226 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 15:24:07,226 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 15:24:07,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:07,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-04 15:24:07,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:24:07,252 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:24:07,280 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:24:07,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 15:24:07,342 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 27 treesize of output 11 [2025-03-04 15:24:07,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 15:24:07,411 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 27 treesize of output 11 [2025-03-04 15:24:07,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 15:24:07,485 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 27 treesize of output 11 [2025-03-04 15:24:07,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 15:24:07,564 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 27 treesize of output 11 [2025-03-04 15:24:07,616 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:24:07,616 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:24:07,629 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:24:07,646 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:24:07,665 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:24:07,696 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:24:07,713 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:24:07,737 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:24:07,753 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-04 15:24:07,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:24:07,807 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_229 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_229) c_~o_2~0.base) c_~o_2~0.offset) 9223372039002259456)) is different from false [2025-03-04 15:25:22,313 INFO L349 Elim1Store]: treesize reduction 244, result has 20.0 percent of original size [2025-03-04 15:25:22,313 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 5 case distinctions, treesize of input 50 treesize of output 71 [2025-03-04 15:25:22,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:25:22,325 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 33 treesize of output 29 [2025-03-04 15:25:22,330 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 9 treesize of output 7 [2025-03-04 15:25:22,404 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 14 proven. 20 refuted. 1 times theorem prover too weak. 57 trivial. 13 not checked. [2025-03-04 15:25:22,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764659654] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:25:22,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:25:22,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 41 [2025-03-04 15:25:22,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428381498] [2025-03-04 15:25:22,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:25:22,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-04 15:25:22,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:22,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-04 15:25:22,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1372, Unknown=21, NotChecked=78, Total=1722 [2025-03-04 15:25:26,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 15:25:29,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.17s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 15:25:33,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]