./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_75-tricky_address2_racefree.i --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/goblint-regression/28-race_reach_75-tricky_address2_racefree.i -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 3c0354ee6107efc04d15102ecf9eef73430e38e14b70f16419cd07cd733fd0df --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:22:45,939 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:22:45,997 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:22:46,003 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:22:46,004 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:22:46,021 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:22:46,022 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:22:46,022 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:22:46,022 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:22:46,022 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:22:46,022 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:22:46,022 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:22:46,022 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:22:46,022 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:22:46,022 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:22:46,022 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:22:46,022 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:22:46,022 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:22:46,023 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:22:46,023 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:22:46,023 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:22:46,023 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:22:46,023 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:22:46,023 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:22:46,023 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:22:46,023 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:22:46,023 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:22:46,023 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:22:46,023 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:22:46,023 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:22:46,023 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:22:46,023 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:22:46,023 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:22:46,023 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:22:46,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:22:46,023 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:22:46,024 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:22:46,024 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:22:46,024 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:22:46,024 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:22:46,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:22:46,024 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:22:46,024 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:22:46,024 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:22:46,024 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:22:46,024 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 -> 3c0354ee6107efc04d15102ecf9eef73430e38e14b70f16419cd07cd733fd0df [2025-03-04 15:22:46,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:22:46,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:22:46,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:22:46,262 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:22:46,263 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:22:46,264 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_75-tricky_address2_racefree.i [2025-03-04 15:22:47,455 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/528b48ec2/e52cce1450aa4904a3137defb60e4c47/FLAGb479e20a6 [2025-03-04 15:22:47,765 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:22:47,766 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_75-tricky_address2_racefree.i [2025-03-04 15:22:47,784 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/528b48ec2/e52cce1450aa4904a3137defb60e4c47/FLAGb479e20a6 [2025-03-04 15:22:47,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/528b48ec2/e52cce1450aa4904a3137defb60e4c47 [2025-03-04 15:22:47,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:22:47,799 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:22:47,800 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:22:47,800 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:22:47,804 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:22:47,805 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:22:47" (1/1) ... [2025-03-04 15:22:47,806 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b90d30c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:47, skipping insertion in model container [2025-03-04 15:22:47,806 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:22:47" (1/1) ... [2025-03-04 15:22:47,835 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:22:48,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:22:48,198 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:22:48,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:22:48,290 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:22:48,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:48 WrapperNode [2025-03-04 15:22:48,290 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:22:48,291 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:22:48,291 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:22:48,291 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:22:48,296 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:22:48" (1/1) ... [2025-03-04 15:22:48,304 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:22:48" (1/1) ... [2025-03-04 15:22:48,325 INFO L138 Inliner]: procedures = 271, calls = 110, calls flagged for inlining = 7, calls inlined = 8, statements flattened = 271 [2025-03-04 15:22:48,325 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:22:48,326 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:22:48,326 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:22:48,326 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:22:48,333 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:48" (1/1) ... [2025-03-04 15:22:48,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:48" (1/1) ... [2025-03-04 15:22:48,338 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:48" (1/1) ... [2025-03-04 15:22:48,349 INFO L175 MemorySlicer]: Split 79 memory accesses to 4 slices as follows [2, 5, 70, 2]. 89 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 5, 60, 0]. The 5 writes are split as follows [0, 0, 4, 1]. [2025-03-04 15:22:48,350 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:48" (1/1) ... [2025-03-04 15:22:48,350 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:48" (1/1) ... [2025-03-04 15:22:48,358 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:48" (1/1) ... [2025-03-04 15:22:48,359 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:48" (1/1) ... [2025-03-04 15:22:48,361 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:48" (1/1) ... [2025-03-04 15:22:48,362 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:48" (1/1) ... [2025-03-04 15:22:48,364 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:22:48,364 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:22:48,365 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:22:48,365 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:22:48,365 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:48" (1/1) ... [2025-03-04 15:22:48,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:22:48,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:22:48,414 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:22:48,427 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:22:48,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:22:48,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:22:48,445 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 15:22:48,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:22:48,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:22:48,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:22:48,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 15:22:48,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:22:48,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:22:48,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:22:48,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 15:22:48,447 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 15:22:48,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:22:48,447 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 15:22:48,447 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 15:22:48,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:22:48,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:22:48,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:22:48,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 15:22:48,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:22:48,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:22:48,450 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:22:48,567 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:22:48,568 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:22:48,831 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L953: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-04 15:22:48,831 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L953-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-04 15:22:48,901 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:22:48,901 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:22:49,201 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:22:49,201 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:22:49,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:22:49 BoogieIcfgContainer [2025-03-04 15:22:49,201 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:22:49,204 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:22:49,204 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:22:49,207 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:22:49,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:22:47" (1/3) ... [2025-03-04 15:22:49,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@187cd9c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:22:49, skipping insertion in model container [2025-03-04 15:22:49,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:48" (2/3) ... [2025-03-04 15:22:49,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@187cd9c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:22:49, skipping insertion in model container [2025-03-04 15:22:49,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:22:49" (3/3) ... [2025-03-04 15:22:49,210 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_75-tricky_address2_racefree.i [2025-03-04 15:22:49,223 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:22:49,225 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_75-tricky_address2_racefree.i that has 2 procedures, 85 locations, 1 initial locations, 11 loop locations, and 14 error locations. [2025-03-04 15:22:49,225 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:22:49,267 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 15:22:49,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 109 transitions, 225 flow [2025-03-04 15:22:49,370 INFO L124 PetriNetUnfolderBase]: 35/155 cut-off events. [2025-03-04 15:22:49,374 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:22:49,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 155 events. 35/155 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 611 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 94. Up to 8 conditions per place. [2025-03-04 15:22:49,379 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 109 transitions, 225 flow [2025-03-04 15:22:49,383 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 108 transitions, 223 flow [2025-03-04 15:22:49,388 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:22:49,398 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;@164e823b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:22:49,399 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-03-04 15:22:49,407 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:22:49,407 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:22:49,407 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:22:49,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:49,408 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:22:49,408 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:22:49,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:49,413 INFO L85 PathProgramCache]: Analyzing trace with hash 645923, now seen corresponding path program 1 times [2025-03-04 15:22:49,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:49,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235471373] [2025-03-04 15:22:49,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:49,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:49,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:22:49,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:22:49,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:49,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:49,695 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:22:49,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:49,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235471373] [2025-03-04 15:22:49,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235471373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:49,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:49,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:49,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094118855] [2025-03-04 15:22:49,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:49,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:49,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:49,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:49,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:49,739 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 109 [2025-03-04 15:22:49,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 108 transitions, 223 flow. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 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:22:49,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:49,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 109 [2025-03-04 15:22:49,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:50,030 INFO L124 PetriNetUnfolderBase]: 440/1359 cut-off events. [2025-03-04 15:22:50,031 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:22:50,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2247 conditions, 1359 events. 440/1359 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 9055 event pairs, 396 based on Foata normal form. 225/1419 useless extension candidates. Maximal degree in co-relation 2157. Up to 881 conditions per place. [2025-03-04 15:22:50,047 INFO L140 encePairwiseOnDemand]: 83/109 looper letters, 47 selfloop transitions, 3 changer transitions 0/90 dead transitions. [2025-03-04 15:22:50,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 90 transitions, 287 flow [2025-03-04 15:22:50,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:50,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:50,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 233 transitions. [2025-03-04 15:22:50,057 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5344036697247706 [2025-03-04 15:22:50,059 INFO L175 Difference]: Start difference. First operand has 88 places, 108 transitions, 223 flow. Second operand 4 states and 233 transitions. [2025-03-04 15:22:50,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 90 transitions, 287 flow [2025-03-04 15:22:50,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 90 transitions, 287 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:22:50,065 INFO L231 Difference]: Finished difference. Result has 93 places, 90 transitions, 207 flow [2025-03-04 15:22:50,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=207, PETRI_PLACES=93, PETRI_TRANSITIONS=90} [2025-03-04 15:22:50,069 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 5 predicate places. [2025-03-04 15:22:50,069 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 90 transitions, 207 flow [2025-03-04 15:22:50,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 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:22:50,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:50,069 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:22:50,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:22:50,070 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:22:50,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:50,070 INFO L85 PathProgramCache]: Analyzing trace with hash 2063364083, now seen corresponding path program 1 times [2025-03-04 15:22:50,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:50,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526513787] [2025-03-04 15:22:50,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:50,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:50,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:22:50,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:22:50,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:50,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:50,233 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:22:50,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:50,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526513787] [2025-03-04 15:22:50,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526513787] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:22:50,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092650657] [2025-03-04 15:22:50,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:50,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:50,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:22:50,236 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:22:50,237 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:22:50,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:22:50,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:22:50,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:50,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:50,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:22:50,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:22:50,367 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:22:50,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:22:50,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092650657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:50,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:22:50,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:22:50,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613392743] [2025-03-04 15:22:50,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:50,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:22:50,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:50,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:22:50,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:22:50,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 109 [2025-03-04 15:22:50,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 90 transitions, 207 flow. Second operand has 6 states, 6 states have (on average 40.833333333333336) internal successors, (245), 6 states have internal predecessors, (245), 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:22:50,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:50,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 109 [2025-03-04 15:22:50,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:50,639 INFO L124 PetriNetUnfolderBase]: 440/1358 cut-off events. [2025-03-04 15:22:50,639 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 15:22:50,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2257 conditions, 1358 events. 440/1358 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 9047 event pairs, 396 based on Foata normal form. 1/1194 useless extension candidates. Maximal degree in co-relation 2239. Up to 876 conditions per place. [2025-03-04 15:22:50,646 INFO L140 encePairwiseOnDemand]: 104/109 looper letters, 43 selfloop transitions, 6 changer transitions 0/89 dead transitions. [2025-03-04 15:22:50,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 89 transitions, 301 flow [2025-03-04 15:22:50,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:22:50,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:22:50,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 290 transitions. [2025-03-04 15:22:50,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4434250764525994 [2025-03-04 15:22:50,649 INFO L175 Difference]: Start difference. First operand has 93 places, 90 transitions, 207 flow. Second operand 6 states and 290 transitions. [2025-03-04 15:22:50,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 89 transitions, 301 flow [2025-03-04 15:22:50,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 89 transitions, 299 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:22:50,651 INFO L231 Difference]: Finished difference. Result has 96 places, 89 transitions, 213 flow [2025-03-04 15:22:50,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=213, PETRI_PLACES=96, PETRI_TRANSITIONS=89} [2025-03-04 15:22:50,652 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 8 predicate places. [2025-03-04 15:22:50,652 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 89 transitions, 213 flow [2025-03-04 15:22:50,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.833333333333336) internal successors, (245), 6 states have internal predecessors, (245), 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:22:50,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:50,653 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:22:50,661 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:22:50,856 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:22:50,856 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:22:50,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:50,857 INFO L85 PathProgramCache]: Analyzing trace with hash -460222325, now seen corresponding path program 1 times [2025-03-04 15:22:50,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:50,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510818048] [2025-03-04 15:22:50,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:50,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:50,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:22:50,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:22:50,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:50,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:50,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:22:50,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:50,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510818048] [2025-03-04 15:22:50,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510818048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:50,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:50,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:50,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863897905] [2025-03-04 15:22:50,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:50,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:22:50,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:50,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:22:50,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:22:50,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 109 [2025-03-04 15:22:50,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 89 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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:22:50,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:50,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 109 [2025-03-04 15:22:50,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:51,088 INFO L124 PetriNetUnfolderBase]: 440/1357 cut-off events. [2025-03-04 15:22:51,088 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-04 15:22:51,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2259 conditions, 1357 events. 440/1357 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 9058 event pairs, 396 based on Foata normal form. 1/1194 useless extension candidates. Maximal degree in co-relation 2235. Up to 879 conditions per place. [2025-03-04 15:22:51,095 INFO L140 encePairwiseOnDemand]: 106/109 looper letters, 44 selfloop transitions, 4 changer transitions 0/88 dead transitions. [2025-03-04 15:22:51,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 88 transitions, 305 flow [2025-03-04 15:22:51,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:22:51,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:22:51,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2025-03-04 15:22:51,096 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5107033639143731 [2025-03-04 15:22:51,096 INFO L175 Difference]: Start difference. First operand has 96 places, 89 transitions, 213 flow. Second operand 3 states and 167 transitions. [2025-03-04 15:22:51,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 88 transitions, 305 flow [2025-03-04 15:22:51,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 88 transitions, 283 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-04 15:22:51,098 INFO L231 Difference]: Finished difference. Result has 91 places, 88 transitions, 195 flow [2025-03-04 15:22:51,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=195, PETRI_PLACES=91, PETRI_TRANSITIONS=88} [2025-03-04 15:22:51,099 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 3 predicate places. [2025-03-04 15:22:51,099 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 88 transitions, 195 flow [2025-03-04 15:22:51,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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:22:51,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:51,100 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:51,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:22:51,100 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:22:51,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:51,100 INFO L85 PathProgramCache]: Analyzing trace with hash 109245424, now seen corresponding path program 1 times [2025-03-04 15:22:51,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:51,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679604565] [2025-03-04 15:22:51,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:51,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:51,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:22:51,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:22:51,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:51,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:51,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:51,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:51,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679604565] [2025-03-04 15:22:51,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679604565] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:22:51,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251344589] [2025-03-04 15:22:51,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:51,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:51,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:22:51,201 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:22:51,203 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:22:51,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:22:51,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:22:51,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:51,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:51,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:22:51,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:22:51,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:51,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:22:51,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:51,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251344589] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:22:51,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:22:51,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 15:22:51,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63398081] [2025-03-04 15:22:51,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:22:51,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:22:51,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:51,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:22:51,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:22:51,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 109 [2025-03-04 15:22:51,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 88 transitions, 195 flow. Second operand has 10 states, 10 states have (on average 41.3) internal successors, (413), 10 states have internal predecessors, (413), 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:22:51,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:51,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 109 [2025-03-04 15:22:51,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:51,577 INFO L124 PetriNetUnfolderBase]: 440/1361 cut-off events. [2025-03-04 15:22:51,578 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-04 15:22:51,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2262 conditions, 1361 events. 440/1361 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 9030 event pairs, 396 based on Foata normal form. 2/1200 useless extension candidates. Maximal degree in co-relation 2228. Up to 877 conditions per place. [2025-03-04 15:22:51,584 INFO L140 encePairwiseOnDemand]: 105/109 looper letters, 44 selfloop transitions, 7 changer transitions 0/91 dead transitions. [2025-03-04 15:22:51,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 91 transitions, 312 flow [2025-03-04 15:22:51,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:22:51,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:22:51,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 333 transitions. [2025-03-04 15:22:51,587 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.436435124508519 [2025-03-04 15:22:51,587 INFO L175 Difference]: Start difference. First operand has 91 places, 88 transitions, 195 flow. Second operand 7 states and 333 transitions. [2025-03-04 15:22:51,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 91 transitions, 312 flow [2025-03-04 15:22:51,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 91 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:22:51,590 INFO L231 Difference]: Finished difference. Result has 97 places, 91 transitions, 221 flow [2025-03-04 15:22:51,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=221, PETRI_PLACES=97, PETRI_TRANSITIONS=91} [2025-03-04 15:22:51,590 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 9 predicate places. [2025-03-04 15:22:51,590 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 91 transitions, 221 flow [2025-03-04 15:22:51,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 41.3) internal successors, (413), 10 states have internal predecessors, (413), 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:22:51,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:51,592 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:51,599 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:22:51,796 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,SelfDestructingSolverStorable3 [2025-03-04 15:22:51,796 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:22:51,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:51,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1079606800, now seen corresponding path program 2 times [2025-03-04 15:22:51,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:51,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598157495] [2025-03-04 15:22:51,797 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:22:51,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:51,811 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 15:22:51,820 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 15 statements. [2025-03-04 15:22:51,820 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:22:51,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:51,881 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:22:51,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:51,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598157495] [2025-03-04 15:22:51,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598157495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:51,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:51,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:22:51,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795970984] [2025-03-04 15:22:51,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:51,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:51,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:51,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:51,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:51,892 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 109 [2025-03-04 15:22:51,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 91 transitions, 221 flow. Second operand has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 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:22:51,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:51,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 109 [2025-03-04 15:22:51,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:52,111 INFO L124 PetriNetUnfolderBase]: 435/1226 cut-off events. [2025-03-04 15:22:52,111 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 15:22:52,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2132 conditions, 1226 events. 435/1226 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 8033 event pairs, 0 based on Foata normal form. 19/1123 useless extension candidates. Maximal degree in co-relation 2093. Up to 824 conditions per place. [2025-03-04 15:22:52,118 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 86 selfloop transitions, 3 changer transitions 0/126 dead transitions. [2025-03-04 15:22:52,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 126 transitions, 469 flow [2025-03-04 15:22:52,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:52,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:52,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2025-03-04 15:22:52,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5573394495412844 [2025-03-04 15:22:52,120 INFO L175 Difference]: Start difference. First operand has 97 places, 91 transitions, 221 flow. Second operand 4 states and 243 transitions. [2025-03-04 15:22:52,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 126 transitions, 469 flow [2025-03-04 15:22:52,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 126 transitions, 465 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:22:52,124 INFO L231 Difference]: Finished difference. Result has 97 places, 89 transitions, 223 flow [2025-03-04 15:22:52,124 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=223, PETRI_PLACES=97, PETRI_TRANSITIONS=89} [2025-03-04 15:22:52,124 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 9 predicate places. [2025-03-04 15:22:52,125 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 89 transitions, 223 flow [2025-03-04 15:22:52,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 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:22:52,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:52,125 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:52,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:22:52,125 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:22:52,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:52,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1850505953, now seen corresponding path program 1 times [2025-03-04 15:22:52,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:52,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390855493] [2025-03-04 15:22:52,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:52,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:52,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:22:52,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:22:52,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:52,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:52,255 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:52,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:52,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390855493] [2025-03-04 15:22:52,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390855493] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:22:52,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094182792] [2025-03-04 15:22:52,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:52,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:52,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:22:52,261 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:22:52,265 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:22:52,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:22:52,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:22:52,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:52,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:52,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:22:52,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:22:52,397 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:52,397 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:22:52,481 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:52,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094182792] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:22:52,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:22:52,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-04 15:22:52,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705828997] [2025-03-04 15:22:52,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:22:52,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 15:22:52,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:52,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 15:22:52,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-04 15:22:52,503 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 109 [2025-03-04 15:22:52,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 89 transitions, 223 flow. Second operand has 18 states, 18 states have (on average 41.22222222222222) internal successors, (742), 18 states have internal predecessors, (742), 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:22:52,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:52,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 109 [2025-03-04 15:22:52,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:52,816 INFO L124 PetriNetUnfolderBase]: 439/1320 cut-off events. [2025-03-04 15:22:52,816 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-03-04 15:22:52,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2273 conditions, 1320 events. 439/1320 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 8566 event pairs, 396 based on Foata normal form. 4/1189 useless extension candidates. Maximal degree in co-relation 2198. Up to 857 conditions per place. [2025-03-04 15:22:52,822 INFO L140 encePairwiseOnDemand]: 105/109 looper letters, 44 selfloop transitions, 15 changer transitions 0/97 dead transitions. [2025-03-04 15:22:52,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 97 transitions, 389 flow [2025-03-04 15:22:52,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 15:22:52,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 15:22:52,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 663 transitions. [2025-03-04 15:22:52,826 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4055045871559633 [2025-03-04 15:22:52,827 INFO L175 Difference]: Start difference. First operand has 97 places, 89 transitions, 223 flow. Second operand 15 states and 663 transitions. [2025-03-04 15:22:52,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 97 transitions, 389 flow [2025-03-04 15:22:52,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 97 transitions, 383 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:22:52,831 INFO L231 Difference]: Finished difference. Result has 112 places, 97 transitions, 314 flow [2025-03-04 15:22:52,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=314, PETRI_PLACES=112, PETRI_TRANSITIONS=97} [2025-03-04 15:22:52,832 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 24 predicate places. [2025-03-04 15:22:52,833 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 97 transitions, 314 flow [2025-03-04 15:22:52,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 41.22222222222222) internal successors, (742), 18 states have internal predecessors, (742), 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:22:52,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:52,833 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:52,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:22:53,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:53,034 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:22:53,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:53,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1841403617, now seen corresponding path program 2 times [2025-03-04 15:22:53,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:53,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508114468] [2025-03-04 15:22:53,037 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:22:53,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:53,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 15:22:53,081 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:22:53,082 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:22:53,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:53,363 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:53,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:53,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508114468] [2025-03-04 15:22:53,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508114468] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:22:53,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325038414] [2025-03-04 15:22:53,364 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:22:53,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:53,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:22:53,366 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:22:53,368 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:22:53,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 15:22:53,446 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:22:53,446 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:22:53,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:53,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 15:22:53,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:22:53,523 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:53,525 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:22:53,671 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:53,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325038414] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:22:53,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:22:53,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 22 [2025-03-04 15:22:53,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132482646] [2025-03-04 15:22:53,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:22:53,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 15:22:53,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:53,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 15:22:53,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-04 15:22:53,689 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 109 [2025-03-04 15:22:53,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 97 transitions, 314 flow. Second operand has 23 states, 23 states have (on average 41.21739130434783) internal successors, (948), 23 states have internal predecessors, (948), 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:22:53,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:53,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 109 [2025-03-04 15:22:53,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:53,957 INFO L124 PetriNetUnfolderBase]: 439/1329 cut-off events. [2025-03-04 15:22:53,957 INFO L125 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2025-03-04 15:22:53,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2316 conditions, 1329 events. 439/1329 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 8553 event pairs, 396 based on Foata normal form. 3/1197 useless extension candidates. Maximal degree in co-relation 2181. Up to 857 conditions per place. [2025-03-04 15:22:53,962 INFO L140 encePairwiseOnDemand]: 105/109 looper letters, 44 selfloop transitions, 21 changer transitions 0/103 dead transitions. [2025-03-04 15:22:53,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 103 transitions, 498 flow [2025-03-04 15:22:53,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 15:22:53,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 15:22:53,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 908 transitions. [2025-03-04 15:22:53,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3966797728265618 [2025-03-04 15:22:53,966 INFO L175 Difference]: Start difference. First operand has 112 places, 97 transitions, 314 flow. Second operand 21 states and 908 transitions. [2025-03-04 15:22:53,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 103 transitions, 498 flow [2025-03-04 15:22:53,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 103 transitions, 488 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 15:22:53,968 INFO L231 Difference]: Finished difference. Result has 131 places, 103 transitions, 415 flow [2025-03-04 15:22:53,968 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=415, PETRI_PLACES=131, PETRI_TRANSITIONS=103} [2025-03-04 15:22:53,970 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 43 predicate places. [2025-03-04 15:22:53,970 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 103 transitions, 415 flow [2025-03-04 15:22:53,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 41.21739130434783) internal successors, (948), 23 states have internal predecessors, (948), 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:22:53,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:53,971 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:53,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 15:22:54,171 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:22:54,172 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:22:54,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:54,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1560207439, now seen corresponding path program 3 times [2025-03-04 15:22:54,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:54,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106314473] [2025-03-04 15:22:54,172 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:22:54,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:54,184 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 11 equivalence classes. [2025-03-04 15:22:54,224 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 15:22:54,224 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 15:22:54,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:22:54,224 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:22:54,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 15:22:54,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 15:22:54,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:54,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:22:54,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:22:54,267 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:22:54,268 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 19 remaining) [2025-03-04 15:22:54,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 19 remaining) [2025-03-04 15:22:54,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 19 remaining) [2025-03-04 15:22:54,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 19 remaining) [2025-03-04 15:22:54,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 19 remaining) [2025-03-04 15:22:54,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 19 remaining) [2025-03-04 15:22:54,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 19 remaining) [2025-03-04 15:22:54,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 19 remaining) [2025-03-04 15:22:54,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 19 remaining) [2025-03-04 15:22:54,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 19 remaining) [2025-03-04 15:22:54,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 19 remaining) [2025-03-04 15:22:54,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 19 remaining) [2025-03-04 15:22:54,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 19 remaining) [2025-03-04 15:22:54,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 19 remaining) [2025-03-04 15:22:54,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 19 remaining) [2025-03-04 15:22:54,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 19 remaining) [2025-03-04 15:22:54,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 19 remaining) [2025-03-04 15:22:54,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 19 remaining) [2025-03-04 15:22:54,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 19 remaining) [2025-03-04 15:22:54,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:22:54,271 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2025-03-04 15:22:54,273 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:22:54,273 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 15:22:54,295 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:22:54,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 154 transitions, 324 flow [2025-03-04 15:22:54,308 INFO L124 PetriNetUnfolderBase]: 59/265 cut-off events. [2025-03-04 15:22:54,308 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 15:22:54,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 265 events. 59/265 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1208 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 157. Up to 12 conditions per place. [2025-03-04 15:22:54,309 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 154 transitions, 324 flow [2025-03-04 15:22:54,311 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 154 transitions, 324 flow [2025-03-04 15:22:54,311 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:22:54,311 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;@164e823b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:22:54,311 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-04 15:22:54,313 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:22:54,313 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:22:54,313 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:22:54,313 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:54,313 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:22:54,313 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:22:54,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:54,313 INFO L85 PathProgramCache]: Analyzing trace with hash 798845, now seen corresponding path program 1 times [2025-03-04 15:22:54,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:54,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462032327] [2025-03-04 15:22:54,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:54,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:54,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:22:54,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:22:54,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:54,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:54,356 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:22:54,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:54,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462032327] [2025-03-04 15:22:54,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462032327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:54,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:54,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:54,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158853426] [2025-03-04 15:22:54,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:54,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:54,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:54,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:54,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:54,361 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 154 [2025-03-04 15:22:54,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 154 transitions, 324 flow. Second operand has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 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:22:54,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:54,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 154 [2025-03-04 15:22:54,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:56,537 INFO L124 PetriNetUnfolderBase]: 17181/36179 cut-off events. [2025-03-04 15:22:56,537 INFO L125 PetriNetUnfolderBase]: For 111/111 co-relation queries the response was YES. [2025-03-04 15:22:56,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61897 conditions, 36179 events. 17181/36179 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 362484 event pairs, 15876 based on Foata normal form. 6829/38985 useless extension candidates. Maximal degree in co-relation 50322. Up to 25614 conditions per place. [2025-03-04 15:22:56,739 INFO L140 encePairwiseOnDemand]: 118/154 looper letters, 68 selfloop transitions, 3 changer transitions 0/126 dead transitions. [2025-03-04 15:22:56,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 126 transitions, 410 flow [2025-03-04 15:22:56,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:56,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:56,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 324 transitions. [2025-03-04 15:22:56,741 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.525974025974026 [2025-03-04 15:22:56,741 INFO L175 Difference]: Start difference. First operand has 123 places, 154 transitions, 324 flow. Second operand 4 states and 324 transitions. [2025-03-04 15:22:56,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 126 transitions, 410 flow [2025-03-04 15:22:56,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 126 transitions, 410 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:22:56,743 INFO L231 Difference]: Finished difference. Result has 128 places, 126 transitions, 288 flow [2025-03-04 15:22:56,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=288, PETRI_PLACES=128, PETRI_TRANSITIONS=126} [2025-03-04 15:22:56,744 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 5 predicate places. [2025-03-04 15:22:56,744 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 126 transitions, 288 flow [2025-03-04 15:22:56,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 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:22:56,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:56,744 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:22:56,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:22:56,744 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:22:56,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:56,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1970718285, now seen corresponding path program 1 times [2025-03-04 15:22:56,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:56,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000045638] [2025-03-04 15:22:56,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:56,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:56,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:22:56,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:22:56,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:56,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:56,792 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:22:56,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:56,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000045638] [2025-03-04 15:22:56,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000045638] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:22:56,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776515251] [2025-03-04 15:22:56,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:56,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:56,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:22:56,794 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:22:56,796 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:22:56,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:22:56,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:22:56,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:56,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:56,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:22:56,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:22:56,950 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:22:56,950 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:22:56,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776515251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:56,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:22:56,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:22:56,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50041476] [2025-03-04 15:22:56,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:56,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:22:56,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:56,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:22:56,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:22:56,957 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 154 [2025-03-04 15:22:56,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 126 transitions, 288 flow. Second operand has 6 states, 6 states have (on average 55.833333333333336) internal successors, (335), 6 states have internal predecessors, (335), 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:22:56,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:56,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 154 [2025-03-04 15:22:56,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:59,043 INFO L124 PetriNetUnfolderBase]: 17181/36178 cut-off events. [2025-03-04 15:22:59,043 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2025-03-04 15:22:59,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61907 conditions, 36178 events. 17181/36178 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 362552 event pairs, 15876 based on Foata normal form. 1/32156 useless extension candidates. Maximal degree in co-relation 61888. Up to 25609 conditions per place. [2025-03-04 15:22:59,257 INFO L140 encePairwiseOnDemand]: 149/154 looper letters, 64 selfloop transitions, 6 changer transitions 0/125 dead transitions. [2025-03-04 15:22:59,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 125 transitions, 424 flow [2025-03-04 15:22:59,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:22:59,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:22:59,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 401 transitions. [2025-03-04 15:22:59,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43398268398268397 [2025-03-04 15:22:59,259 INFO L175 Difference]: Start difference. First operand has 128 places, 126 transitions, 288 flow. Second operand 6 states and 401 transitions. [2025-03-04 15:22:59,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 125 transitions, 424 flow [2025-03-04 15:22:59,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 125 transitions, 422 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:22:59,261 INFO L231 Difference]: Finished difference. Result has 131 places, 125 transitions, 294 flow [2025-03-04 15:22:59,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=294, PETRI_PLACES=131, PETRI_TRANSITIONS=125} [2025-03-04 15:22:59,262 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 8 predicate places. [2025-03-04 15:22:59,262 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 125 transitions, 294 flow [2025-03-04 15:22:59,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 55.833333333333336) internal successors, (335), 6 states have internal predecessors, (335), 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:22:59,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:59,263 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:22:59,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 15:22:59,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 15:22:59,463 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:22:59,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:59,464 INFO L85 PathProgramCache]: Analyzing trace with hash -962723995, now seen corresponding path program 1 times [2025-03-04 15:22:59,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:59,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437928824] [2025-03-04 15:22:59,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:59,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:59,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:22:59,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:22:59,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:59,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:59,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:22:59,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:59,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437928824] [2025-03-04 15:22:59,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437928824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:59,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:59,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:59,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059633720] [2025-03-04 15:22:59,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:59,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:22:59,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:59,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:22:59,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:22:59,497 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 154 [2025-03-04 15:22:59,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 125 transitions, 294 flow. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:59,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:59,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 154 [2025-03-04 15:22:59,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:01,273 INFO L124 PetriNetUnfolderBase]: 17181/36177 cut-off events. [2025-03-04 15:23:01,273 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2025-03-04 15:23:01,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61909 conditions, 36177 events. 17181/36177 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 362533 event pairs, 15876 based on Foata normal form. 1/32156 useless extension candidates. Maximal degree in co-relation 61884. Up to 25612 conditions per place. [2025-03-04 15:23:01,463 INFO L140 encePairwiseOnDemand]: 151/154 looper letters, 65 selfloop transitions, 4 changer transitions 0/124 dead transitions. [2025-03-04 15:23:01,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 124 transitions, 428 flow [2025-03-04 15:23:01,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:23:01,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:23:01,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2025-03-04 15:23:01,464 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5043290043290043 [2025-03-04 15:23:01,465 INFO L175 Difference]: Start difference. First operand has 131 places, 125 transitions, 294 flow. Second operand 3 states and 233 transitions. [2025-03-04 15:23:01,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 124 transitions, 428 flow [2025-03-04 15:23:01,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 124 transitions, 406 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-04 15:23:01,467 INFO L231 Difference]: Finished difference. Result has 126 places, 124 transitions, 276 flow [2025-03-04 15:23:01,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=126, PETRI_TRANSITIONS=124} [2025-03-04 15:23:01,468 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 3 predicate places. [2025-03-04 15:23:01,468 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 124 transitions, 276 flow [2025-03-04 15:23:01,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:01,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:01,468 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:01,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:23:01,468 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:23:01,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:01,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1758476043, now seen corresponding path program 1 times [2025-03-04 15:23:01,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:01,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43106738] [2025-03-04 15:23:01,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:01,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:01,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:23:01,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:23:01,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:01,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:01,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:01,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:01,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43106738] [2025-03-04 15:23:01,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43106738] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:23:01,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628234415] [2025-03-04 15:23:01,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:01,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:01,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:23:01,529 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:23:01,531 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:23:01,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:23:01,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:23:01,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:01,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:01,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:23:01,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:23:01,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:01,622 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:23:01,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:01,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628234415] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:23:01,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:23:01,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 15:23:01,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605063050] [2025-03-04 15:23:01,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:23:01,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:23:01,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:01,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:23:01,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:23:01,653 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 154 [2025-03-04 15:23:01,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 124 transitions, 276 flow. Second operand has 10 states, 10 states have (on average 56.3) internal successors, (563), 10 states have internal predecessors, (563), 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:01,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:01,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 154 [2025-03-04 15:23:01,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:03,827 INFO L124 PetriNetUnfolderBase]: 17181/36181 cut-off events. [2025-03-04 15:23:03,827 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2025-03-04 15:23:03,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61912 conditions, 36181 events. 17181/36181 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 362427 event pairs, 15876 based on Foata normal form. 2/32162 useless extension candidates. Maximal degree in co-relation 61877. Up to 25610 conditions per place. [2025-03-04 15:23:03,970 INFO L140 encePairwiseOnDemand]: 150/154 looper letters, 65 selfloop transitions, 7 changer transitions 0/127 dead transitions. [2025-03-04 15:23:03,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 127 transitions, 435 flow [2025-03-04 15:23:03,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:23:03,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:23:03,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 459 transitions. [2025-03-04 15:23:03,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42578849721706863 [2025-03-04 15:23:03,971 INFO L175 Difference]: Start difference. First operand has 126 places, 124 transitions, 276 flow. Second operand 7 states and 459 transitions. [2025-03-04 15:23:03,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 127 transitions, 435 flow [2025-03-04 15:23:03,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 127 transitions, 421 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:23:03,974 INFO L231 Difference]: Finished difference. Result has 132 places, 127 transitions, 302 flow [2025-03-04 15:23:03,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=302, PETRI_PLACES=132, PETRI_TRANSITIONS=127} [2025-03-04 15:23:03,975 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 9 predicate places. [2025-03-04 15:23:03,976 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 127 transitions, 302 flow [2025-03-04 15:23:03,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 56.3) internal successors, (563), 10 states have internal predecessors, (563), 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:03,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:03,976 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:03,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 15:23:04,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:04,177 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:23:04,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:04,178 INFO L85 PathProgramCache]: Analyzing trace with hash -550664907, now seen corresponding path program 2 times [2025-03-04 15:23:04,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:04,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570295761] [2025-03-04 15:23:04,178 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:23:04,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:04,183 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 15:23:04,188 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 15 statements. [2025-03-04 15:23:04,188 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:23:04,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:04,216 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:23:04,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:04,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570295761] [2025-03-04 15:23:04,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570295761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:04,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:04,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:23:04,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961497162] [2025-03-04 15:23:04,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:04,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:04,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:04,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:04,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:04,222 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 154 [2025-03-04 15:23:04,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 127 transitions, 302 flow. Second operand has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 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:04,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:04,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 154 [2025-03-04 15:23:04,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:06,020 INFO L124 PetriNetUnfolderBase]: 18847/38258 cut-off events. [2025-03-04 15:23:06,021 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2025-03-04 15:23:06,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66662 conditions, 38258 events. 18847/38258 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 1083. Compared 376127 event pairs, 8622 based on Foata normal form. 19/34116 useless extension candidates. Maximal degree in co-relation 66622. Up to 28225 conditions per place. [2025-03-04 15:23:06,261 INFO L140 encePairwiseOnDemand]: 148/154 looper letters, 111 selfloop transitions, 3 changer transitions 0/166 dead transitions. [2025-03-04 15:23:06,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 166 transitions, 608 flow [2025-03-04 15:23:06,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:06,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:06,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 328 transitions. [2025-03-04 15:23:06,262 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5324675324675324 [2025-03-04 15:23:06,262 INFO L175 Difference]: Start difference. First operand has 132 places, 127 transitions, 302 flow. Second operand 4 states and 328 transitions. [2025-03-04 15:23:06,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 166 transitions, 608 flow [2025-03-04 15:23:06,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 166 transitions, 604 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:23:06,265 INFO L231 Difference]: Finished difference. Result has 135 places, 129 transitions, 322 flow [2025-03-04 15:23:06,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=322, PETRI_PLACES=135, PETRI_TRANSITIONS=129} [2025-03-04 15:23:06,266 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 12 predicate places. [2025-03-04 15:23:06,266 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 129 transitions, 322 flow [2025-03-04 15:23:06,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 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:06,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:06,266 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:06,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 15:23:06,266 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:23:06,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:06,266 INFO L85 PathProgramCache]: Analyzing trace with hash 214656594, now seen corresponding path program 1 times [2025-03-04 15:23:06,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:06,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313152026] [2025-03-04 15:23:06,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:06,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:06,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:23:06,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:23:06,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:06,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:06,370 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:06,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:06,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313152026] [2025-03-04 15:23:06,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313152026] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:23:06,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639960287] [2025-03-04 15:23:06,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:06,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:06,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:23:06,372 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:23:06,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 15:23:06,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:23:06,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:23:06,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:06,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:06,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:23:06,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:23:06,502 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:06,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:23:06,585 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:06,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639960287] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:23:06,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:23:06,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-04 15:23:06,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710365912] [2025-03-04 15:23:06,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:23:06,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 15:23:06,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:06,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 15:23:06,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-04 15:23:06,601 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 154 [2025-03-04 15:23:06,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 129 transitions, 322 flow. Second operand has 18 states, 18 states have (on average 56.27777777777778) internal successors, (1013), 18 states have internal predecessors, (1013), 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:06,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:06,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 154 [2025-03-04 15:23:06,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:09,391 INFO L124 PetriNetUnfolderBase]: 17179/36363 cut-off events. [2025-03-04 15:23:09,391 INFO L125 PetriNetUnfolderBase]: For 902/1609 co-relation queries the response was YES. [2025-03-04 15:23:09,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62931 conditions, 36363 events. 17179/36363 cut-off events. For 902/1609 co-relation queries the response was YES. Maximal size of possible extension queue 1051. Compared 365406 event pairs, 15876 based on Foata normal form. 21/32715 useless extension candidates. Maximal degree in co-relation 62854. Up to 25621 conditions per place. [2025-03-04 15:23:09,700 INFO L140 encePairwiseOnDemand]: 150/154 looper letters, 66 selfloop transitions, 15 changer transitions 0/137 dead transitions. [2025-03-04 15:23:09,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 137 transitions, 532 flow [2025-03-04 15:23:09,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 15:23:09,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 15:23:09,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 909 transitions. [2025-03-04 15:23:09,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3935064935064935 [2025-03-04 15:23:09,702 INFO L175 Difference]: Start difference. First operand has 135 places, 129 transitions, 322 flow. Second operand 15 states and 909 transitions. [2025-03-04 15:23:09,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 137 transitions, 532 flow [2025-03-04 15:23:09,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 137 transitions, 530 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:23:09,707 INFO L231 Difference]: Finished difference. Result has 152 places, 137 transitions, 417 flow [2025-03-04 15:23:09,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=417, PETRI_PLACES=152, PETRI_TRANSITIONS=137} [2025-03-04 15:23:09,707 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 29 predicate places. [2025-03-04 15:23:09,707 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 137 transitions, 417 flow [2025-03-04 15:23:09,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 56.27777777777778) internal successors, (1013), 18 states have internal predecessors, (1013), 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:09,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:09,708 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:09,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 15:23:09,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:09,909 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:23:09,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:09,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1900818990, now seen corresponding path program 2 times [2025-03-04 15:23:09,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:09,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103963856] [2025-03-04 15:23:09,909 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:23:09,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:09,918 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-04 15:23:09,922 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 32 statements. [2025-03-04 15:23:09,922 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:23:09,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:09,979 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:23:09,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:09,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103963856] [2025-03-04 15:23:09,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103963856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:09,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:09,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:23:09,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057119552] [2025-03-04 15:23:09,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:09,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:23:09,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:09,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:23:09,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:23:09,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 154 [2025-03-04 15:23:09,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 137 transitions, 417 flow. Second operand has 6 states, 6 states have (on average 56.0) internal successors, (336), 6 states have internal predecessors, (336), 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:09,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:09,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 154 [2025-03-04 15:23:09,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:12,841 INFO L124 PetriNetUnfolderBase]: 17760/34257 cut-off events. [2025-03-04 15:23:12,842 INFO L125 PetriNetUnfolderBase]: For 1573/1573 co-relation queries the response was YES. [2025-03-04 15:23:13,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62825 conditions, 34257 events. 17760/34257 cut-off events. For 1573/1573 co-relation queries the response was YES. Maximal size of possible extension queue 1035. Compared 325751 event pairs, 665 based on Foata normal form. 361/31466 useless extension candidates. Maximal degree in co-relation 62724. Up to 21866 conditions per place. [2025-03-04 15:23:13,195 INFO L140 encePairwiseOnDemand]: 149/154 looper letters, 187 selfloop transitions, 6 changer transitions 0/245 dead transitions. [2025-03-04 15:23:13,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 245 transitions, 1017 flow [2025-03-04 15:23:13,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:23:13,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:23:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 505 transitions. [2025-03-04 15:23:13,197 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5465367965367965 [2025-03-04 15:23:13,197 INFO L175 Difference]: Start difference. First operand has 152 places, 137 transitions, 417 flow. Second operand 6 states and 505 transitions. [2025-03-04 15:23:13,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 245 transitions, 1017 flow [2025-03-04 15:23:13,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 245 transitions, 1007 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 15:23:13,203 INFO L231 Difference]: Finished difference. Result has 152 places, 136 transitions, 415 flow [2025-03-04 15:23:13,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=415, PETRI_PLACES=152, PETRI_TRANSITIONS=136} [2025-03-04 15:23:13,204 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 29 predicate places. [2025-03-04 15:23:13,204 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 136 transitions, 415 flow [2025-03-04 15:23:13,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 56.0) internal successors, (336), 6 states have internal predecessors, (336), 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:13,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:13,204 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:13,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 15:23:13,205 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:23:13,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:13,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1204154170, now seen corresponding path program 1 times [2025-03-04 15:23:13,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:13,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146688298] [2025-03-04 15:23:13,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:13,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:13,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 15:23:13,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 15:23:13,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:13,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:13,251 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:23:13,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:13,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146688298] [2025-03-04 15:23:13,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146688298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:13,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:13,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:23:13,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116781954] [2025-03-04 15:23:13,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:13,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:13,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:13,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:13,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:13,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 154 [2025-03-04 15:23:13,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 136 transitions, 415 flow. Second operand has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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:13,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:13,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 154 [2025-03-04 15:23:13,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:15,233 INFO L124 PetriNetUnfolderBase]: 17480/33341 cut-off events. [2025-03-04 15:23:15,233 INFO L125 PetriNetUnfolderBase]: For 2858/2858 co-relation queries the response was YES. [2025-03-04 15:23:15,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62101 conditions, 33341 events. 17480/33341 cut-off events. For 2858/2858 co-relation queries the response was YES. Maximal size of possible extension queue 979. Compared 311697 event pairs, 1044 based on Foata normal form. 361/31013 useless extension candidates. Maximal degree in co-relation 62004. Up to 23352 conditions per place. [2025-03-04 15:23:15,520 INFO L140 encePairwiseOnDemand]: 149/154 looper letters, 150 selfloop transitions, 6 changer transitions 0/208 dead transitions. [2025-03-04 15:23:15,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 208 transitions, 869 flow [2025-03-04 15:23:15,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:15,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:15,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 358 transitions. [2025-03-04 15:23:15,522 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5811688311688312 [2025-03-04 15:23:15,522 INFO L175 Difference]: Start difference. First operand has 152 places, 136 transitions, 415 flow. Second operand 4 states and 358 transitions. [2025-03-04 15:23:15,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 208 transitions, 869 flow [2025-03-04 15:23:15,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 208 transitions, 853 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-04 15:23:15,543 INFO L231 Difference]: Finished difference. Result has 150 places, 136 transitions, 415 flow [2025-03-04 15:23:15,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=415, PETRI_PLACES=150, PETRI_TRANSITIONS=136} [2025-03-04 15:23:15,543 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 27 predicate places. [2025-03-04 15:23:15,543 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 136 transitions, 415 flow [2025-03-04 15:23:15,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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:15,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:15,544 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:15,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 15:23:15,544 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:23:15,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:15,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1213069262, now seen corresponding path program 1 times [2025-03-04 15:23:15,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:15,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714920416] [2025-03-04 15:23:15,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:15,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:15,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 15:23:15,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 15:23:15,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:15,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:15,734 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:15,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:15,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714920416] [2025-03-04 15:23:15,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714920416] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:23:15,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174877011] [2025-03-04 15:23:15,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:15,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:15,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:23:15,739 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:23:15,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 15:23:15,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 15:23:15,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 15:23:15,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:15,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:15,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 15:23:15,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:23:15,861 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:15,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:23:16,003 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:16,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174877011] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:23:16,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:23:16,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 22 [2025-03-04 15:23:16,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76536302] [2025-03-04 15:23:16,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:23:16,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 15:23:16,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:16,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 15:23:16,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-04 15:23:16,032 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 154 [2025-03-04 15:23:16,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 136 transitions, 415 flow. Second operand has 23 states, 23 states have (on average 56.43478260869565) internal successors, (1298), 23 states have internal predecessors, (1298), 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:16,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:16,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 154 [2025-03-04 15:23:16,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:18,137 INFO L124 PetriNetUnfolderBase]: 17179/36140 cut-off events. [2025-03-04 15:23:18,138 INFO L125 PetriNetUnfolderBase]: For 3249/3249 co-relation queries the response was YES. [2025-03-04 15:23:18,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63496 conditions, 36140 events. 17179/36140 cut-off events. For 3249/3249 co-relation queries the response was YES. Maximal size of possible extension queue 1059. Compared 361132 event pairs, 15876 based on Foata normal form. 3/32465 useless extension candidates. Maximal degree in co-relation 63365. Up to 25616 conditions per place. [2025-03-04 15:23:18,424 INFO L140 encePairwiseOnDemand]: 150/154 looper letters, 67 selfloop transitions, 21 changer transitions 0/142 dead transitions. [2025-03-04 15:23:18,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 142 transitions, 645 flow [2025-03-04 15:23:18,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 15:23:18,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 15:23:18,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1244 transitions. [2025-03-04 15:23:18,426 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3846629560915275 [2025-03-04 15:23:18,426 INFO L175 Difference]: Start difference. First operand has 150 places, 136 transitions, 415 flow. Second operand 21 states and 1244 transitions. [2025-03-04 15:23:18,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 142 transitions, 645 flow [2025-03-04 15:23:18,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 142 transitions, 637 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:23:18,431 INFO L231 Difference]: Finished difference. Result has 171 places, 142 transitions, 518 flow [2025-03-04 15:23:18,431 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=518, PETRI_PLACES=171, PETRI_TRANSITIONS=142} [2025-03-04 15:23:18,431 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 48 predicate places. [2025-03-04 15:23:18,432 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 142 transitions, 518 flow [2025-03-04 15:23:18,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 56.43478260869565) internal successors, (1298), 23 states have internal predecessors, (1298), 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:18,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:18,432 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:18,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 15:23:18,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 15:23:18,633 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:23:18,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:18,633 INFO L85 PathProgramCache]: Analyzing trace with hash 2032282280, now seen corresponding path program 2 times [2025-03-04 15:23:18,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:18,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310067960] [2025-03-04 15:23:18,633 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:23:18,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:18,649 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-04 15:23:18,686 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 42 statements. [2025-03-04 15:23:18,686 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:23:18,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:23:19,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:19,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310067960] [2025-03-04 15:23:19,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310067960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:19,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:19,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:23:19,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431697666] [2025-03-04 15:23:19,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:19,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:23:19,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:19,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:23:19,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:23:19,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 154 [2025-03-04 15:23:19,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 142 transitions, 518 flow. Second operand has 5 states, 5 states have (on average 57.6) internal successors, (288), 5 states have internal predecessors, (288), 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:19,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:19,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 154 [2025-03-04 15:23:19,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:22,029 INFO L124 PetriNetUnfolderBase]: 21232/43257 cut-off events. [2025-03-04 15:23:22,029 INFO L125 PetriNetUnfolderBase]: For 2599/2599 co-relation queries the response was YES. [2025-03-04 15:23:22,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77331 conditions, 43257 events. 21232/43257 cut-off events. For 2599/2599 co-relation queries the response was YES. Maximal size of possible extension queue 1307. Compared 438865 event pairs, 2820 based on Foata normal form. 544/39989 useless extension candidates. Maximal degree in co-relation 77171. Up to 23250 conditions per place. [2025-03-04 15:23:22,540 INFO L140 encePairwiseOnDemand]: 146/154 looper letters, 238 selfloop transitions, 11 changer transitions 0/301 dead transitions. [2025-03-04 15:23:22,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 301 transitions, 1404 flow [2025-03-04 15:23:22,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:23:22,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:23:22,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 559 transitions. [2025-03-04 15:23:22,544 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.604978354978355 [2025-03-04 15:23:22,544 INFO L175 Difference]: Start difference. First operand has 171 places, 142 transitions, 518 flow. Second operand 6 states and 559 transitions. [2025-03-04 15:23:22,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 301 transitions, 1404 flow [2025-03-04 15:23:22,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 301 transitions, 1361 flow, removed 1 selfloop flow, removed 13 redundant places. [2025-03-04 15:23:22,550 INFO L231 Difference]: Finished difference. Result has 167 places, 154 transitions, 558 flow [2025-03-04 15:23:22,551 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=558, PETRI_PLACES=167, PETRI_TRANSITIONS=154} [2025-03-04 15:23:22,551 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 44 predicate places. [2025-03-04 15:23:22,551 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 154 transitions, 558 flow [2025-03-04 15:23:22,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.6) internal successors, (288), 5 states have internal predecessors, (288), 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:22,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:22,551 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:23:22,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 15:23:22,552 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:23:22,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:22,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1812412296, now seen corresponding path program 1 times [2025-03-04 15:23:22,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:22,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059281112] [2025-03-04 15:23:22,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:22,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:22,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 15:23:22,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 15:23:22,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:22,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:23:22,578 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:23:22,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 15:23:22,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 15:23:22,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:22,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:23:22,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:23:22,605 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:23:22,605 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-03-04 15:23:22,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 23 remaining) [2025-03-04 15:23:22,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2025-03-04 15:23:22,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 23 remaining) [2025-03-04 15:23:22,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2025-03-04 15:23:22,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 23 remaining) [2025-03-04 15:23:22,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2025-03-04 15:23:22,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 23 remaining) [2025-03-04 15:23:22,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2025-03-04 15:23:22,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2025-03-04 15:23:22,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 23 remaining) [2025-03-04 15:23:22,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 23 remaining) [2025-03-04 15:23:22,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 23 remaining) [2025-03-04 15:23:22,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 23 remaining) [2025-03-04 15:23:22,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 23 remaining) [2025-03-04 15:23:22,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2025-03-04 15:23:22,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 23 remaining) [2025-03-04 15:23:22,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2025-03-04 15:23:22,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 23 remaining) [2025-03-04 15:23:22,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2025-03-04 15:23:22,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 23 remaining) [2025-03-04 15:23:22,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2025-03-04 15:23:22,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2025-03-04 15:23:22,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 15:23:22,609 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:23:22,609 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:23:22,609 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 15:23:22,640 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:23:22,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 199 transitions, 425 flow [2025-03-04 15:23:22,659 INFO L124 PetriNetUnfolderBase]: 86/394 cut-off events. [2025-03-04 15:23:22,660 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-04 15:23:22,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 419 conditions, 394 events. 86/394 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1892 event pairs, 1 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 274. Up to 16 conditions per place. [2025-03-04 15:23:22,662 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 199 transitions, 425 flow [2025-03-04 15:23:22,666 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 199 transitions, 425 flow [2025-03-04 15:23:22,667 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:23:22,667 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;@164e823b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:23:22,667 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-03-04 15:23:22,668 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:23:22,668 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:23:22,668 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:23:22,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:22,668 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:23:22,668 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2025-03-04 15:23:22,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:22,669 INFO L85 PathProgramCache]: Analyzing trace with hash 996452, now seen corresponding path program 1 times [2025-03-04 15:23:22,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:22,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679073861] [2025-03-04 15:23:22,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:22,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:22,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:23:22,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:23:22,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:22,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:22,691 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:22,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:22,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679073861] [2025-03-04 15:23:22,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679073861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:22,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:22,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:23:22,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005688932] [2025-03-04 15:23:22,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:22,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:22,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:22,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:22,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:22,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 199 [2025-03-04 15:23:22,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 199 transitions, 425 flow. Second operand has 4 states, 4 states have (on average 70.75) internal successors, (283), 4 states have internal predecessors, (283), 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:22,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:22,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 199 [2025-03-04 15:23:22,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand