./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-node-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-node-symm.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9db11e263e78e3a6bd75c2a0c3dda64920ec857df2fbb1d0b7b1072a48f36a31 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:08:37,697 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:08:37,762 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 14:08:37,767 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:08:37,767 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:08:37,788 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:08:37,788 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:08:37,789 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:08:37,789 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:08:37,789 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:08:37,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 14:08:37,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 14:08:37,790 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:08:37,790 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:08:37,790 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:08:37,790 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:08:37,791 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 14:08:37,791 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:08:37,791 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:08:37,791 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:08:37,791 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:08:37,791 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 14:08:37,791 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 14:08:37,791 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 14:08:37,791 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 14:08:37,791 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:08:37,791 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:08:37,791 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:08:37,791 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:08:37,792 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:08:37,792 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:08:37,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:08:37,793 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 14:08:37,793 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 14:08:37,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:08:37,793 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:08:37,793 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 14:08:37,793 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 14:08:37,793 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 14:08:37,793 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:08:37,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 14:08:37,793 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 14:08:37,794 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 14:08:37,794 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 14:08:37,794 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 14:08:37,794 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9db11e263e78e3a6bd75c2a0c3dda64920ec857df2fbb1d0b7b1072a48f36a31 [2025-02-08 14:08:38,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:08:38,119 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:08:38,121 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:08:38,122 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:08:38,123 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:08:38,125 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-symm.wvr.c [2025-02-08 14:08:39,411 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/52ffbea64/73a5381dec314095ba5b745a46494a8e/FLAG16e315768 [2025-02-08 14:08:39,664 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:08:39,664 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-symm.wvr.c [2025-02-08 14:08:39,702 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/52ffbea64/73a5381dec314095ba5b745a46494a8e/FLAG16e315768 [2025-02-08 14:08:39,722 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/52ffbea64/73a5381dec314095ba5b745a46494a8e [2025-02-08 14:08:39,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:08:39,728 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:08:39,730 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:08:39,730 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:08:39,736 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:08:39,736 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:08:39" (1/1) ... [2025-02-08 14:08:39,739 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5540f65f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:08:39, skipping insertion in model container [2025-02-08 14:08:39,739 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:08:39" (1/1) ... [2025-02-08 14:08:39,756 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:08:39,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:08:39,955 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:08:39,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:08:40,008 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:08:40,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:08:40 WrapperNode [2025-02-08 14:08:40,009 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:08:40,010 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:08:40,011 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:08:40,011 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:08:40,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:08:40" (1/1) ... [2025-02-08 14:08:40,026 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:08:40" (1/1) ... [2025-02-08 14:08:40,064 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 19, calls inlined = 25, statements flattened = 325 [2025-02-08 14:08:40,068 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:08:40,069 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:08:40,072 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:08:40,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:08:40,082 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:08:40" (1/1) ... [2025-02-08 14:08:40,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:08:40" (1/1) ... [2025-02-08 14:08:40,087 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:08:40" (1/1) ... [2025-02-08 14:08:40,117 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 10, 6]. 56 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 4 writes are split as follows [0, 2, 2]. [2025-02-08 14:08:40,117 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:08:40" (1/1) ... [2025-02-08 14:08:40,117 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:08:40" (1/1) ... [2025-02-08 14:08:40,136 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:08:40" (1/1) ... [2025-02-08 14:08:40,137 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:08:40" (1/1) ... [2025-02-08 14:08:40,140 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:08:40" (1/1) ... [2025-02-08 14:08:40,141 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:08:40" (1/1) ... [2025-02-08 14:08:40,148 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:08:40,152 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:08:40,152 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:08:40,153 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:08:40,154 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:08:40" (1/1) ... [2025-02-08 14:08:40,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:08:40,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:08:40,180 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 14:08:40,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 14:08:40,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:08:40,204 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 14:08:40,205 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 14:08:40,205 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 14:08:40,205 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 14:08:40,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:08:40,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 14:08:40,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 14:08:40,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:08:40,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 14:08:40,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 14:08:40,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 14:08:40,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:08:40,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:08:40,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:08:40,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 14:08:40,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 14:08:40,208 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 14:08:40,340 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:08:40,342 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:08:40,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-8: #t~ite9#1 := #t~ret8#1; [2025-02-08 14:08:40,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-9: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647; [2025-02-08 14:08:40,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-10: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 14:08:40,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-11: havoc minus_#t~short41#1, minus_#t~short42#1, minus_~a#1, minus_~b#1; [2025-02-08 14:08:40,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-12: #t~ret8#1 := minus_#res#1; [2025-02-08 14:08:40,644 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-8: #t~ite18#1 := #t~ret17#1; [2025-02-08 14:08:40,644 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-9: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret17#1 && #t~ret17#1 <= 2147483647; [2025-02-08 14:08:40,644 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-10: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 14:08:40,645 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-11: havoc minus_#t~short41#1, minus_#t~short42#1, minus_~a#1, minus_~b#1; [2025-02-08 14:08:40,645 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-12: #t~ret17#1 := minus_#res#1; [2025-02-08 14:08:40,958 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 14:08:40,958 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:08:41,334 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:08:41,334 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:08:41,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:08:41 BoogieIcfgContainer [2025-02-08 14:08:41,335 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:08:41,337 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 14:08:41,337 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 14:08:41,342 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 14:08:41,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 02:08:39" (1/3) ... [2025-02-08 14:08:41,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e8f841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:08:41, skipping insertion in model container [2025-02-08 14:08:41,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:08:40" (2/3) ... [2025-02-08 14:08:41,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e8f841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:08:41, skipping insertion in model container [2025-02-08 14:08:41,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:08:41" (3/3) ... [2025-02-08 14:08:41,344 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-symm.wvr.c [2025-02-08 14:08:41,358 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 14:08:41,360 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-symm.wvr.c that has 3 procedures, 88 locations, 1 initial locations, 4 loop locations, and 30 error locations. [2025-02-08 14:08:41,360 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 14:08:41,435 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 14:08:41,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 95 transitions, 204 flow [2025-02-08 14:08:41,510 INFO L124 PetriNetUnfolderBase]: 8/93 cut-off events. [2025-02-08 14:08:41,516 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 14:08:41,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 93 events. 8/93 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 259 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2025-02-08 14:08:41,521 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 95 transitions, 204 flow [2025-02-08 14:08:41,526 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 92 transitions, 196 flow [2025-02-08 14:08:41,537 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:08:41,551 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;@11ae3a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:08:41,551 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2025-02-08 14:08:41,554 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:08:41,554 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-02-08 14:08:41,554 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:08:41,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:41,555 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-02-08 14:08:41,555 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-08 14:08:41,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:41,560 INFO L85 PathProgramCache]: Analyzing trace with hash 29201, now seen corresponding path program 1 times [2025-02-08 14:08:41,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:41,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726597701] [2025-02-08 14:08:41,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:41,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:41,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:08:41,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:08:41,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:41,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:41,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:08:41,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:41,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726597701] [2025-02-08 14:08:41,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726597701] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:08:41,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:08:41,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:08:41,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284046097] [2025-02-08 14:08:41,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:08:41,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:08:41,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:41,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:08:41,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:08:41,800 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 95 [2025-02-08 14:08:41,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 92 transitions, 196 flow. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:41,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:41,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 95 [2025-02-08 14:08:41,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:42,055 INFO L124 PetriNetUnfolderBase]: 250/696 cut-off events. [2025-02-08 14:08:42,055 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-02-08 14:08:42,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1139 conditions, 696 events. 250/696 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4269 event pairs, 176 based on Foata normal form. 4/540 useless extension candidates. Maximal degree in co-relation 1028. Up to 415 conditions per place. [2025-02-08 14:08:42,062 INFO L140 encePairwiseOnDemand]: 90/95 looper letters, 39 selfloop transitions, 1 changer transitions 2/88 dead transitions. [2025-02-08 14:08:42,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 88 transitions, 270 flow [2025-02-08 14:08:42,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:08:42,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:08:42,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2025-02-08 14:08:42,075 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6736842105263158 [2025-02-08 14:08:42,077 INFO L175 Difference]: Start difference. First operand has 91 places, 92 transitions, 196 flow. Second operand 3 states and 192 transitions. [2025-02-08 14:08:42,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 88 transitions, 270 flow [2025-02-08 14:08:42,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 88 transitions, 262 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 14:08:42,087 INFO L231 Difference]: Finished difference. Result has 85 places, 86 transitions, 177 flow [2025-02-08 14:08:42,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=177, PETRI_PLACES=85, PETRI_TRANSITIONS=86} [2025-02-08 14:08:42,092 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -6 predicate places. [2025-02-08 14:08:42,093 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 86 transitions, 177 flow [2025-02-08 14:08:42,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:42,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:42,093 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 14:08:42,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 14:08:42,093 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-08 14:08:42,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:42,094 INFO L85 PathProgramCache]: Analyzing trace with hash 906100, now seen corresponding path program 1 times [2025-02-08 14:08:42,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:42,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648032624] [2025-02-08 14:08:42,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:42,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:42,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:08:42,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:08:42,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:42,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:42,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:08:42,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:42,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648032624] [2025-02-08 14:08:42,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648032624] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:08:42,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:08:42,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:08:42,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505731106] [2025-02-08 14:08:42,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:08:42,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:08:42,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:42,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:08:42,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:08:42,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 95 [2025-02-08 14:08:42,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 86 transitions, 177 flow. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:42,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:42,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 95 [2025-02-08 14:08:42,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:42,312 INFO L124 PetriNetUnfolderBase]: 250/692 cut-off events. [2025-02-08 14:08:42,313 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 14:08:42,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 692 events. 250/692 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4245 event pairs, 176 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 1110. Up to 412 conditions per place. [2025-02-08 14:08:42,317 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 37 selfloop transitions, 1 changer transitions 0/84 dead transitions. [2025-02-08 14:08:42,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 84 transitions, 249 flow [2025-02-08 14:08:42,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:08:42,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:08:42,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2025-02-08 14:08:42,320 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.656140350877193 [2025-02-08 14:08:42,320 INFO L175 Difference]: Start difference. First operand has 85 places, 86 transitions, 177 flow. Second operand 3 states and 187 transitions. [2025-02-08 14:08:42,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 84 transitions, 249 flow [2025-02-08 14:08:42,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 84 transitions, 248 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:08:42,322 INFO L231 Difference]: Finished difference. Result has 82 places, 84 transitions, 174 flow [2025-02-08 14:08:42,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=82, PETRI_TRANSITIONS=84} [2025-02-08 14:08:42,323 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -9 predicate places. [2025-02-08 14:08:42,323 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 84 transitions, 174 flow [2025-02-08 14:08:42,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:42,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:42,323 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:08:42,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 14:08:42,324 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-08 14:08:42,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:42,324 INFO L85 PathProgramCache]: Analyzing trace with hash 870789501, now seen corresponding path program 1 times [2025-02-08 14:08:42,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:42,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718413998] [2025-02-08 14:08:42,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:42,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:42,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:08:42,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:08:42,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:42,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:42,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:08:42,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:42,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718413998] [2025-02-08 14:08:42,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718413998] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:08:42,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:08:42,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:08:42,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103184797] [2025-02-08 14:08:42,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:08:42,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:08:42,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:42,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:08:42,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:08:42,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 95 [2025-02-08 14:08:42,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 84 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:42,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:42,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 95 [2025-02-08 14:08:42,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:42,746 INFO L124 PetriNetUnfolderBase]: 252/700 cut-off events. [2025-02-08 14:08:42,746 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 14:08:42,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1135 conditions, 700 events. 252/700 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4268 event pairs, 176 based on Foata normal form. 2/542 useless extension candidates. Maximal degree in co-relation 1128. Up to 419 conditions per place. [2025-02-08 14:08:42,758 INFO L140 encePairwiseOnDemand]: 83/95 looper letters, 40 selfloop transitions, 8 changer transitions 0/90 dead transitions. [2025-02-08 14:08:42,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 90 transitions, 282 flow [2025-02-08 14:08:42,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:08:42,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:08:42,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 248 transitions. [2025-02-08 14:08:42,762 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6526315789473685 [2025-02-08 14:08:42,762 INFO L175 Difference]: Start difference. First operand has 82 places, 84 transitions, 174 flow. Second operand 4 states and 248 transitions. [2025-02-08 14:08:42,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 90 transitions, 282 flow [2025-02-08 14:08:42,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 90 transitions, 281 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:08:42,765 INFO L231 Difference]: Finished difference. Result has 86 places, 90 transitions, 231 flow [2025-02-08 14:08:42,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=231, PETRI_PLACES=86, PETRI_TRANSITIONS=90} [2025-02-08 14:08:42,766 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -5 predicate places. [2025-02-08 14:08:42,766 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 90 transitions, 231 flow [2025-02-08 14:08:42,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:42,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:42,766 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:08:42,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 14:08:42,767 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-08 14:08:42,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:42,767 INFO L85 PathProgramCache]: Analyzing trace with hash 870789570, now seen corresponding path program 1 times [2025-02-08 14:08:42,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:42,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966260828] [2025-02-08 14:08:42,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:42,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:42,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:08:42,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:08:42,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:42,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:42,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:08:42,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:42,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966260828] [2025-02-08 14:08:42,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966260828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:08:42,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:08:42,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:08:42,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837559484] [2025-02-08 14:08:42,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:08:42,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:08:42,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:42,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:08:42,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:08:42,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 95 [2025-02-08 14:08:42,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 90 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:42,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:42,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 95 [2025-02-08 14:08:42,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:42,987 INFO L124 PetriNetUnfolderBase]: 252/698 cut-off events. [2025-02-08 14:08:42,988 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 14:08:42,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1157 conditions, 698 events. 252/698 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4260 event pairs, 176 based on Foata normal form. 2/545 useless extension candidates. Maximal degree in co-relation 1148. Up to 420 conditions per place. [2025-02-08 14:08:42,994 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 45 selfloop transitions, 1 changer transitions 0/88 dead transitions. [2025-02-08 14:08:42,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 88 transitions, 319 flow [2025-02-08 14:08:42,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:08:42,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:08:42,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2025-02-08 14:08:42,996 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6631578947368421 [2025-02-08 14:08:42,997 INFO L175 Difference]: Start difference. First operand has 86 places, 90 transitions, 231 flow. Second operand 3 states and 189 transitions. [2025-02-08 14:08:42,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 88 transitions, 319 flow [2025-02-08 14:08:42,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 88 transitions, 313 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:08:43,000 INFO L231 Difference]: Finished difference. Result has 85 places, 88 transitions, 223 flow [2025-02-08 14:08:43,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=223, PETRI_PLACES=85, PETRI_TRANSITIONS=88} [2025-02-08 14:08:43,002 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -6 predicate places. [2025-02-08 14:08:43,003 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 88 transitions, 223 flow [2025-02-08 14:08:43,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:43,003 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:43,003 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 14:08:43,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 14:08:43,004 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-08 14:08:43,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:43,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1224673725, now seen corresponding path program 1 times [2025-02-08 14:08:43,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:43,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323781388] [2025-02-08 14:08:43,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:43,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:43,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:08:43,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:08:43,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:43,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:43,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:08:43,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:43,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323781388] [2025-02-08 14:08:43,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323781388] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:08:43,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:08:43,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:08:43,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31631869] [2025-02-08 14:08:43,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:08:43,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:08:43,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:43,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:08:43,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:08:43,094 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 95 [2025-02-08 14:08:43,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 88 transitions, 223 flow. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:43,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:43,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 95 [2025-02-08 14:08:43,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:43,207 INFO L124 PetriNetUnfolderBase]: 252/696 cut-off events. [2025-02-08 14:08:43,207 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-02-08 14:08:43,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 696 events. 252/696 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4247 event pairs, 176 based on Foata normal form. 1/543 useless extension candidates. Maximal degree in co-relation 1140. Up to 418 conditions per place. [2025-02-08 14:08:43,212 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 43 selfloop transitions, 1 changer transitions 0/86 dead transitions. [2025-02-08 14:08:43,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 86 transitions, 307 flow [2025-02-08 14:08:43,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:08:43,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:08:43,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2025-02-08 14:08:43,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.656140350877193 [2025-02-08 14:08:43,213 INFO L175 Difference]: Start difference. First operand has 85 places, 88 transitions, 223 flow. Second operand 3 states and 187 transitions. [2025-02-08 14:08:43,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 86 transitions, 307 flow [2025-02-08 14:08:43,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 86 transitions, 306 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:08:43,215 INFO L231 Difference]: Finished difference. Result has 84 places, 86 transitions, 220 flow [2025-02-08 14:08:43,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=84, PETRI_TRANSITIONS=86} [2025-02-08 14:08:43,216 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -7 predicate places. [2025-02-08 14:08:43,216 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 86 transitions, 220 flow [2025-02-08 14:08:43,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:43,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:43,217 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:08:43,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 14:08:43,217 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-08 14:08:43,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:43,217 INFO L85 PathProgramCache]: Analyzing trace with hash 88387248, now seen corresponding path program 1 times [2025-02-08 14:08:43,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:43,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871031350] [2025-02-08 14:08:43,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:43,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:43,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:08:43,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:08:43,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:43,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:43,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:08:43,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:43,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871031350] [2025-02-08 14:08:43,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871031350] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:08:43,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537608685] [2025-02-08 14:08:43,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:43,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:08:43,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:08:43,361 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:08:43,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 14:08:43,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:08:43,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:08:43,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:43,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:43,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:08:43,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:08:43,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:08:43,503 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 14:08:43,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537608685] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:08:43,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 14:08:43,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-08 14:08:43,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748091194] [2025-02-08 14:08:43,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:08:43,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:08:43,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:43,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:08:43,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 14:08:43,522 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 95 [2025-02-08 14:08:43,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 86 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:43,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:43,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 95 [2025-02-08 14:08:43,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:43,708 INFO L124 PetriNetUnfolderBase]: 252/694 cut-off events. [2025-02-08 14:08:43,709 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-02-08 14:08:43,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 694 events. 252/694 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4229 event pairs, 176 based on Foata normal form. 2/540 useless extension candidates. Maximal degree in co-relation 1138. Up to 409 conditions per place. [2025-02-08 14:08:43,713 INFO L140 encePairwiseOnDemand]: 85/95 looper letters, 32 selfloop transitions, 14 changer transitions 0/84 dead transitions. [2025-02-08 14:08:43,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 84 transitions, 304 flow [2025-02-08 14:08:43,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:08:43,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:08:43,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 342 transitions. [2025-02-08 14:08:43,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-02-08 14:08:43,716 INFO L175 Difference]: Start difference. First operand has 84 places, 86 transitions, 220 flow. Second operand 6 states and 342 transitions. [2025-02-08 14:08:43,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 84 transitions, 304 flow [2025-02-08 14:08:43,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 84 transitions, 303 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:08:43,718 INFO L231 Difference]: Finished difference. Result has 86 places, 84 transitions, 239 flow [2025-02-08 14:08:43,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=239, PETRI_PLACES=86, PETRI_TRANSITIONS=84} [2025-02-08 14:08:43,719 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -5 predicate places. [2025-02-08 14:08:43,719 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 84 transitions, 239 flow [2025-02-08 14:08:43,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:43,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:43,719 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-02-08 14:08:43,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 14:08:43,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:08:43,920 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-08 14:08:43,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:43,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1554961772, now seen corresponding path program 1 times [2025-02-08 14:08:43,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:43,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826152392] [2025-02-08 14:08:43,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:43,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:43,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:08:43,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:08:43,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:43,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:44,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:08:44,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:44,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826152392] [2025-02-08 14:08:44,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826152392] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:08:44,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201652749] [2025-02-08 14:08:44,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:44,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:08:44,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:08:44,045 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:08:44,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 14:08:44,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:08:44,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:08:44,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:44,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:44,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:08:44,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:08:44,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:08:44,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:08:44,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:08:44,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201652749] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:08:44,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:08:44,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-08 14:08:44,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749396100] [2025-02-08 14:08:44,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:08:44,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 14:08:44,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:44,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 14:08:44,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-08 14:08:44,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 95 [2025-02-08 14:08:44,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 84 transitions, 239 flow. Second operand has 12 states, 12 states have (on average 50.166666666666664) internal successors, (602), 12 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:44,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:44,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 95 [2025-02-08 14:08:44,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:44,475 INFO L124 PetriNetUnfolderBase]: 258/718 cut-off events. [2025-02-08 14:08:44,475 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-02-08 14:08:44,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1241 conditions, 718 events. 258/718 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4362 event pairs, 176 based on Foata normal form. 6/564 useless extension candidates. Maximal degree in co-relation 1230. Up to 423 conditions per place. [2025-02-08 14:08:44,481 INFO L140 encePairwiseOnDemand]: 85/95 looper letters, 38 selfloop transitions, 26 changer transitions 0/102 dead transitions. [2025-02-08 14:08:44,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 102 transitions, 475 flow [2025-02-08 14:08:44,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 14:08:44,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 14:08:44,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 560 transitions. [2025-02-08 14:08:44,485 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5894736842105263 [2025-02-08 14:08:44,485 INFO L175 Difference]: Start difference. First operand has 86 places, 84 transitions, 239 flow. Second operand 10 states and 560 transitions. [2025-02-08 14:08:44,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 102 transitions, 475 flow [2025-02-08 14:08:44,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 102 transitions, 415 flow, removed 16 selfloop flow, removed 4 redundant places. [2025-02-08 14:08:44,490 INFO L231 Difference]: Finished difference. Result has 94 places, 102 transitions, 375 flow [2025-02-08 14:08:44,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=375, PETRI_PLACES=94, PETRI_TRANSITIONS=102} [2025-02-08 14:08:44,492 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 3 predicate places. [2025-02-08 14:08:44,493 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 102 transitions, 375 flow [2025-02-08 14:08:44,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 50.166666666666664) internal successors, (602), 12 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:44,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:44,494 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:08:44,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 14:08:44,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:08:44,699 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-08 14:08:44,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:44,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1348457946, now seen corresponding path program 1 times [2025-02-08 14:08:44,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:44,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753750065] [2025-02-08 14:08:44,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:44,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:44,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:08:44,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:08:44,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:44,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:44,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:08:44,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:44,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753750065] [2025-02-08 14:08:44,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753750065] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:08:44,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:08:44,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:08:44,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068261606] [2025-02-08 14:08:44,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:08:44,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:08:44,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:44,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:08:44,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:08:44,818 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 95 [2025-02-08 14:08:44,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 102 transitions, 375 flow. Second operand has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:44,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:44,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 95 [2025-02-08 14:08:44,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:45,011 INFO L124 PetriNetUnfolderBase]: 260/726 cut-off events. [2025-02-08 14:08:45,012 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-02-08 14:08:45,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1269 conditions, 726 events. 260/726 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4430 event pairs, 176 based on Foata normal form. 2/572 useless extension candidates. Maximal degree in co-relation 1256. Up to 443 conditions per place. [2025-02-08 14:08:45,017 INFO L140 encePairwiseOnDemand]: 83/95 looper letters, 64 selfloop transitions, 8 changer transitions 0/108 dead transitions. [2025-02-08 14:08:45,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 108 transitions, 531 flow [2025-02-08 14:08:45,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:08:45,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:08:45,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 248 transitions. [2025-02-08 14:08:45,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6526315789473685 [2025-02-08 14:08:45,021 INFO L175 Difference]: Start difference. First operand has 94 places, 102 transitions, 375 flow. Second operand 4 states and 248 transitions. [2025-02-08 14:08:45,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 108 transitions, 531 flow [2025-02-08 14:08:45,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 108 transitions, 509 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-02-08 14:08:45,027 INFO L231 Difference]: Finished difference. Result has 97 places, 108 transitions, 411 flow [2025-02-08 14:08:45,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=411, PETRI_PLACES=97, PETRI_TRANSITIONS=108} [2025-02-08 14:08:45,030 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 6 predicate places. [2025-02-08 14:08:45,030 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 108 transitions, 411 flow [2025-02-08 14:08:45,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:45,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:45,031 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:08:45,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 14:08:45,031 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-08 14:08:45,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:45,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1082408043, now seen corresponding path program 1 times [2025-02-08 14:08:45,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:45,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849027466] [2025-02-08 14:08:45,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:45,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:45,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 14:08:45,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:08:45,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:45,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:45,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:08:45,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:45,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849027466] [2025-02-08 14:08:45,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849027466] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:08:45,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:08:45,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:08:45,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101842856] [2025-02-08 14:08:45,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:08:45,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:08:45,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:45,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:08:45,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:08:45,171 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 95 [2025-02-08 14:08:45,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 108 transitions, 411 flow. Second operand has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:45,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:45,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 95 [2025-02-08 14:08:45,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:45,351 INFO L124 PetriNetUnfolderBase]: 259/725 cut-off events. [2025-02-08 14:08:45,351 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-02-08 14:08:45,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1279 conditions, 725 events. 259/725 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4392 event pairs, 176 based on Foata normal form. 1/574 useless extension candidates. Maximal degree in co-relation 1263. Up to 439 conditions per place. [2025-02-08 14:08:45,356 INFO L140 encePairwiseOnDemand]: 91/95 looper letters, 64 selfloop transitions, 3 changer transitions 0/107 dead transitions. [2025-02-08 14:08:45,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 107 transitions, 541 flow [2025-02-08 14:08:45,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:08:45,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:08:45,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 237 transitions. [2025-02-08 14:08:45,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6236842105263158 [2025-02-08 14:08:45,358 INFO L175 Difference]: Start difference. First operand has 97 places, 108 transitions, 411 flow. Second operand 4 states and 237 transitions. [2025-02-08 14:08:45,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 107 transitions, 541 flow [2025-02-08 14:08:45,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 107 transitions, 535 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:08:45,362 INFO L231 Difference]: Finished difference. Result has 99 places, 107 transitions, 407 flow [2025-02-08 14:08:45,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=407, PETRI_PLACES=99, PETRI_TRANSITIONS=107} [2025-02-08 14:08:45,363 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 8 predicate places. [2025-02-08 14:08:45,363 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 107 transitions, 407 flow [2025-02-08 14:08:45,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:45,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:45,364 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:08:45,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 14:08:45,364 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-08 14:08:45,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:45,364 INFO L85 PathProgramCache]: Analyzing trace with hash 782559384, now seen corresponding path program 1 times [2025-02-08 14:08:45,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:45,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395159232] [2025-02-08 14:08:45,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:45,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:45,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 14:08:45,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 14:08:45,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:45,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:45,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:08:45,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:45,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395159232] [2025-02-08 14:08:45,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395159232] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:08:45,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:08:45,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:08:45,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842979] [2025-02-08 14:08:45,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:08:45,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:08:45,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:45,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:08:45,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:08:45,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 95 [2025-02-08 14:08:45,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 107 transitions, 407 flow. Second operand has 4 states, 4 states have (on average 51.5) internal successors, (206), 4 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:45,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:45,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 95 [2025-02-08 14:08:45,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:45,646 INFO L124 PetriNetUnfolderBase]: 258/724 cut-off events. [2025-02-08 14:08:45,646 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-02-08 14:08:45,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1275 conditions, 724 events. 258/724 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4327 event pairs, 176 based on Foata normal form. 1/573 useless extension candidates. Maximal degree in co-relation 1258. Up to 438 conditions per place. [2025-02-08 14:08:45,651 INFO L140 encePairwiseOnDemand]: 91/95 looper letters, 63 selfloop transitions, 3 changer transitions 0/106 dead transitions. [2025-02-08 14:08:45,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 106 transitions, 535 flow [2025-02-08 14:08:45,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:08:45,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:08:45,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 237 transitions. [2025-02-08 14:08:45,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6236842105263158 [2025-02-08 14:08:45,652 INFO L175 Difference]: Start difference. First operand has 99 places, 107 transitions, 407 flow. Second operand 4 states and 237 transitions. [2025-02-08 14:08:45,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 106 transitions, 535 flow [2025-02-08 14:08:45,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 106 transitions, 531 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:08:45,656 INFO L231 Difference]: Finished difference. Result has 100 places, 106 transitions, 405 flow [2025-02-08 14:08:45,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=405, PETRI_PLACES=100, PETRI_TRANSITIONS=106} [2025-02-08 14:08:45,658 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 9 predicate places. [2025-02-08 14:08:45,658 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 106 transitions, 405 flow [2025-02-08 14:08:45,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.5) internal successors, (206), 4 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:45,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:45,658 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2025-02-08 14:08:45,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 14:08:45,659 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-08 14:08:45,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:45,659 INFO L85 PathProgramCache]: Analyzing trace with hash 959677223, now seen corresponding path program 2 times [2025-02-08 14:08:45,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:45,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717716113] [2025-02-08 14:08:45,660 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:08:45,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:45,669 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-08 14:08:45,673 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-02-08 14:08:45,674 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:08:45,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:45,732 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 14:08:45,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:45,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717716113] [2025-02-08 14:08:45,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717716113] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:08:45,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820586524] [2025-02-08 14:08:45,732 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:08:45,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:08:45,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:08:45,735 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:08:45,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 14:08:45,799 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-08 14:08:45,812 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-02-08 14:08:45,812 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:08:45,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:45,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:08:45,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:08:45,846 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 14:08:45,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:08:45,885 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 14:08:45,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820586524] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:08:45,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:08:45,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-02-08 14:08:45,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571889627] [2025-02-08 14:08:45,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:08:45,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:08:45,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:45,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:08:45,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:08:45,913 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 95 [2025-02-08 14:08:45,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 106 transitions, 405 flow. Second operand has 5 states, 5 states have (on average 46.6) internal successors, (233), 5 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:45,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:45,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 95 [2025-02-08 14:08:45,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:46,079 INFO L124 PetriNetUnfolderBase]: 258/722 cut-off events. [2025-02-08 14:08:46,079 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-02-08 14:08:46,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1266 conditions, 722 events. 258/722 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4329 event pairs, 176 based on Foata normal form. 2/572 useless extension candidates. Maximal degree in co-relation 1249. Up to 418 conditions per place. [2025-02-08 14:08:46,084 INFO L140 encePairwiseOnDemand]: 84/95 looper letters, 35 selfloop transitions, 31 changer transitions 0/104 dead transitions. [2025-02-08 14:08:46,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 104 transitions, 517 flow [2025-02-08 14:08:46,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:08:46,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:08:46,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 265 transitions. [2025-02-08 14:08:46,086 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5578947368421052 [2025-02-08 14:08:46,086 INFO L175 Difference]: Start difference. First operand has 100 places, 106 transitions, 405 flow. Second operand 5 states and 265 transitions. [2025-02-08 14:08:46,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 104 transitions, 517 flow [2025-02-08 14:08:46,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 104 transitions, 493 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-02-08 14:08:46,090 INFO L231 Difference]: Finished difference. Result has 96 places, 104 transitions, 423 flow [2025-02-08 14:08:46,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=423, PETRI_PLACES=96, PETRI_TRANSITIONS=104} [2025-02-08 14:08:46,091 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 5 predicate places. [2025-02-08 14:08:46,091 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 104 transitions, 423 flow [2025-02-08 14:08:46,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.6) internal successors, (233), 5 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:46,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:46,092 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:08:46,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 14:08:46,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:08:46,292 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-08 14:08:46,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:46,293 INFO L85 PathProgramCache]: Analyzing trace with hash -433091125, now seen corresponding path program 1 times [2025-02-08 14:08:46,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:46,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619833899] [2025-02-08 14:08:46,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:46,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:46,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:08:46,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:08:46,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:46,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:46,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:08:46,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:46,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619833899] [2025-02-08 14:08:46,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619833899] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:08:46,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061487854] [2025-02-08 14:08:46,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:46,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:08:46,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:08:46,393 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:08:46,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 14:08:46,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:08:46,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:08:46,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:46,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:46,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 14:08:46,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:08:46,618 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:08:46,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:08:46,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:08:46,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061487854] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:08:46,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:08:46,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-02-08 14:08:46,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809010775] [2025-02-08 14:08:46,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:08:46,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 14:08:46,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:46,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 14:08:46,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-02-08 14:08:47,019 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 95 [2025-02-08 14:08:47,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 104 transitions, 423 flow. Second operand has 19 states, 19 states have (on average 42.8421052631579) internal successors, (814), 19 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:47,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:47,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 95 [2025-02-08 14:08:47,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:47,683 INFO L124 PetriNetUnfolderBase]: 510/1414 cut-off events. [2025-02-08 14:08:47,683 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2025-02-08 14:08:47,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2459 conditions, 1414 events. 510/1414 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10218 event pairs, 352 based on Foata normal form. 3/1107 useless extension candidates. Maximal degree in co-relation 2446. Up to 418 conditions per place. [2025-02-08 14:08:47,692 INFO L140 encePairwiseOnDemand]: 79/95 looper letters, 70 selfloop transitions, 47 changer transitions 0/151 dead transitions. [2025-02-08 14:08:47,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 151 transitions, 863 flow [2025-02-08 14:08:47,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 14:08:47,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-02-08 14:08:47,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 831 transitions. [2025-02-08 14:08:47,695 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48596491228070177 [2025-02-08 14:08:47,696 INFO L175 Difference]: Start difference. First operand has 96 places, 104 transitions, 423 flow. Second operand 18 states and 831 transitions. [2025-02-08 14:08:47,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 151 transitions, 863 flow [2025-02-08 14:08:47,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 151 transitions, 771 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 14:08:47,701 INFO L231 Difference]: Finished difference. Result has 109 places, 124 transitions, 617 flow [2025-02-08 14:08:47,701 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=617, PETRI_PLACES=109, PETRI_TRANSITIONS=124} [2025-02-08 14:08:47,703 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 18 predicate places. [2025-02-08 14:08:47,703 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 124 transitions, 617 flow [2025-02-08 14:08:47,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 42.8421052631579) internal successors, (814), 19 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:47,704 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:47,704 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:08:47,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 14:08:47,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-08 14:08:47,905 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-08 14:08:47,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:47,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1516037670, now seen corresponding path program 1 times [2025-02-08 14:08:47,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:47,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145842649] [2025-02-08 14:08:47,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:47,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:47,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 14:08:47,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 14:08:47,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:47,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:48,011 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 14:08:48,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:48,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145842649] [2025-02-08 14:08:48,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145842649] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:08:48,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828296663] [2025-02-08 14:08:48,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:48,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:08:48,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:08:48,015 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:08:48,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 14:08:48,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 14:08:48,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 14:08:48,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:48,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:48,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:08:48,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:08:48,138 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 14:08:48,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:08:48,182 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 14:08:48,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828296663] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:08:48,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:08:48,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-08 14:08:48,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338862228] [2025-02-08 14:08:48,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:08:48,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 14:08:48,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:48,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 14:08:48,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-08 14:08:48,207 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 95 [2025-02-08 14:08:48,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 124 transitions, 617 flow. Second operand has 12 states, 12 states have (on average 50.833333333333336) internal successors, (610), 12 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:48,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:48,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 95 [2025-02-08 14:08:48,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:48,500 INFO L124 PetriNetUnfolderBase]: 519/1450 cut-off events. [2025-02-08 14:08:48,500 INFO L125 PetriNetUnfolderBase]: For 224/224 co-relation queries the response was YES. [2025-02-08 14:08:48,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2607 conditions, 1450 events. 519/1450 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10589 event pairs, 352 based on Foata normal form. 9/1159 useless extension candidates. Maximal degree in co-relation 2594. Up to 866 conditions per place. [2025-02-08 14:08:48,510 INFO L140 encePairwiseOnDemand]: 85/95 looper letters, 73 selfloop transitions, 44 changer transitions 0/151 dead transitions. [2025-02-08 14:08:48,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 151 transitions, 1019 flow [2025-02-08 14:08:48,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 14:08:48,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 14:08:48,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 560 transitions. [2025-02-08 14:08:48,513 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5894736842105263 [2025-02-08 14:08:48,513 INFO L175 Difference]: Start difference. First operand has 109 places, 124 transitions, 617 flow. Second operand 10 states and 560 transitions. [2025-02-08 14:08:48,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 151 transitions, 1019 flow [2025-02-08 14:08:48,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 151 transitions, 935 flow, removed 25 selfloop flow, removed 4 redundant places. [2025-02-08 14:08:48,518 INFO L231 Difference]: Finished difference. Result has 117 places, 151 transitions, 837 flow [2025-02-08 14:08:48,518 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=837, PETRI_PLACES=117, PETRI_TRANSITIONS=151} [2025-02-08 14:08:48,519 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 26 predicate places. [2025-02-08 14:08:48,519 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 151 transitions, 837 flow [2025-02-08 14:08:48,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 50.833333333333336) internal successors, (610), 12 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:48,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:48,520 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:08:48,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 14:08:48,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-08 14:08:48,724 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-08 14:08:48,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:48,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1894875146, now seen corresponding path program 1 times [2025-02-08 14:08:48,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:48,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74250658] [2025-02-08 14:08:48,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:48,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:48,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 14:08:48,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 14:08:48,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:48,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:48,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:08:48,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:48,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74250658] [2025-02-08 14:08:48,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74250658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:08:48,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:08:48,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:08:48,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409978404] [2025-02-08 14:08:48,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:08:48,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:08:48,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:48,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:08:48,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:08:48,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 95 [2025-02-08 14:08:48,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 151 transitions, 837 flow. Second operand has 4 states, 4 states have (on average 51.5) internal successors, (206), 4 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:48,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:48,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 95 [2025-02-08 14:08:48,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:49,140 INFO L124 PetriNetUnfolderBase]: 1031/2494 cut-off events. [2025-02-08 14:08:49,140 INFO L125 PetriNetUnfolderBase]: For 255/255 co-relation queries the response was YES. [2025-02-08 14:08:49,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4542 conditions, 2494 events. 1031/2494 cut-off events. For 255/255 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 19530 event pairs, 322 based on Foata normal form. 80/2083 useless extension candidates. Maximal degree in co-relation 4526. Up to 792 conditions per place. [2025-02-08 14:08:49,156 INFO L140 encePairwiseOnDemand]: 88/95 looper letters, 142 selfloop transitions, 4 changer transitions 0/176 dead transitions. [2025-02-08 14:08:49,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 176 transitions, 1181 flow [2025-02-08 14:08:49,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:08:49,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:08:49,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 260 transitions. [2025-02-08 14:08:49,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6842105263157895 [2025-02-08 14:08:49,158 INFO L175 Difference]: Start difference. First operand has 117 places, 151 transitions, 837 flow. Second operand 4 states and 260 transitions. [2025-02-08 14:08:49,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 176 transitions, 1181 flow [2025-02-08 14:08:49,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 176 transitions, 1143 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-02-08 14:08:49,165 INFO L231 Difference]: Finished difference. Result has 120 places, 152 transitions, 825 flow [2025-02-08 14:08:49,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=825, PETRI_PLACES=120, PETRI_TRANSITIONS=152} [2025-02-08 14:08:49,166 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 29 predicate places. [2025-02-08 14:08:49,166 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 152 transitions, 825 flow [2025-02-08 14:08:49,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.5) internal successors, (206), 4 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:49,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:49,167 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:08:49,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 14:08:49,167 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-08 14:08:49,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:49,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1388411731, now seen corresponding path program 1 times [2025-02-08 14:08:49,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:49,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533687710] [2025-02-08 14:08:49,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:49,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:49,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 14:08:49,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 14:08:49,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:49,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:49,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:08:49,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:49,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533687710] [2025-02-08 14:08:49,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533687710] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:08:49,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:08:49,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:08:49,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299741317] [2025-02-08 14:08:49,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:08:49,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:08:49,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:49,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:08:49,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:08:49,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 95 [2025-02-08 14:08:49,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 152 transitions, 825 flow. Second operand has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:49,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:49,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 95 [2025-02-08 14:08:49,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:49,521 INFO L124 PetriNetUnfolderBase]: 671/1942 cut-off events. [2025-02-08 14:08:49,522 INFO L125 PetriNetUnfolderBase]: For 472/520 co-relation queries the response was YES. [2025-02-08 14:08:49,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3634 conditions, 1942 events. 671/1942 cut-off events. For 472/520 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 15545 event pairs, 510 based on Foata normal form. 28/1625 useless extension candidates. Maximal degree in co-relation 3615. Up to 1157 conditions per place. [2025-02-08 14:08:49,535 INFO L140 encePairwiseOnDemand]: 91/95 looper letters, 109 selfloop transitions, 5 changer transitions 0/150 dead transitions. [2025-02-08 14:08:49,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 150 transitions, 1042 flow [2025-02-08 14:08:49,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:08:49,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:08:49,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 237 transitions. [2025-02-08 14:08:49,537 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6236842105263158 [2025-02-08 14:08:49,537 INFO L175 Difference]: Start difference. First operand has 120 places, 152 transitions, 825 flow. Second operand 4 states and 237 transitions. [2025-02-08 14:08:49,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 150 transitions, 1042 flow [2025-02-08 14:08:49,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 150 transitions, 1042 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:08:49,542 INFO L231 Difference]: Finished difference. Result has 123 places, 150 transitions, 824 flow [2025-02-08 14:08:49,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=824, PETRI_PLACES=123, PETRI_TRANSITIONS=150} [2025-02-08 14:08:49,543 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 32 predicate places. [2025-02-08 14:08:49,543 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 150 transitions, 824 flow [2025-02-08 14:08:49,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:49,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:49,544 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:08:49,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 14:08:49,544 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-08 14:08:49,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:49,545 INFO L85 PathProgramCache]: Analyzing trace with hash 2051223806, now seen corresponding path program 1 times [2025-02-08 14:08:49,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:49,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298574078] [2025-02-08 14:08:49,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:49,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:49,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 14:08:49,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 14:08:49,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:49,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:49,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:08:49,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:49,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298574078] [2025-02-08 14:08:49,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298574078] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:08:49,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097652294] [2025-02-08 14:08:49,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:49,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:08:49,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:08:49,796 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:08:49,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 14:08:49,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 14:08:49,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 14:08:49,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:49,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:49,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:08:49,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:08:49,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:08:49,941 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 14:08:49,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097652294] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:08:49,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 14:08:49,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-08 14:08:49,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308236800] [2025-02-08 14:08:49,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:08:49,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:08:49,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:49,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:08:49,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 14:08:49,952 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 95 [2025-02-08 14:08:49,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 150 transitions, 824 flow. Second operand has 4 states, 4 states have (on average 53.5) internal successors, (214), 4 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:49,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:49,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 95 [2025-02-08 14:08:49,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:50,208 INFO L124 PetriNetUnfolderBase]: 669/1940 cut-off events. [2025-02-08 14:08:50,208 INFO L125 PetriNetUnfolderBase]: For 482/530 co-relation queries the response was YES. [2025-02-08 14:08:50,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3632 conditions, 1940 events. 669/1940 cut-off events. For 482/530 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 15393 event pairs, 510 based on Foata normal form. 28/1623 useless extension candidates. Maximal degree in co-relation 3611. Up to 1155 conditions per place. [2025-02-08 14:08:50,225 INFO L140 encePairwiseOnDemand]: 91/95 looper letters, 107 selfloop transitions, 5 changer transitions 0/148 dead transitions. [2025-02-08 14:08:50,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 148 transitions, 1037 flow [2025-02-08 14:08:50,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:08:50,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:08:50,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 237 transitions. [2025-02-08 14:08:50,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6236842105263158 [2025-02-08 14:08:50,226 INFO L175 Difference]: Start difference. First operand has 123 places, 150 transitions, 824 flow. Second operand 4 states and 237 transitions. [2025-02-08 14:08:50,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 148 transitions, 1037 flow [2025-02-08 14:08:50,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 148 transitions, 1031 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:08:50,231 INFO L231 Difference]: Finished difference. Result has 124 places, 148 transitions, 817 flow [2025-02-08 14:08:50,232 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=817, PETRI_PLACES=124, PETRI_TRANSITIONS=148} [2025-02-08 14:08:50,233 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 33 predicate places. [2025-02-08 14:08:50,233 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 148 transitions, 817 flow [2025-02-08 14:08:50,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.5) internal successors, (214), 4 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:50,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:50,233 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:08:50,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 14:08:50,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-08 14:08:50,434 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-08 14:08:50,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:50,434 INFO L85 PathProgramCache]: Analyzing trace with hash -473186185, now seen corresponding path program 1 times [2025-02-08 14:08:50,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:50,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024962227] [2025-02-08 14:08:50,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:50,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:50,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 14:08:50,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 14:08:50,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:50,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:51,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:08:51,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:51,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024962227] [2025-02-08 14:08:51,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024962227] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:08:51,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834279242] [2025-02-08 14:08:51,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:51,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:08:51,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:08:51,018 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:08:51,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 14:08:51,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 14:08:51,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 14:08:51,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:51,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:51,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-08 14:08:51,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:08:51,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 14:08:51,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 14:08:51,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:08:51,359 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:08:51,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-02-08 14:08:51,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2025-02-08 14:08:51,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:08:51,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834279242] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:08:51,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:08:51,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2025-02-08 14:08:51,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49895653] [2025-02-08 14:08:51,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:08:51,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 14:08:51,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:51,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 14:08:51,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-02-08 14:08:51,731 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 95 [2025-02-08 14:08:51,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 148 transitions, 817 flow. Second operand has 17 states, 17 states have (on average 45.05882352941177) internal successors, (766), 17 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:51,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:51,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 95 [2025-02-08 14:08:51,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:52,893 INFO L124 PetriNetUnfolderBase]: 2575/6794 cut-off events. [2025-02-08 14:08:52,894 INFO L125 PetriNetUnfolderBase]: For 1372/1416 co-relation queries the response was YES. [2025-02-08 14:08:52,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12872 conditions, 6794 events. 2575/6794 cut-off events. For 1372/1416 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 65598 event pairs, 694 based on Foata normal form. 44/5899 useless extension candidates. Maximal degree in co-relation 12851. Up to 970 conditions per place. [2025-02-08 14:08:52,938 INFO L140 encePairwiseOnDemand]: 83/95 looper letters, 280 selfloop transitions, 39 changer transitions 0/353 dead transitions. [2025-02-08 14:08:52,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 353 transitions, 2372 flow [2025-02-08 14:08:52,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 14:08:52,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-08 14:08:52,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 801 transitions. [2025-02-08 14:08:52,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5621052631578948 [2025-02-08 14:08:52,942 INFO L175 Difference]: Start difference. First operand has 124 places, 148 transitions, 817 flow. Second operand 15 states and 801 transitions. [2025-02-08 14:08:52,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 353 transitions, 2372 flow [2025-02-08 14:08:52,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 353 transitions, 2358 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:08:52,960 INFO L231 Difference]: Finished difference. Result has 139 places, 155 transitions, 960 flow [2025-02-08 14:08:52,961 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=960, PETRI_PLACES=139, PETRI_TRANSITIONS=155} [2025-02-08 14:08:52,961 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 48 predicate places. [2025-02-08 14:08:52,961 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 155 transitions, 960 flow [2025-02-08 14:08:52,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 45.05882352941177) internal successors, (766), 17 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:52,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:52,962 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:08:52,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 14:08:53,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:08:53,166 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-08 14:08:53,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:53,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1783899708, now seen corresponding path program 1 times [2025-02-08 14:08:53,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:53,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838291599] [2025-02-08 14:08:53,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:53,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:53,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 14:08:53,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 14:08:53,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:53,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:53,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:08:53,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:53,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838291599] [2025-02-08 14:08:53,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838291599] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:08:53,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595825607] [2025-02-08 14:08:53,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:53,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:08:53,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:08:53,628 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:08:53,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 14:08:53,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 14:08:53,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 14:08:53,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:53,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:53,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-08 14:08:53,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:08:53,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-08 14:08:54,149 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 14:08:54,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2025-02-08 14:08:54,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:08:54,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:08:54,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-02-08 14:08:54,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2025-02-08 14:08:54,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:08:54,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595825607] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:08:54,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:08:54,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2025-02-08 14:08:54,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056640750] [2025-02-08 14:08:54,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:08:54,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 14:08:54,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:54,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 14:08:54,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-02-08 14:08:54,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 95 [2025-02-08 14:08:54,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 155 transitions, 960 flow. Second operand has 17 states, 17 states have (on average 43.1764705882353) internal successors, (734), 17 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:54,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:54,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 95 [2025-02-08 14:08:54,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:55,869 INFO L124 PetriNetUnfolderBase]: 3075/7314 cut-off events. [2025-02-08 14:08:55,869 INFO L125 PetriNetUnfolderBase]: For 2645/2689 co-relation queries the response was YES. [2025-02-08 14:08:55,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14934 conditions, 7314 events. 3075/7314 cut-off events. For 2645/2689 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 67145 event pairs, 930 based on Foata normal form. 124/6495 useless extension candidates. Maximal degree in co-relation 14910. Up to 1318 conditions per place. [2025-02-08 14:08:55,913 INFO L140 encePairwiseOnDemand]: 83/95 looper letters, 282 selfloop transitions, 40 changer transitions 0/353 dead transitions. [2025-02-08 14:08:55,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 353 transitions, 2488 flow [2025-02-08 14:08:55,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 14:08:55,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-08 14:08:55,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 770 transitions. [2025-02-08 14:08:55,916 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5403508771929825 [2025-02-08 14:08:55,916 INFO L175 Difference]: Start difference. First operand has 139 places, 155 transitions, 960 flow. Second operand 15 states and 770 transitions. [2025-02-08 14:08:55,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 353 transitions, 2488 flow [2025-02-08 14:08:55,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 353 transitions, 2473 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 14:08:55,930 INFO L231 Difference]: Finished difference. Result has 150 places, 158 transitions, 1064 flow [2025-02-08 14:08:55,931 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1064, PETRI_PLACES=150, PETRI_TRANSITIONS=158} [2025-02-08 14:08:55,931 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 59 predicate places. [2025-02-08 14:08:55,931 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 158 transitions, 1064 flow [2025-02-08 14:08:55,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 43.1764705882353) internal successors, (734), 17 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:55,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:55,932 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:08:55,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 14:08:56,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-08 14:08:56,133 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-08 14:08:56,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:56,133 INFO L85 PathProgramCache]: Analyzing trace with hash 116007199, now seen corresponding path program 1 times [2025-02-08 14:08:56,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:56,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24393491] [2025-02-08 14:08:56,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:56,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:56,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 14:08:56,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 14:08:56,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:56,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:56,199 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 14:08:56,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:56,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24393491] [2025-02-08 14:08:56,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24393491] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:08:56,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:08:56,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:08:56,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727485933] [2025-02-08 14:08:56,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:08:56,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:08:56,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:56,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:08:56,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:08:56,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 95 [2025-02-08 14:08:56,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 158 transitions, 1064 flow. Second operand has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:56,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:56,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 95 [2025-02-08 14:08:56,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:57,330 INFO L124 PetriNetUnfolderBase]: 4345/10594 cut-off events. [2025-02-08 14:08:57,330 INFO L125 PetriNetUnfolderBase]: For 5153/5323 co-relation queries the response was YES. [2025-02-08 14:08:57,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21875 conditions, 10594 events. 4345/10594 cut-off events. For 5153/5323 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 107193 event pairs, 1760 based on Foata normal form. 474/9467 useless extension candidates. Maximal degree in co-relation 21849. Up to 3576 conditions per place. [2025-02-08 14:08:57,379 INFO L140 encePairwiseOnDemand]: 88/95 looper letters, 154 selfloop transitions, 4 changer transitions 0/193 dead transitions. [2025-02-08 14:08:57,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 193 transitions, 1550 flow [2025-02-08 14:08:57,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:08:57,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:08:57,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 258 transitions. [2025-02-08 14:08:57,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6789473684210526 [2025-02-08 14:08:57,380 INFO L175 Difference]: Start difference. First operand has 150 places, 158 transitions, 1064 flow. Second operand 4 states and 258 transitions. [2025-02-08 14:08:57,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 193 transitions, 1550 flow [2025-02-08 14:08:57,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 193 transitions, 1489 flow, removed 2 selfloop flow, removed 10 redundant places. [2025-02-08 14:08:57,399 INFO L231 Difference]: Finished difference. Result has 145 places, 159 transitions, 1039 flow [2025-02-08 14:08:57,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=1011, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1039, PETRI_PLACES=145, PETRI_TRANSITIONS=159} [2025-02-08 14:08:57,400 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 54 predicate places. [2025-02-08 14:08:57,400 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 159 transitions, 1039 flow [2025-02-08 14:08:57,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:57,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:57,400 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:08:57,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 14:08:57,401 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-08 14:08:57,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:57,401 INFO L85 PathProgramCache]: Analyzing trace with hash 613367697, now seen corresponding path program 2 times [2025-02-08 14:08:57,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:57,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420835339] [2025-02-08 14:08:57,401 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:08:57,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:57,411 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-08 14:08:57,416 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 33 statements. [2025-02-08 14:08:57,417 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:08:57,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:57,464 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-08 14:08:57,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:57,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420835339] [2025-02-08 14:08:57,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420835339] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:08:57,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082765050] [2025-02-08 14:08:57,464 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:08:57,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:08:57,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:08:57,467 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:08:57,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 14:08:57,539 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-08 14:08:57,554 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 33 statements. [2025-02-08 14:08:57,555 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:08:57,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:57,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:08:57,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:08:57,582 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-08 14:08:57,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:08:57,603 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-08 14:08:57,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082765050] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:08:57,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:08:57,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-02-08 14:08:57,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974533572] [2025-02-08 14:08:57,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:08:57,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:08:57,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:57,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:08:57,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:08:57,629 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 95 [2025-02-08 14:08:57,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 159 transitions, 1039 flow. Second operand has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:57,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:57,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 95 [2025-02-08 14:08:57,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:58,509 INFO L124 PetriNetUnfolderBase]: 3053/8955 cut-off events. [2025-02-08 14:08:58,509 INFO L125 PetriNetUnfolderBase]: For 4135/4411 co-relation queries the response was YES. [2025-02-08 14:08:58,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18809 conditions, 8955 events. 3053/8955 cut-off events. For 4135/4411 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 96534 event pairs, 2696 based on Foata normal form. 185/8139 useless extension candidates. Maximal degree in co-relation 18783. Up to 5083 conditions per place. [2025-02-08 14:08:58,559 INFO L140 encePairwiseOnDemand]: 84/95 looper letters, 68 selfloop transitions, 50 changer transitions 0/157 dead transitions. [2025-02-08 14:08:58,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 157 transitions, 1255 flow [2025-02-08 14:08:58,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:08:58,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:08:58,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 265 transitions. [2025-02-08 14:08:58,561 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5578947368421052 [2025-02-08 14:08:58,561 INFO L175 Difference]: Start difference. First operand has 145 places, 159 transitions, 1039 flow. Second operand 5 states and 265 transitions. [2025-02-08 14:08:58,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 157 transitions, 1255 flow [2025-02-08 14:08:58,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 157 transitions, 1223 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-02-08 14:08:58,583 INFO L231 Difference]: Finished difference. Result has 143 places, 157 transitions, 1087 flow [2025-02-08 14:08:58,584 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=987, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1087, PETRI_PLACES=143, PETRI_TRANSITIONS=157} [2025-02-08 14:08:58,584 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 52 predicate places. [2025-02-08 14:08:58,584 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 157 transitions, 1087 flow [2025-02-08 14:08:58,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:58,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:58,585 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:08:58,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 14:08:58,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:08:58,785 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-08 14:08:58,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:58,786 INFO L85 PathProgramCache]: Analyzing trace with hash 533683801, now seen corresponding path program 1 times [2025-02-08 14:08:58,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:58,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34690175] [2025-02-08 14:08:58,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:58,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:58,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 14:08:58,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 14:08:58,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:58,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:59,347 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:08:59,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:59,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34690175] [2025-02-08 14:08:59,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34690175] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:08:59,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493774850] [2025-02-08 14:08:59,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:59,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:08:59,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:08:59,349 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:08:59,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 14:08:59,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 14:08:59,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 14:08:59,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:59,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:59,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-08 14:08:59,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:08:59,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 14:08:59,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 14:08:59,613 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 14:08:59,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 14:08:59,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-08 14:08:59,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-08 14:08:59,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:08:59,784 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:09:00,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:09:00,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2025-02-08 14:09:00,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:09:00,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 39 [2025-02-08 14:09:00,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2025-02-08 14:09:00,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:09:00,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493774850] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:09:00,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:09:00,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2025-02-08 14:09:00,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930512783] [2025-02-08 14:09:00,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:09:00,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-08 14:09:00,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:00,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-08 14:09:00,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=500, Unknown=8, NotChecked=0, Total=600 [2025-02-08 14:09:00,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 95 [2025-02-08 14:09:00,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 157 transitions, 1087 flow. Second operand has 25 states, 25 states have (on average 33.04) internal successors, (826), 25 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:00,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:00,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 95 [2025-02-08 14:09:00,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:03,966 INFO L124 PetriNetUnfolderBase]: 8862/17645 cut-off events. [2025-02-08 14:09:03,966 INFO L125 PetriNetUnfolderBase]: For 8180/8943 co-relation queries the response was YES. [2025-02-08 14:09:04,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41837 conditions, 17645 events. 8862/17645 cut-off events. For 8180/8943 co-relation queries the response was YES. Maximal size of possible extension queue 857. Compared 165574 event pairs, 1819 based on Foata normal form. 565/16610 useless extension candidates. Maximal degree in co-relation 41813. Up to 2774 conditions per place. [2025-02-08 14:09:04,044 INFO L140 encePairwiseOnDemand]: 78/95 looper letters, 368 selfloop transitions, 67 changer transitions 0/454 dead transitions. [2025-02-08 14:09:04,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 454 transitions, 3235 flow [2025-02-08 14:09:04,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-08 14:09:04,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-02-08 14:09:04,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1181 transitions. [2025-02-08 14:09:04,047 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42867513611615243 [2025-02-08 14:09:04,047 INFO L175 Difference]: Start difference. First operand has 143 places, 157 transitions, 1087 flow. Second operand 29 states and 1181 transitions. [2025-02-08 14:09:04,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 454 transitions, 3235 flow [2025-02-08 14:09:04,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 454 transitions, 3075 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 14:09:04,102 INFO L231 Difference]: Finished difference. Result has 175 places, 191 transitions, 1484 flow [2025-02-08 14:09:04,102 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=987, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=1484, PETRI_PLACES=175, PETRI_TRANSITIONS=191} [2025-02-08 14:09:04,103 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 84 predicate places. [2025-02-08 14:09:04,103 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 191 transitions, 1484 flow [2025-02-08 14:09:04,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 33.04) internal successors, (826), 25 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:04,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:04,103 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:04,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-08 14:09:04,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:04,304 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-08 14:09:04,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:04,305 INFO L85 PathProgramCache]: Analyzing trace with hash -698743219, now seen corresponding path program 1 times [2025-02-08 14:09:04,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:04,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984270987] [2025-02-08 14:09:04,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:04,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:04,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 14:09:04,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 14:09:04,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:04,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:04,884 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:09:04,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:04,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984270987] [2025-02-08 14:09:04,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984270987] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:09:04,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496636795] [2025-02-08 14:09:04,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:04,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:04,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:04,887 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:09:04,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 14:09:04,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 14:09:05,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 14:09:05,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:05,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:05,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-08 14:09:05,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:09:05,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 14:09:05,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-08 14:09:05,257 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 14:09:05,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 14:09:05,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-08 14:09:05,609 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 14:09:05,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2025-02-08 14:09:05,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:09:05,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:09:05,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:09:05,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-02-08 14:09:05,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:09:05,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 33 [2025-02-08 14:09:05,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-02-08 14:09:05,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:09:05,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496636795] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:09:05,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:09:05,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-02-08 14:09:05,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370930001] [2025-02-08 14:09:05,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:09:05,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 14:09:05,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:05,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 14:09:05,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=420, Unknown=1, NotChecked=0, Total=506 [2025-02-08 14:09:05,955 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 95 [2025-02-08 14:09:05,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 191 transitions, 1484 flow. Second operand has 23 states, 23 states have (on average 35.391304347826086) internal successors, (814), 23 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:05,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:05,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 95 [2025-02-08 14:09:05,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:06,755 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~id_0~0 4) c_~get_2~0.offset))) (and (<= 0 c_~id_0~0) (forall ((v_ArrVal_398 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_398) c_~get_2~0.base) .cse0) 9223372039002259456)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_121| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_121|) 0)) (forall ((v_ArrVal_398 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_121| v_ArrVal_398) c_~get_2~0.base) .cse0) 9223372039002259456)))))) is different from false [2025-02-08 14:09:09,087 INFO L124 PetriNetUnfolderBase]: 9819/19887 cut-off events. [2025-02-08 14:09:09,087 INFO L125 PetriNetUnfolderBase]: For 19837/20296 co-relation queries the response was YES. [2025-02-08 14:09:09,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49705 conditions, 19887 events. 9819/19887 cut-off events. For 19837/20296 co-relation queries the response was YES. Maximal size of possible extension queue 973. Compared 192057 event pairs, 2316 based on Foata normal form. 198/17992 useless extension candidates. Maximal degree in co-relation 49673. Up to 4004 conditions per place. [2025-02-08 14:09:09,251 INFO L140 encePairwiseOnDemand]: 81/95 looper letters, 303 selfloop transitions, 54 changer transitions 0/387 dead transitions. [2025-02-08 14:09:09,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 387 transitions, 3115 flow [2025-02-08 14:09:09,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-08 14:09:09,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-08 14:09:09,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 925 transitions. [2025-02-08 14:09:09,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44258373205741625 [2025-02-08 14:09:09,254 INFO L175 Difference]: Start difference. First operand has 175 places, 191 transitions, 1484 flow. Second operand 22 states and 925 transitions. [2025-02-08 14:09:09,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 387 transitions, 3115 flow [2025-02-08 14:09:09,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 387 transitions, 2993 flow, removed 17 selfloop flow, removed 8 redundant places. [2025-02-08 14:09:09,552 INFO L231 Difference]: Finished difference. Result has 191 places, 198 transitions, 1567 flow [2025-02-08 14:09:09,552 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=1393, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1567, PETRI_PLACES=191, PETRI_TRANSITIONS=198} [2025-02-08 14:09:09,553 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 100 predicate places. [2025-02-08 14:09:09,553 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 198 transitions, 1567 flow [2025-02-08 14:09:09,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 35.391304347826086) internal successors, (814), 23 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:09,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:09,553 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:09,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-08 14:09:09,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-02-08 14:09:09,758 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-08 14:09:09,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:09,758 INFO L85 PathProgramCache]: Analyzing trace with hash -635670457, now seen corresponding path program 1 times [2025-02-08 14:09:09,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:09,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174974952] [2025-02-08 14:09:09,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:09,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:09,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 14:09:09,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 14:09:09,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:09,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:10,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:09:10,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:10,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174974952] [2025-02-08 14:09:10,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174974952] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:09:10,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41178267] [2025-02-08 14:09:10,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:10,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:10,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:10,250 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:09:10,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 14:09:10,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 14:09:10,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 14:09:10,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:10,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:10,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-08 14:09:10,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:09:10,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 14:09:10,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-08 14:09:10,563 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 14:09:10,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 14:09:10,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-08 14:09:10,778 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 14:09:10,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2025-02-08 14:09:10,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:09:10,824 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:09:10,884 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_433 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_433) c_~get_2~0.base) (+ (* c_~id_0~0 4) c_~get_2~0.offset)) 2147483648)) is different from false [2025-02-08 14:09:10,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:09:10,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-02-08 14:09:11,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:09:11,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 33 [2025-02-08 14:09:11,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-02-08 14:09:11,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2025-02-08 14:09:11,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41178267] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:09:11,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:09:11,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2025-02-08 14:09:11,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430810940] [2025-02-08 14:09:11,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:09:11,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-08 14:09:11,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:11,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-08 14:09:11,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=509, Unknown=1, NotChecked=46, Total=650 [2025-02-08 14:09:11,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 95 [2025-02-08 14:09:11,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 198 transitions, 1567 flow. Second operand has 26 states, 26 states have (on average 33.0) internal successors, (858), 26 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:11,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:11,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 95 [2025-02-08 14:09:11,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:15,195 INFO L124 PetriNetUnfolderBase]: 9939/19546 cut-off events. [2025-02-08 14:09:15,195 INFO L125 PetriNetUnfolderBase]: For 16558/17751 co-relation queries the response was YES. [2025-02-08 14:09:15,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51223 conditions, 19546 events. 9939/19546 cut-off events. For 16558/17751 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 183539 event pairs, 2610 based on Foata normal form. 480/18832 useless extension candidates. Maximal degree in co-relation 51189. Up to 3632 conditions per place. [2025-02-08 14:09:15,336 INFO L140 encePairwiseOnDemand]: 75/95 looper letters, 362 selfloop transitions, 82 changer transitions 8/476 dead transitions. [2025-02-08 14:09:15,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 476 transitions, 3582 flow [2025-02-08 14:09:15,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-08 14:09:15,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-02-08 14:09:15,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1252 transitions. [2025-02-08 14:09:15,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42512733446519524 [2025-02-08 14:09:15,339 INFO L175 Difference]: Start difference. First operand has 191 places, 198 transitions, 1567 flow. Second operand 31 states and 1252 transitions. [2025-02-08 14:09:15,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 476 transitions, 3582 flow [2025-02-08 14:09:15,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 476 transitions, 3528 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-02-08 14:09:15,448 INFO L231 Difference]: Finished difference. Result has 215 places, 222 transitions, 1854 flow [2025-02-08 14:09:15,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=1513, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=1854, PETRI_PLACES=215, PETRI_TRANSITIONS=222} [2025-02-08 14:09:15,449 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 124 predicate places. [2025-02-08 14:09:15,450 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 222 transitions, 1854 flow [2025-02-08 14:09:15,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 33.0) internal successors, (858), 26 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:15,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:15,450 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:15,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-08 14:09:15,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:15,652 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-08 14:09:15,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:15,652 INFO L85 PathProgramCache]: Analyzing trace with hash -186233149, now seen corresponding path program 1 times [2025-02-08 14:09:15,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:15,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681588126] [2025-02-08 14:09:15,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:15,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:15,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 14:09:15,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 14:09:15,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:15,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:16,236 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:09:16,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:16,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681588126] [2025-02-08 14:09:16,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681588126] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:09:16,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618755119] [2025-02-08 14:09:16,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:16,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:16,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:16,239 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:09:16,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-08 14:09:16,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 14:09:16,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 14:09:16,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:16,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:16,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-08 14:09:16,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:09:16,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 14:09:16,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 14:09:16,527 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 14:09:16,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 14:09:16,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-08 14:09:16,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-08 14:09:16,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:09:16,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:09:16,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:09:16,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2025-02-08 14:09:16,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:09:16,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 39 [2025-02-08 14:09:16,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2025-02-08 14:09:17,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:09:17,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618755119] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:09:17,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:09:17,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2025-02-08 14:09:17,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933132718] [2025-02-08 14:09:17,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:09:17,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-08 14:09:17,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:17,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-08 14:09:17,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=379, Unknown=6, NotChecked=0, Total=462 [2025-02-08 14:09:17,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 95 [2025-02-08 14:09:17,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 222 transitions, 1854 flow. Second operand has 22 states, 22 states have (on average 35.5) internal successors, (781), 22 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:17,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:17,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 95 [2025-02-08 14:09:17,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:21,026 INFO L124 PetriNetUnfolderBase]: 9879/20009 cut-off events. [2025-02-08 14:09:21,026 INFO L125 PetriNetUnfolderBase]: For 32260/34021 co-relation queries the response was YES. [2025-02-08 14:09:21,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56308 conditions, 20009 events. 9879/20009 cut-off events. For 32260/34021 co-relation queries the response was YES. Maximal size of possible extension queue 1029. Compared 194363 event pairs, 3000 based on Foata normal form. 788/18809 useless extension candidates. Maximal degree in co-relation 56267. Up to 4830 conditions per place. [2025-02-08 14:09:21,193 INFO L140 encePairwiseOnDemand]: 81/95 looper letters, 298 selfloop transitions, 57 changer transitions 0/397 dead transitions. [2025-02-08 14:09:21,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 397 transitions, 3469 flow [2025-02-08 14:09:21,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-08 14:09:21,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-02-08 14:09:21,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 976 transitions. [2025-02-08 14:09:21,196 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4280701754385965 [2025-02-08 14:09:21,196 INFO L175 Difference]: Start difference. First operand has 215 places, 222 transitions, 1854 flow. Second operand 24 states and 976 transitions. [2025-02-08 14:09:21,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 397 transitions, 3469 flow [2025-02-08 14:09:21,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 397 transitions, 3384 flow, removed 4 selfloop flow, removed 14 redundant places. [2025-02-08 14:09:21,390 INFO L231 Difference]: Finished difference. Result has 226 places, 226 transitions, 1939 flow [2025-02-08 14:09:21,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=1765, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1939, PETRI_PLACES=226, PETRI_TRANSITIONS=226} [2025-02-08 14:09:21,390 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 135 predicate places. [2025-02-08 14:09:21,390 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 226 transitions, 1939 flow [2025-02-08 14:09:21,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 35.5) internal successors, (781), 22 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:21,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:21,391 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:21,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-08 14:09:21,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:21,592 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-08 14:09:21,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:21,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1607225152, now seen corresponding path program 1 times [2025-02-08 14:09:21,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:21,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733483572] [2025-02-08 14:09:21,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:21,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:21,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 14:09:21,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 14:09:21,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:21,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:21,687 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 14:09:21,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:21,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733483572] [2025-02-08 14:09:21,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733483572] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:21,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:21,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 14:09:21,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120806117] [2025-02-08 14:09:21,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:21,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:09:21,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:21,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:09:21,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:09:21,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 95 [2025-02-08 14:09:21,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 226 transitions, 1939 flow. Second operand has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:21,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:21,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 95 [2025-02-08 14:09:21,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:23,211 INFO L124 PetriNetUnfolderBase]: 7287/16147 cut-off events. [2025-02-08 14:09:23,211 INFO L125 PetriNetUnfolderBase]: For 20869/21248 co-relation queries the response was YES. [2025-02-08 14:09:23,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46046 conditions, 16147 events. 7287/16147 cut-off events. For 20869/21248 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 161782 event pairs, 3511 based on Foata normal form. 455/15986 useless extension candidates. Maximal degree in co-relation 46002. Up to 6643 conditions per place. [2025-02-08 14:09:23,378 INFO L140 encePairwiseOnDemand]: 88/95 looper letters, 230 selfloop transitions, 29 changer transitions 0/293 dead transitions. [2025-02-08 14:09:23,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 293 transitions, 2757 flow [2025-02-08 14:09:23,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:09:23,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:09:23,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 365 transitions. [2025-02-08 14:09:23,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6403508771929824 [2025-02-08 14:09:23,380 INFO L175 Difference]: Start difference. First operand has 226 places, 226 transitions, 1939 flow. Second operand 6 states and 365 transitions. [2025-02-08 14:09:23,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 293 transitions, 2757 flow [2025-02-08 14:09:23,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 293 transitions, 2584 flow, removed 13 selfloop flow, removed 21 redundant places. [2025-02-08 14:09:23,617 INFO L231 Difference]: Finished difference. Result has 212 places, 223 transitions, 1835 flow [2025-02-08 14:09:23,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=1714, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1835, PETRI_PLACES=212, PETRI_TRANSITIONS=223} [2025-02-08 14:09:23,618 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 121 predicate places. [2025-02-08 14:09:23,618 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 223 transitions, 1835 flow [2025-02-08 14:09:23,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:23,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:23,618 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:23,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 14:09:23,618 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-08 14:09:23,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:23,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1478259408, now seen corresponding path program 1 times [2025-02-08 14:09:23,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:23,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300347062] [2025-02-08 14:09:23,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:23,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:23,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 14:09:23,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 14:09:23,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:23,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:23,669 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 14:09:23,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:23,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300347062] [2025-02-08 14:09:23,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300347062] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:23,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:23,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:09:23,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91323863] [2025-02-08 14:09:23,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:23,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:09:23,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:23,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:09:23,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:09:23,689 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 95 [2025-02-08 14:09:23,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 223 transitions, 1835 flow. Second operand has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:23,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:23,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 95 [2025-02-08 14:09:23,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:25,154 INFO L124 PetriNetUnfolderBase]: 6278/15961 cut-off events. [2025-02-08 14:09:25,154 INFO L125 PetriNetUnfolderBase]: For 27178/27850 co-relation queries the response was YES. [2025-02-08 14:09:25,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44297 conditions, 15961 events. 6278/15961 cut-off events. For 27178/27850 co-relation queries the response was YES. Maximal size of possible extension queue 847. Compared 174951 event pairs, 2910 based on Foata normal form. 475/15351 useless extension candidates. Maximal degree in co-relation 44256. Up to 5549 conditions per place. [2025-02-08 14:09:25,248 INFO L140 encePairwiseOnDemand]: 91/95 looper letters, 262 selfloop transitions, 6 changer transitions 0/312 dead transitions. [2025-02-08 14:09:25,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 312 transitions, 3023 flow [2025-02-08 14:09:25,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:09:25,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:09:25,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 255 transitions. [2025-02-08 14:09:25,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6710526315789473 [2025-02-08 14:09:25,249 INFO L175 Difference]: Start difference. First operand has 212 places, 223 transitions, 1835 flow. Second operand 4 states and 255 transitions. [2025-02-08 14:09:25,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 312 transitions, 3023 flow [2025-02-08 14:09:25,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 312 transitions, 2958 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:09:25,345 INFO L231 Difference]: Finished difference. Result has 212 places, 220 transitions, 1794 flow [2025-02-08 14:09:25,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=1782, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1794, PETRI_PLACES=212, PETRI_TRANSITIONS=220} [2025-02-08 14:09:25,346 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 121 predicate places. [2025-02-08 14:09:25,346 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 220 transitions, 1794 flow [2025-02-08 14:09:25,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:25,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:25,346 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:25,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 14:09:25,347 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-08 14:09:25,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:25,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1478260401, now seen corresponding path program 1 times [2025-02-08 14:09:25,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:25,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901715014] [2025-02-08 14:09:25,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:25,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:25,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 14:09:25,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 14:09:25,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:25,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:25,717 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:09:25,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:25,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901715014] [2025-02-08 14:09:25,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901715014] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:09:25,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137216524] [2025-02-08 14:09:25,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:25,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:25,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:25,721 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:09:25,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-08 14:09:25,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 14:09:25,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 14:09:25,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:25,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:25,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-08 14:09:25,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:09:25,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-08 14:09:26,122 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 14:09:26,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2025-02-08 14:09:26,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:09:26,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:09:26,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-02-08 14:09:26,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2025-02-08 14:09:26,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:09:26,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137216524] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:09:26,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:09:26,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-02-08 14:09:26,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132313502] [2025-02-08 14:09:26,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:09:26,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 14:09:26,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:26,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 14:09:26,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2025-02-08 14:09:26,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 95 [2025-02-08 14:09:26,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 220 transitions, 1794 flow. Second operand has 19 states, 19 states have (on average 39.36842105263158) internal successors, (748), 19 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:26,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:26,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 95 [2025-02-08 14:09:26,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:28,621 INFO L124 PetriNetUnfolderBase]: 8449/17519 cut-off events. [2025-02-08 14:09:28,622 INFO L125 PetriNetUnfolderBase]: For 29927/31235 co-relation queries the response was YES. [2025-02-08 14:09:28,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50719 conditions, 17519 events. 8449/17519 cut-off events. For 29927/31235 co-relation queries the response was YES. Maximal size of possible extension queue 883. Compared 170001 event pairs, 1986 based on Foata normal form. 402/16543 useless extension candidates. Maximal degree in co-relation 50678. Up to 2819 conditions per place. [2025-02-08 14:09:28,875 INFO L140 encePairwiseOnDemand]: 81/95 looper letters, 679 selfloop transitions, 65 changer transitions 0/785 dead transitions. [2025-02-08 14:09:28,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 785 transitions, 6800 flow [2025-02-08 14:09:28,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-08 14:09:28,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-08 14:09:28,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1055 transitions. [2025-02-08 14:09:28,877 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5047846889952153 [2025-02-08 14:09:28,877 INFO L175 Difference]: Start difference. First operand has 212 places, 220 transitions, 1794 flow. Second operand 22 states and 1055 transitions. [2025-02-08 14:09:28,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 785 transitions, 6800 flow [2025-02-08 14:09:28,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 785 transitions, 6767 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:09:28,986 INFO L231 Difference]: Finished difference. Result has 237 places, 238 transitions, 2074 flow [2025-02-08 14:09:28,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=1783, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2074, PETRI_PLACES=237, PETRI_TRANSITIONS=238} [2025-02-08 14:09:28,986 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 146 predicate places. [2025-02-08 14:09:28,987 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 238 transitions, 2074 flow [2025-02-08 14:09:28,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 39.36842105263158) internal successors, (748), 19 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:28,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:28,987 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:28,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-08 14:09:29,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-02-08 14:09:29,188 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-08 14:09:29,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:29,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1418568742, now seen corresponding path program 1 times [2025-02-08 14:09:29,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:29,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341690196] [2025-02-08 14:09:29,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:29,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:29,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 14:09:29,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 14:09:29,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:29,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:29,559 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:09:29,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:29,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341690196] [2025-02-08 14:09:29,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341690196] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:09:29,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713783281] [2025-02-08 14:09:29,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:29,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:29,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:29,563 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:09:29,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-08 14:09:29,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 14:09:29,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 14:09:29,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:29,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:29,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-08 14:09:29,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:09:29,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-08 14:09:29,950 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 14:09:29,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2025-02-08 14:09:29,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:09:29,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:09:30,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-02-08 14:09:30,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2025-02-08 14:09:30,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:09:30,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713783281] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:09:30,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:09:30,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-02-08 14:09:30,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145620611] [2025-02-08 14:09:30,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:09:30,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 14:09:30,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:30,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 14:09:30,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2025-02-08 14:09:30,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 95 [2025-02-08 14:09:30,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 238 transitions, 2074 flow. Second operand has 20 states, 20 states have (on average 40.2) internal successors, (804), 20 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:30,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:30,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 95 [2025-02-08 14:09:30,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:32,821 INFO L124 PetriNetUnfolderBase]: 7764/16616 cut-off events. [2025-02-08 14:09:32,821 INFO L125 PetriNetUnfolderBase]: For 31960/33146 co-relation queries the response was YES. [2025-02-08 14:09:32,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50814 conditions, 16616 events. 7764/16616 cut-off events. For 31960/33146 co-relation queries the response was YES. Maximal size of possible extension queue 862. Compared 163941 event pairs, 2351 based on Foata normal form. 373/16241 useless extension candidates. Maximal degree in co-relation 50766. Up to 2983 conditions per place. [2025-02-08 14:09:32,959 INFO L140 encePairwiseOnDemand]: 77/95 looper letters, 604 selfloop transitions, 76 changer transitions 116/842 dead transitions. [2025-02-08 14:09:32,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 842 transitions, 7460 flow [2025-02-08 14:09:32,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-08 14:09:32,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-02-08 14:09:32,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1160 transitions. [2025-02-08 14:09:32,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5087719298245614 [2025-02-08 14:09:32,961 INFO L175 Difference]: Start difference. First operand has 237 places, 238 transitions, 2074 flow. Second operand 24 states and 1160 transitions. [2025-02-08 14:09:32,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 842 transitions, 7460 flow [2025-02-08 14:09:33,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 842 transitions, 7412 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-02-08 14:09:33,101 INFO L231 Difference]: Finished difference. Result has 262 places, 258 transitions, 2361 flow [2025-02-08 14:09:33,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=2026, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2361, PETRI_PLACES=262, PETRI_TRANSITIONS=258} [2025-02-08 14:09:33,101 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 171 predicate places. [2025-02-08 14:09:33,101 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 258 transitions, 2361 flow [2025-02-08 14:09:33,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 40.2) internal successors, (804), 20 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:33,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:33,102 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:33,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-02-08 14:09:33,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-08 14:09:33,303 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-08 14:09:33,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:33,303 INFO L85 PathProgramCache]: Analyzing trace with hash 831248279, now seen corresponding path program 2 times [2025-02-08 14:09:33,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:33,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121043263] [2025-02-08 14:09:33,303 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:09:33,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:33,310 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-02-08 14:09:33,317 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 14:09:33,318 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:09:33,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:33,526 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:09:33,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:33,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121043263] [2025-02-08 14:09:33,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121043263] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:09:33,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353465962] [2025-02-08 14:09:33,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:09:33,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:33,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:33,529 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:09:33,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-08 14:09:33,625 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-02-08 14:09:33,659 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 14:09:33,660 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:09:33,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:33,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 14:09:33,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:09:33,812 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:09:33,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:09:33,986 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:09:33,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353465962] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:09:33,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:09:33,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2025-02-08 14:09:33,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533685110] [2025-02-08 14:09:33,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:09:33,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-08 14:09:33,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:33,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-08 14:09:33,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2025-02-08 14:09:34,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 95 [2025-02-08 14:09:34,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 258 transitions, 2361 flow. Second operand has 28 states, 28 states have (on average 42.857142857142854) internal successors, (1200), 28 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:34,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:34,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 95 [2025-02-08 14:09:34,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:36,198 INFO L124 PetriNetUnfolderBase]: 4717/12506 cut-off events. [2025-02-08 14:09:36,198 INFO L125 PetriNetUnfolderBase]: For 30165/30973 co-relation queries the response was YES. [2025-02-08 14:09:36,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41189 conditions, 12506 events. 4717/12506 cut-off events. For 30165/30973 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 129382 event pairs, 4573 based on Foata normal form. 327/12571 useless extension candidates. Maximal degree in co-relation 41133. Up to 3021 conditions per place. [2025-02-08 14:09:36,264 INFO L140 encePairwiseOnDemand]: 85/95 looper letters, 202 selfloop transitions, 138 changer transitions 0/407 dead transitions. [2025-02-08 14:09:36,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 407 transitions, 3902 flow [2025-02-08 14:09:36,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-08 14:09:36,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-02-08 14:09:36,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 934 transitions. [2025-02-08 14:09:36,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49157894736842106 [2025-02-08 14:09:36,266 INFO L175 Difference]: Start difference. First operand has 262 places, 258 transitions, 2361 flow. Second operand 20 states and 934 transitions. [2025-02-08 14:09:36,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 407 transitions, 3902 flow [2025-02-08 14:09:36,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 407 transitions, 3825 flow, removed 4 selfloop flow, removed 8 redundant places. [2025-02-08 14:09:36,470 INFO L231 Difference]: Finished difference. Result has 276 places, 326 transitions, 3034 flow [2025-02-08 14:09:36,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=2284, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3034, PETRI_PLACES=276, PETRI_TRANSITIONS=326} [2025-02-08 14:09:36,471 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 185 predicate places. [2025-02-08 14:09:36,471 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 326 transitions, 3034 flow [2025-02-08 14:09:36,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 42.857142857142854) internal successors, (1200), 28 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:36,472 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:36,472 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:36,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-02-08 14:09:36,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-08 14:09:36,672 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-08 14:09:36,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:36,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1944647894, now seen corresponding path program 1 times [2025-02-08 14:09:36,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:36,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897439586] [2025-02-08 14:09:36,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:36,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:36,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 14:09:36,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 14:09:36,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:36,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:36,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 14:09:36,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:36,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897439586] [2025-02-08 14:09:36,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897439586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:36,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:36,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:09:36,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727197688] [2025-02-08 14:09:36,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:36,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:09:36,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:36,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:09:36,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:09:36,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 95 [2025-02-08 14:09:36,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 326 transitions, 3034 flow. Second operand has 4 states, 4 states have (on average 53.5) internal successors, (214), 4 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:36,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:36,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 95 [2025-02-08 14:09:36,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:38,143 INFO L124 PetriNetUnfolderBase]: 6427/14649 cut-off events. [2025-02-08 14:09:38,143 INFO L125 PetriNetUnfolderBase]: For 33503/34543 co-relation queries the response was YES. [2025-02-08 14:09:38,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48523 conditions, 14649 events. 6427/14649 cut-off events. For 33503/34543 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 141445 event pairs, 3396 based on Foata normal form. 561/14961 useless extension candidates. Maximal degree in co-relation 48464. Up to 6374 conditions per place. [2025-02-08 14:09:38,295 INFO L140 encePairwiseOnDemand]: 91/95 looper letters, 281 selfloop transitions, 11 changer transitions 67/408 dead transitions. [2025-02-08 14:09:38,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 408 transitions, 4314 flow [2025-02-08 14:09:38,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:09:38,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:09:38,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2025-02-08 14:09:38,296 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6657894736842105 [2025-02-08 14:09:38,296 INFO L175 Difference]: Start difference. First operand has 276 places, 326 transitions, 3034 flow. Second operand 4 states and 253 transitions. [2025-02-08 14:09:38,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 408 transitions, 4314 flow [2025-02-08 14:09:38,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 408 transitions, 4173 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-08 14:09:38,543 INFO L231 Difference]: Finished difference. Result has 269 places, 270 transitions, 2448 flow [2025-02-08 14:09:38,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=2815, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2448, PETRI_PLACES=269, PETRI_TRANSITIONS=270} [2025-02-08 14:09:38,544 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 178 predicate places. [2025-02-08 14:09:38,544 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 270 transitions, 2448 flow [2025-02-08 14:09:38,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.5) internal successors, (214), 4 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:38,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:38,545 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:38,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-08 14:09:38,545 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-08 14:09:38,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:38,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1527152294, now seen corresponding path program 1 times [2025-02-08 14:09:38,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:38,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063668488] [2025-02-08 14:09:38,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:38,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:38,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 14:09:38,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 14:09:38,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:38,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:38,586 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 14:09:38,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:38,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063668488] [2025-02-08 14:09:38,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063668488] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:38,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:38,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:09:38,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2959822] [2025-02-08 14:09:38,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:38,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:09:38,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:38,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:09:38,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:09:38,601 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 95 [2025-02-08 14:09:38,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 270 transitions, 2448 flow. Second operand has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:38,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:38,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 95 [2025-02-08 14:09:38,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:39,488 INFO L124 PetriNetUnfolderBase]: 3616/8839 cut-off events. [2025-02-08 14:09:39,489 INFO L125 PetriNetUnfolderBase]: For 21007/21817 co-relation queries the response was YES. [2025-02-08 14:09:39,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30645 conditions, 8839 events. 3616/8839 cut-off events. For 21007/21817 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 83665 event pairs, 1412 based on Foata normal form. 372/9167 useless extension candidates. Maximal degree in co-relation 30585. Up to 2779 conditions per place. [2025-02-08 14:09:39,549 INFO L140 encePairwiseOnDemand]: 91/95 looper letters, 277 selfloop transitions, 12 changer transitions 0/335 dead transitions. [2025-02-08 14:09:39,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 335 transitions, 3457 flow [2025-02-08 14:09:39,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:09:39,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:09:39,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 256 transitions. [2025-02-08 14:09:39,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6736842105263158 [2025-02-08 14:09:39,550 INFO L175 Difference]: Start difference. First operand has 269 places, 270 transitions, 2448 flow. Second operand 4 states and 256 transitions. [2025-02-08 14:09:39,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 335 transitions, 3457 flow [2025-02-08 14:09:39,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 335 transitions, 3370 flow, removed 20 selfloop flow, removed 3 redundant places. [2025-02-08 14:09:39,662 INFO L231 Difference]: Finished difference. Result has 267 places, 267 transitions, 2406 flow [2025-02-08 14:09:39,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=2382, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2406, PETRI_PLACES=267, PETRI_TRANSITIONS=267} [2025-02-08 14:09:39,663 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 176 predicate places. [2025-02-08 14:09:39,663 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 267 transitions, 2406 flow [2025-02-08 14:09:39,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:39,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:39,663 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:39,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-08 14:09:39,663 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-08 14:09:39,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:39,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1527153287, now seen corresponding path program 2 times [2025-02-08 14:09:39,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:39,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881370215] [2025-02-08 14:09:39,664 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:09:39,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:39,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-08 14:09:39,679 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 14:09:39,679 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:09:39,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:39,802 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 14:09:39,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:39,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881370215] [2025-02-08 14:09:39,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881370215] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:09:39,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103371305] [2025-02-08 14:09:39,802 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:09:39,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:39,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:39,804 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:09:39,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-08 14:09:39,890 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-08 14:09:39,921 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 14:09:39,921 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:09:39,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:39,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 14:09:39,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:09:40,059 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:09:40,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:09:40,204 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:09:40,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103371305] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:09:40,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:09:40,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 25 [2025-02-08 14:09:40,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105338790] [2025-02-08 14:09:40,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:09:40,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-08 14:09:40,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:40,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-08 14:09:40,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2025-02-08 14:09:40,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 95 [2025-02-08 14:09:40,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 267 transitions, 2406 flow. Second operand has 25 states, 25 states have (on average 43.0) internal successors, (1075), 25 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:40,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:40,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 95 [2025-02-08 14:09:40,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:41,628 INFO L124 PetriNetUnfolderBase]: 2908/7872 cut-off events. [2025-02-08 14:09:41,629 INFO L125 PetriNetUnfolderBase]: For 18280/18962 co-relation queries the response was YES. [2025-02-08 14:09:41,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26689 conditions, 7872 events. 2908/7872 cut-off events. For 18280/18962 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 76456 event pairs, 2840 based on Foata normal form. 276/8072 useless extension candidates. Maximal degree in co-relation 26631. Up to 3035 conditions per place. [2025-02-08 14:09:41,702 INFO L140 encePairwiseOnDemand]: 85/95 looper letters, 167 selfloop transitions, 105 changer transitions 23/350 dead transitions. [2025-02-08 14:09:41,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 350 transitions, 3545 flow [2025-02-08 14:09:41,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-08 14:09:41,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-02-08 14:09:41,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 942 transitions. [2025-02-08 14:09:41,704 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4957894736842105 [2025-02-08 14:09:41,704 INFO L175 Difference]: Start difference. First operand has 267 places, 267 transitions, 2406 flow. Second operand 20 states and 942 transitions. [2025-02-08 14:09:41,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 350 transitions, 3545 flow [2025-02-08 14:09:41,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 350 transitions, 3524 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:09:41,989 INFO L231 Difference]: Finished difference. Result has 287 places, 287 transitions, 2850 flow [2025-02-08 14:09:41,990 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=2378, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2850, PETRI_PLACES=287, PETRI_TRANSITIONS=287} [2025-02-08 14:09:41,990 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 196 predicate places. [2025-02-08 14:09:41,992 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 287 transitions, 2850 flow [2025-02-08 14:09:41,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 43.0) internal successors, (1075), 25 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:41,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:41,997 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:42,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-02-08 14:09:42,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:42,198 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-08 14:09:42,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:42,199 INFO L85 PathProgramCache]: Analyzing trace with hash -137797065, now seen corresponding path program 3 times [2025-02-08 14:09:42,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:42,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746468670] [2025-02-08 14:09:42,199 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:09:42,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:42,219 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 4 equivalence classes. [2025-02-08 14:09:42,245 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 43 statements. [2025-02-08 14:09:42,245 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 14:09:42,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:42,475 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-08 14:09:42,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:42,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746468670] [2025-02-08 14:09:42,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746468670] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:09:42,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685058724] [2025-02-08 14:09:42,475 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:09:42,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:42,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:42,486 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:09:42,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-08 14:09:42,588 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 4 equivalence classes. [2025-02-08 14:09:42,617 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 43 statements. [2025-02-08 14:09:42,617 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 14:09:42,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:42,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-08 14:09:42,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:09:42,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-08 14:09:42,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2025-02-08 14:09:42,751 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-08 14:09:42,751 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 14:09:42,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685058724] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:42,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 14:09:42,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2025-02-08 14:09:42,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527769618] [2025-02-08 14:09:42,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:42,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 14:09:42,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:42,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 14:09:42,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-08 14:09:42,899 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 95 [2025-02-08 14:09:42,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 287 transitions, 2850 flow. Second operand has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 7 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:42,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:42,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 95 [2025-02-08 14:09:42,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:44,235 INFO L124 PetriNetUnfolderBase]: 3034/7857 cut-off events. [2025-02-08 14:09:44,235 INFO L125 PetriNetUnfolderBase]: For 16478/17228 co-relation queries the response was YES. [2025-02-08 14:09:44,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26755 conditions, 7857 events. 3034/7857 cut-off events. For 16478/17228 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 74645 event pairs, 550 based on Foata normal form. 369/8218 useless extension candidates. Maximal degree in co-relation 26694. Up to 4134 conditions per place. [2025-02-08 14:09:44,287 INFO L140 encePairwiseOnDemand]: 89/95 looper letters, 222 selfloop transitions, 44 changer transitions 0/317 dead transitions. [2025-02-08 14:09:44,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 317 transitions, 3559 flow [2025-02-08 14:09:44,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 14:09:44,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 14:09:44,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 402 transitions. [2025-02-08 14:09:44,288 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6045112781954888 [2025-02-08 14:09:44,288 INFO L175 Difference]: Start difference. First operand has 287 places, 287 transitions, 2850 flow. Second operand 7 states and 402 transitions. [2025-02-08 14:09:44,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 317 transitions, 3559 flow [2025-02-08 14:09:44,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 317 transitions, 3407 flow, removed 0 selfloop flow, removed 13 redundant places. [2025-02-08 14:09:44,382 INFO L231 Difference]: Finished difference. Result has 278 places, 284 transitions, 2763 flow [2025-02-08 14:09:44,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=2675, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2763, PETRI_PLACES=278, PETRI_TRANSITIONS=284} [2025-02-08 14:09:44,383 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 187 predicate places. [2025-02-08 14:09:44,383 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 284 transitions, 2763 flow [2025-02-08 14:09:44,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 7 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:44,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:44,383 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:44,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-02-08 14:09:44,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:44,584 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-08 14:09:44,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:44,585 INFO L85 PathProgramCache]: Analyzing trace with hash 23228420, now seen corresponding path program 2 times [2025-02-08 14:09:44,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:44,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94521337] [2025-02-08 14:09:44,585 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:09:44,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:44,593 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-02-08 14:09:44,617 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 14:09:44,617 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:09:44,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:44,840 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-08 14:09:44,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:44,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94521337] [2025-02-08 14:09:44,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94521337] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:09:44,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298775123] [2025-02-08 14:09:44,841 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:09:44,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:44,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:44,843 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:09:44,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-02-08 14:09:44,944 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-02-08 14:09:44,974 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 14:09:44,974 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:09:44,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:44,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-08 14:09:44,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:09:44,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-08 14:09:45,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2025-02-08 14:09:45,093 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-08 14:09:45,093 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 14:09:45,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298775123] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:45,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 14:09:45,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2025-02-08 14:09:45,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098753403] [2025-02-08 14:09:45,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:45,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 14:09:45,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:45,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 14:09:45,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-08 14:09:45,196 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 95 [2025-02-08 14:09:45,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 284 transitions, 2763 flow. Second operand has 7 states, 7 states have (on average 52.42857142857143) internal successors, (367), 7 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:45,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:45,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 95 [2025-02-08 14:09:45,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:46,146 INFO L124 PetriNetUnfolderBase]: 2908/7641 cut-off events. [2025-02-08 14:09:46,147 INFO L125 PetriNetUnfolderBase]: For 15887/16575 co-relation queries the response was YES. [2025-02-08 14:09:46,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26081 conditions, 7641 events. 2908/7641 cut-off events. For 15887/16575 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 72678 event pairs, 550 based on Foata normal form. 345/7978 useless extension candidates. Maximal degree in co-relation 26020. Up to 3918 conditions per place. [2025-02-08 14:09:46,204 INFO L140 encePairwiseOnDemand]: 89/95 looper letters, 221 selfloop transitions, 44 changer transitions 0/316 dead transitions. [2025-02-08 14:09:46,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 316 transitions, 3488 flow [2025-02-08 14:09:46,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 14:09:46,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 14:09:46,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 394 transitions. [2025-02-08 14:09:46,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5924812030075188 [2025-02-08 14:09:46,205 INFO L175 Difference]: Start difference. First operand has 278 places, 284 transitions, 2763 flow. Second operand 7 states and 394 transitions. [2025-02-08 14:09:46,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 316 transitions, 3488 flow [2025-02-08 14:09:46,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 316 transitions, 3405 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 14:09:46,309 INFO L231 Difference]: Finished difference. Result has 278 places, 283 transitions, 2763 flow [2025-02-08 14:09:46,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=2675, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2763, PETRI_PLACES=278, PETRI_TRANSITIONS=283} [2025-02-08 14:09:46,310 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 187 predicate places. [2025-02-08 14:09:46,310 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 283 transitions, 2763 flow [2025-02-08 14:09:46,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 52.42857142857143) internal successors, (367), 7 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:46,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:46,310 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:46,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-02-08 14:09:46,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:46,511 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-08 14:09:46,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:46,511 INFO L85 PathProgramCache]: Analyzing trace with hash -75851815, now seen corresponding path program 3 times [2025-02-08 14:09:46,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:46,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886602747] [2025-02-08 14:09:46,511 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:09:46,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:46,519 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 5 equivalence classes. [2025-02-08 14:09:46,557 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 42 of 45 statements. [2025-02-08 14:09:46,557 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 14:09:46,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:47,114 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-08 14:09:47,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:47,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886602747] [2025-02-08 14:09:47,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886602747] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:09:47,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216570504] [2025-02-08 14:09:47,115 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:09:47,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:47,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:47,117 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:09:47,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-02-08 14:09:47,221 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 5 equivalence classes. [2025-02-08 14:09:47,261 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 42 of 45 statements. [2025-02-08 14:09:47,261 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 14:09:47,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:47,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-08 14:09:47,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:09:47,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 14:09:47,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-08 14:09:47,405 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 14:09:47,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 14:09:47,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2025-02-08 14:09:47,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2025-02-08 14:09:47,511 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-08 14:09:47,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:09:47,569 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_834 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_834) c_~get_2~0.base) (+ (* c_~id_0~0 4) c_~get_2~0.offset))))) is different from false [2025-02-08 14:09:47,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:09:47,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2025-02-08 14:09:47,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:09:47,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 41 [2025-02-08 14:09:47,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2025-02-08 14:09:47,789 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 5 not checked. [2025-02-08 14:09:47,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216570504] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:09:47,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:09:47,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2025-02-08 14:09:47,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081276170] [2025-02-08 14:09:47,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:09:47,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 14:09:47,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:47,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 14:09:47,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=324, Unknown=1, NotChecked=36, Total=420 [2025-02-08 14:09:47,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 95 [2025-02-08 14:09:47,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 283 transitions, 2763 flow. Second operand has 21 states, 21 states have (on average 32.666666666666664) internal successors, (686), 21 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:47,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:47,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 95 [2025-02-08 14:09:47,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:49,430 INFO L124 PetriNetUnfolderBase]: 4600/9183 cut-off events. [2025-02-08 14:09:49,430 INFO L125 PetriNetUnfolderBase]: For 17594/18760 co-relation queries the response was YES. [2025-02-08 14:09:49,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31735 conditions, 9183 events. 4600/9183 cut-off events. For 17594/18760 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 76363 event pairs, 550 based on Foata normal form. 619/9774 useless extension candidates. Maximal degree in co-relation 31674. Up to 3414 conditions per place. [2025-02-08 14:09:49,490 INFO L140 encePairwiseOnDemand]: 82/95 looper letters, 344 selfloop transitions, 72 changer transitions 0/450 dead transitions. [2025-02-08 14:09:49,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 450 transitions, 4599 flow [2025-02-08 14:09:49,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 14:09:49,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-08 14:09:49,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 500 transitions. [2025-02-08 14:09:49,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4048582995951417 [2025-02-08 14:09:49,492 INFO L175 Difference]: Start difference. First operand has 278 places, 283 transitions, 2763 flow. Second operand 13 states and 500 transitions. [2025-02-08 14:09:49,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 450 transitions, 4599 flow [2025-02-08 14:09:49,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 450 transitions, 4510 flow, removed 0 selfloop flow, removed 10 redundant places. [2025-02-08 14:09:49,589 INFO L231 Difference]: Finished difference. Result has 279 places, 281 transitions, 2796 flow [2025-02-08 14:09:49,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=2652, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2796, PETRI_PLACES=279, PETRI_TRANSITIONS=281} [2025-02-08 14:09:49,590 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 188 predicate places. [2025-02-08 14:09:49,590 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 281 transitions, 2796 flow [2025-02-08 14:09:49,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 32.666666666666664) internal successors, (686), 21 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:49,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:49,590 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:49,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-02-08 14:09:49,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:49,791 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-08 14:09:49,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:49,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1308278835, now seen corresponding path program 2 times [2025-02-08 14:09:49,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:49,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582311532] [2025-02-08 14:09:49,791 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:09:49,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:49,801 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-02-08 14:09:49,818 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 14:09:49,818 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:09:49,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:50,445 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:09:50,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:50,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582311532] [2025-02-08 14:09:50,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582311532] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:09:50,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645508002] [2025-02-08 14:09:50,445 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:09:50,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:50,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:50,447 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:09:50,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-02-08 14:09:50,552 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-02-08 14:09:50,597 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 14:09:50,597 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:09:50,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:50,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-08 14:09:50,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:09:50,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 14:09:50,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-08 14:09:50,824 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 14:09:50,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 14:09:50,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-08 14:09:51,329 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 14:09:51,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2025-02-08 14:09:51,360 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 11 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:09:51,361 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:09:51,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:09:51,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-02-08 14:09:51,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:09:51,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 33 [2025-02-08 14:09:51,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-02-08 14:09:52,149 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:09:52,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645508002] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:09:52,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:09:52,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 54 [2025-02-08 14:09:52,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063262595] [2025-02-08 14:09:52,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:09:52,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-02-08 14:09:52,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:52,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-02-08 14:09:52,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=2694, Unknown=1, NotChecked=0, Total=2970 [2025-02-08 14:09:52,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 95 [2025-02-08 14:09:52,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 281 transitions, 2796 flow. Second operand has 55 states, 55 states have (on average 28.181818181818183) internal successors, (1550), 55 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:52,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:52,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 95 [2025-02-08 14:09:52,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand