./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-node-trans.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-trans.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c9008ebcceff34245d74f1892a84a552f8268a9318e8a2970f14b3ec6b594daf --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:08:41,090 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:08:41,140 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:41,146 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:08:41,147 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:08:41,168 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:08:41,168 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:08:41,168 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:08:41,168 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:08:41,168 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:08:41,168 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 14:08:41,169 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 14:08:41,169 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:08:41,169 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:08:41,169 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:08:41,169 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:08:41,169 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 14:08:41,169 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:08:41,169 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:08:41,169 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:08:41,169 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:08:41,169 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 14:08:41,169 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 14:08:41,169 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 14:08:41,169 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 14:08:41,169 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:08:41,169 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:08:41,170 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:08:41,170 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:08:41,170 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:08:41,170 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:08:41,170 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:08:41,170 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 14:08:41,170 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 14:08:41,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:08:41,170 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:08:41,170 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 14:08:41,170 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 14:08:41,170 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 14:08:41,170 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:08:41,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 14:08:41,170 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 14:08:41,170 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 14:08:41,170 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 14:08:41,170 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 14:08:41,170 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 -> c9008ebcceff34245d74f1892a84a552f8268a9318e8a2970f14b3ec6b594daf [2025-02-08 14:08:41,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:08:41,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:08:41,394 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:08:41,396 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:08:41,396 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:08:41,397 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-trans.wvr.c [2025-02-08 14:08:42,531 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b233c6716/f2c6b5ac2d0e4209a0c2d0c71c650f22/FLAG8f3d3f948 [2025-02-08 14:08:42,793 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:08:42,794 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-trans.wvr.c [2025-02-08 14:08:42,808 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b233c6716/f2c6b5ac2d0e4209a0c2d0c71c650f22/FLAG8f3d3f948 [2025-02-08 14:08:42,828 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b233c6716/f2c6b5ac2d0e4209a0c2d0c71c650f22 [2025-02-08 14:08:42,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:08:42,832 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:08:42,834 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:08:42,834 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:08:42,840 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:08:42,841 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:08:42" (1/1) ... [2025-02-08 14:08:42,843 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5deddda6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:08:42, skipping insertion in model container [2025-02-08 14:08:42,843 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:08:42" (1/1) ... [2025-02-08 14:08:42,859 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:08:43,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:08:43,039 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:08:43,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:08:43,085 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:08:43,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:08:43 WrapperNode [2025-02-08 14:08:43,086 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:08:43,087 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:08:43,087 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:08:43,087 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:08:43,091 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:43" (1/1) ... [2025-02-08 14:08:43,100 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:43" (1/1) ... [2025-02-08 14:08:43,140 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 23, calls inlined = 35, statements flattened = 474 [2025-02-08 14:08:43,143 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:08:43,143 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:08:43,143 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:08:43,144 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:08:43,150 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:43" (1/1) ... [2025-02-08 14:08:43,150 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:43" (1/1) ... [2025-02-08 14:08:43,153 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:43" (1/1) ... [2025-02-08 14:08:43,176 INFO L175 MemorySlicer]: Split 26 memory accesses to 3 slices as follows [2, 15, 9]. 58 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 6 writes are split as follows [0, 3, 3]. [2025-02-08 14:08:43,181 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:43" (1/1) ... [2025-02-08 14:08:43,181 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:43" (1/1) ... [2025-02-08 14:08:43,199 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:43" (1/1) ... [2025-02-08 14:08:43,200 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:43" (1/1) ... [2025-02-08 14:08:43,202 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:43" (1/1) ... [2025-02-08 14:08:43,206 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:43" (1/1) ... [2025-02-08 14:08:43,210 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:08:43,211 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:08:43,211 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:08:43,211 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:08:43,212 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:08:43" (1/1) ... [2025-02-08 14:08:43,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:08:43,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:08:43,241 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:43,243 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:43,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:08:43,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:08:43,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 14:08:43,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 14:08:43,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:08:43,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 14:08:43,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 14:08:43,262 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 14:08:43,262 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 14:08:43,262 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 14:08:43,263 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 14:08:43,263 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 14:08:43,263 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 14:08:43,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:08:43,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 14:08:43,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 14:08:43,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 14:08:43,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:08:43,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:08:43,265 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:43,380 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:08:43,381 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:08:43,529 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-8: #t~ite9#1 := #t~ret8#1; [2025-02-08 14:08:43,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:43,531 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-10: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 14:08:43,531 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-11: havoc minus_#t~short58#1, minus_#t~short59#1, minus_~a#1, minus_~b#1; [2025-02-08 14:08:43,531 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-12: #t~ret8#1 := minus_#res#1; [2025-02-08 14:08:43,611 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-8: #t~ite18#1 := #t~ret17#1; [2025-02-08 14:08:43,611 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:43,611 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-10: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 14:08:43,611 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-11: havoc minus_#t~short58#1, minus_#t~short59#1, minus_~a#1, minus_~b#1; [2025-02-08 14:08:43,611 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-12: #t~ret17#1 := minus_#res#1; [2025-02-08 14:08:43,670 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-8: #t~ite27#1 := #t~ret26#1; [2025-02-08 14:08:43,670 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-9: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647; [2025-02-08 14:08:43,670 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-10: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 14:08:43,671 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-11: havoc minus_#t~short58#1, minus_#t~short59#1, minus_~a#1, minus_~b#1; [2025-02-08 14:08:43,671 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-12: #t~ret26#1 := minus_#res#1; [2025-02-08 14:08:43,993 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 14:08:43,994 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:08:44,262 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:08:44,262 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:08:44,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:08:44 BoogieIcfgContainer [2025-02-08 14:08:44,262 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:08:44,264 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 14:08:44,264 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 14:08:44,267 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 14:08:44,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 02:08:42" (1/3) ... [2025-02-08 14:08:44,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fdd7e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:08:44, skipping insertion in model container [2025-02-08 14:08:44,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:08:43" (2/3) ... [2025-02-08 14:08:44,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fdd7e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:08:44, skipping insertion in model container [2025-02-08 14:08:44,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:08:44" (3/3) ... [2025-02-08 14:08:44,269 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-trans.wvr.c [2025-02-08 14:08:44,280 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 14:08:44,281 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-trans.wvr.c that has 4 procedures, 126 locations, 1 initial locations, 6 loop locations, and 42 error locations. [2025-02-08 14:08:44,281 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 14:08:44,350 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 14:08:44,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 137 transitions, 295 flow [2025-02-08 14:08:44,467 INFO L124 PetriNetUnfolderBase]: 12/134 cut-off events. [2025-02-08 14:08:44,471 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 14:08:44,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 134 events. 12/134 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 409 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 111. Up to 2 conditions per place. [2025-02-08 14:08:44,478 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 137 transitions, 295 flow [2025-02-08 14:08:44,482 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 132 transitions, 279 flow [2025-02-08 14:08:44,486 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:08:44,495 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;@38236993, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:08:44,497 INFO L334 AbstractCegarLoop]: Starting to check reachability of 63 error locations. [2025-02-08 14:08:44,501 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:08:44,501 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-02-08 14:08:44,501 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:08:44,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:44,502 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-02-08 14:08:44,502 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-02-08 14:08:44,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:44,506 INFO L85 PathProgramCache]: Analyzing trace with hash 42578, now seen corresponding path program 1 times [2025-02-08 14:08:44,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:44,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137005938] [2025-02-08 14:08:44,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:44,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:44,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:08:44,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:08:44,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:44,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:44,659 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,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:44,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137005938] [2025-02-08 14:08:44,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137005938] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:08:44,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:08:44,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:08:44,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38001881] [2025-02-08 14:08:44,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:08:44,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:08:44,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:44,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:08:44,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:08:44,701 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 137 [2025-02-08 14:08:44,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 132 transitions, 279 flow. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:44,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:44,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 137 [2025-02-08 14:08:44,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:45,494 INFO L124 PetriNetUnfolderBase]: 3668/7561 cut-off events. [2025-02-08 14:08:45,494 INFO L125 PetriNetUnfolderBase]: For 250/250 co-relation queries the response was YES. [2025-02-08 14:08:45,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12813 conditions, 7561 events. 3668/7561 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 65156 event pairs, 2732 based on Foata normal form. 2/5919 useless extension candidates. Maximal degree in co-relation 12122. Up to 5033 conditions per place. [2025-02-08 14:08:45,546 INFO L140 encePairwiseOnDemand]: 134/137 looper letters, 58 selfloop transitions, 1 changer transitions 0/130 dead transitions. [2025-02-08 14:08:45,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 130 transitions, 393 flow [2025-02-08 14:08:45,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:08:45,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:08:45,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 283 transitions. [2025-02-08 14:08:45,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6885644768856448 [2025-02-08 14:08:45,557 INFO L175 Difference]: Start difference. First operand has 130 places, 132 transitions, 279 flow. Second operand 3 states and 283 transitions. [2025-02-08 14:08:45,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 130 transitions, 393 flow [2025-02-08 14:08:45,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 130 transitions, 384 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 14:08:45,568 INFO L231 Difference]: Finished difference. Result has 125 places, 130 transitions, 268 flow [2025-02-08 14:08:45,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=125, PETRI_TRANSITIONS=130} [2025-02-08 14:08:45,572 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -5 predicate places. [2025-02-08 14:08:45,572 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 130 transitions, 268 flow [2025-02-08 14:08:45,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:45,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:45,573 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 14:08:45,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 14:08:45,573 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-02-08 14:08:45,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:45,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1321193, now seen corresponding path program 1 times [2025-02-08 14:08:45,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:45,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428982685] [2025-02-08 14:08:45,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:45,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:45,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:08:45,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:08:45,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:45,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:45,660 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:45,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:45,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428982685] [2025-02-08 14:08:45,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428982685] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:08:45,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:08:45,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:08:45,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723907845] [2025-02-08 14:08:45,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:08:45,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:08:45,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:45,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:08:45,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:08:45,679 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 137 [2025-02-08 14:08:45,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 130 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:45,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:45,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 137 [2025-02-08 14:08:45,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:46,280 INFO L124 PetriNetUnfolderBase]: 3668/7559 cut-off events. [2025-02-08 14:08:46,280 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-02-08 14:08:46,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12728 conditions, 7559 events. 3668/7559 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 65190 event pairs, 2732 based on Foata normal form. 0/5917 useless extension candidates. Maximal degree in co-relation 12722. Up to 5031 conditions per place. [2025-02-08 14:08:46,316 INFO L140 encePairwiseOnDemand]: 134/137 looper letters, 56 selfloop transitions, 1 changer transitions 0/128 dead transitions. [2025-02-08 14:08:46,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 128 transitions, 378 flow [2025-02-08 14:08:46,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:08:46,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:08:46,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2025-02-08 14:08:46,318 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.683698296836983 [2025-02-08 14:08:46,318 INFO L175 Difference]: Start difference. First operand has 125 places, 130 transitions, 268 flow. Second operand 3 states and 281 transitions. [2025-02-08 14:08:46,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 128 transitions, 378 flow [2025-02-08 14:08:46,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 128 transitions, 377 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:08:46,320 INFO L231 Difference]: Finished difference. Result has 124 places, 128 transitions, 265 flow [2025-02-08 14:08:46,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=265, PETRI_PLACES=124, PETRI_TRANSITIONS=128} [2025-02-08 14:08:46,321 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -6 predicate places. [2025-02-08 14:08:46,321 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 128 transitions, 265 flow [2025-02-08 14:08:46,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:46,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:46,321 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:08:46,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 14:08:46,322 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-02-08 14:08:46,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:46,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1269705839, now seen corresponding path program 1 times [2025-02-08 14:08:46,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:46,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145620611] [2025-02-08 14:08:46,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:46,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:46,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:08:46,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:08:46,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:46,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:46,435 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:46,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:46,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145620611] [2025-02-08 14:08:46,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145620611] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:08:46,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:08:46,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:08:46,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453499300] [2025-02-08 14:08:46,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:08:46,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:08:46,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:46,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:08:46,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:08:46,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 137 [2025-02-08 14:08:46,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 128 transitions, 265 flow. Second operand has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 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,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:46,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 137 [2025-02-08 14:08:46,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:47,098 INFO L124 PetriNetUnfolderBase]: 3671/7571 cut-off events. [2025-02-08 14:08:47,099 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-02-08 14:08:47,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12756 conditions, 7571 events. 3671/7571 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 65399 event pairs, 2732 based on Foata normal form. 3/5929 useless extension candidates. Maximal degree in co-relation 12749. Up to 5041 conditions per place. [2025-02-08 14:08:47,142 INFO L140 encePairwiseOnDemand]: 119/137 looper letters, 60 selfloop transitions, 12 changer transitions 0/137 dead transitions. [2025-02-08 14:08:47,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 137 transitions, 427 flow [2025-02-08 14:08:47,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:08:47,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:08:47,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 366 transitions. [2025-02-08 14:08:47,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6678832116788321 [2025-02-08 14:08:47,147 INFO L175 Difference]: Start difference. First operand has 124 places, 128 transitions, 265 flow. Second operand 4 states and 366 transitions. [2025-02-08 14:08:47,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 137 transitions, 427 flow [2025-02-08 14:08:47,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 137 transitions, 426 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:08:47,151 INFO L231 Difference]: Finished difference. Result has 128 places, 137 transitions, 351 flow [2025-02-08 14:08:47,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=351, PETRI_PLACES=128, PETRI_TRANSITIONS=137} [2025-02-08 14:08:47,152 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -2 predicate places. [2025-02-08 14:08:47,153 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 137 transitions, 351 flow [2025-02-08 14:08:47,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 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,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:47,153 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:08:47,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 14:08:47,154 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-02-08 14:08:47,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:47,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1269705812, now seen corresponding path program 1 times [2025-02-08 14:08:47,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:47,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920229731] [2025-02-08 14:08:47,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:47,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:47,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:08:47,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:08:47,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:47,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:47,211 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:47,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:47,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920229731] [2025-02-08 14:08:47,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920229731] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:08:47,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:08:47,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:08:47,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067110765] [2025-02-08 14:08:47,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:08:47,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:08:47,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:47,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:08:47,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:08:47,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 137 [2025-02-08 14:08:47,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 137 transitions, 351 flow. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:47,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 137 [2025-02-08 14:08:47,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:47,693 INFO L124 PetriNetUnfolderBase]: 3671/7569 cut-off events. [2025-02-08 14:08:47,693 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2025-02-08 14:08:47,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12788 conditions, 7569 events. 3671/7569 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 65224 event pairs, 2732 based on Foata normal form. 2/5933 useless extension candidates. Maximal degree in co-relation 12779. Up to 5042 conditions per place. [2025-02-08 14:08:47,725 INFO L140 encePairwiseOnDemand]: 134/137 looper letters, 67 selfloop transitions, 1 changer transitions 0/135 dead transitions. [2025-02-08 14:08:47,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 135 transitions, 483 flow [2025-02-08 14:08:47,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:08:47,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:08:47,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 283 transitions. [2025-02-08 14:08:47,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6885644768856448 [2025-02-08 14:08:47,727 INFO L175 Difference]: Start difference. First operand has 128 places, 137 transitions, 351 flow. Second operand 3 states and 283 transitions. [2025-02-08 14:08:47,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 135 transitions, 483 flow [2025-02-08 14:08:47,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 135 transitions, 474 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:08:47,730 INFO L231 Difference]: Finished difference. Result has 127 places, 135 transitions, 340 flow [2025-02-08 14:08:47,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=127, PETRI_TRANSITIONS=135} [2025-02-08 14:08:47,732 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -3 predicate places. [2025-02-08 14:08:47,733 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 135 transitions, 340 flow [2025-02-08 14:08:47,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:47,733 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 14:08:47,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 14:08:47,733 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-02-08 14:08:47,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:47,734 INFO L85 PathProgramCache]: Analyzing trace with hash 706175741, now seen corresponding path program 1 times [2025-02-08 14:08:47,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:47,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731928131] [2025-02-08 14:08:47,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:47,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:47,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:08:47,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:08:47,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:47,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:47,776 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:47,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:47,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731928131] [2025-02-08 14:08:47,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731928131] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:08:47,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:08:47,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:08:47,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666509648] [2025-02-08 14:08:47,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:08:47,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:08:47,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:47,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:08:47,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:08:47,782 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 137 [2025-02-08 14:08:47,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 135 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:47,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 137 [2025-02-08 14:08:47,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:48,194 INFO L124 PetriNetUnfolderBase]: 3671/7567 cut-off events. [2025-02-08 14:08:48,195 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-02-08 14:08:48,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12779 conditions, 7567 events. 3671/7567 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 65226 event pairs, 2732 based on Foata normal form. 1/5931 useless extension candidates. Maximal degree in co-relation 12769. Up to 5040 conditions per place. [2025-02-08 14:08:48,228 INFO L140 encePairwiseOnDemand]: 134/137 looper letters, 65 selfloop transitions, 1 changer transitions 0/133 dead transitions. [2025-02-08 14:08:48,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 133 transitions, 468 flow [2025-02-08 14:08:48,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:08:48,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:08:48,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2025-02-08 14:08:48,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.683698296836983 [2025-02-08 14:08:48,229 INFO L175 Difference]: Start difference. First operand has 127 places, 135 transitions, 340 flow. Second operand 3 states and 281 transitions. [2025-02-08 14:08:48,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 133 transitions, 468 flow [2025-02-08 14:08:48,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 133 transitions, 467 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:08:48,231 INFO L231 Difference]: Finished difference. Result has 126 places, 133 transitions, 337 flow [2025-02-08 14:08:48,232 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=337, PETRI_PLACES=126, PETRI_TRANSITIONS=133} [2025-02-08 14:08:48,232 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -4 predicate places. [2025-02-08 14:08:48,232 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 133 transitions, 337 flow [2025-02-08 14:08:48,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:48,233 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:08:48,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 14:08:48,233 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-02-08 14:08:48,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:48,233 INFO L85 PathProgramCache]: Analyzing trace with hash 30096456, now seen corresponding path program 1 times [2025-02-08 14:08:48,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:48,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73830790] [2025-02-08 14:08:48,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:48,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:48,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:08:48,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:08:48,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:48,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:48,300 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:48,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:48,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73830790] [2025-02-08 14:08:48,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73830790] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:08:48,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:08:48,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:08:48,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125919774] [2025-02-08 14:08:48,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:08:48,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:08:48,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:48,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:08:48,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:08:48,307 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 137 [2025-02-08 14:08:48,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 133 transitions, 337 flow. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:48,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:48,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 137 [2025-02-08 14:08:48,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:48,693 INFO L124 PetriNetUnfolderBase]: 3671/7565 cut-off events. [2025-02-08 14:08:48,694 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-02-08 14:08:48,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12780 conditions, 7565 events. 3671/7565 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 65210 event pairs, 2732 based on Foata normal form. 2/5931 useless extension candidates. Maximal degree in co-relation 12769. Up to 5042 conditions per place. [2025-02-08 14:08:48,726 INFO L140 encePairwiseOnDemand]: 134/137 looper letters, 67 selfloop transitions, 1 changer transitions 0/131 dead transitions. [2025-02-08 14:08:48,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 131 transitions, 469 flow [2025-02-08 14:08:48,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:08:48,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:08:48,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 283 transitions. [2025-02-08 14:08:48,728 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6885644768856448 [2025-02-08 14:08:48,728 INFO L175 Difference]: Start difference. First operand has 126 places, 133 transitions, 337 flow. Second operand 3 states and 283 transitions. [2025-02-08 14:08:48,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 131 transitions, 469 flow [2025-02-08 14:08:48,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 131 transitions, 468 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:08:48,730 INFO L231 Difference]: Finished difference. Result has 125 places, 131 transitions, 334 flow [2025-02-08 14:08:48,730 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=334, PETRI_PLACES=125, PETRI_TRANSITIONS=131} [2025-02-08 14:08:48,731 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -5 predicate places. [2025-02-08 14:08:48,731 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 131 transitions, 334 flow [2025-02-08 14:08:48,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:48,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:48,731 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:08:48,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 14:08:48,731 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-02-08 14:08:48,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:48,732 INFO L85 PathProgramCache]: Analyzing trace with hash 30845201, now seen corresponding path program 1 times [2025-02-08 14:08:48,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:48,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765130627] [2025-02-08 14:08:48,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:48,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:48,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:08:48,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:08:48,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:48,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:48,813 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:48,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:48,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765130627] [2025-02-08 14:08:48,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765130627] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:08:48,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783538942] [2025-02-08 14:08:48,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:48,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:08:48,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:08:48,816 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:48,819 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:48,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:08:48,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:08:48,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:48,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:48,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:08:48,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:08:48,921 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:48,921 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 14:08:48,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783538942] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:08:48,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 14:08:48,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-08 14:08:48,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499218895] [2025-02-08 14:08:48,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:08:48,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:08:48,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:48,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:08:48,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 14:08:48,940 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 137 [2025-02-08 14:08:48,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 131 transitions, 334 flow. Second operand has 6 states, 6 states have (on average 73.0) internal successors, (438), 6 states have internal predecessors, (438), 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,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:48,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 137 [2025-02-08 14:08:48,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:49,516 INFO L124 PetriNetUnfolderBase]: 3671/7562 cut-off events. [2025-02-08 14:08:49,517 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-02-08 14:08:49,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12776 conditions, 7562 events. 3671/7562 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 65222 event pairs, 2732 based on Foata normal form. 3/5927 useless extension candidates. Maximal degree in co-relation 12764. Up to 5026 conditions per place. [2025-02-08 14:08:49,552 INFO L140 encePairwiseOnDemand]: 122/137 looper letters, 48 selfloop transitions, 21 changer transitions 0/128 dead transitions. [2025-02-08 14:08:49,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 128 transitions, 460 flow [2025-02-08 14:08:49,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:08:49,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:08:49,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 504 transitions. [2025-02-08 14:08:49,554 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6131386861313869 [2025-02-08 14:08:49,554 INFO L175 Difference]: Start difference. First operand has 125 places, 131 transitions, 334 flow. Second operand 6 states and 504 transitions. [2025-02-08 14:08:49,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 128 transitions, 460 flow [2025-02-08 14:08:49,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 128 transitions, 459 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:08:49,556 INFO L231 Difference]: Finished difference. Result has 126 places, 128 transitions, 363 flow [2025-02-08 14:08:49,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=363, PETRI_PLACES=126, PETRI_TRANSITIONS=128} [2025-02-08 14:08:49,557 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -4 predicate places. [2025-02-08 14:08:49,557 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 128 transitions, 363 flow [2025-02-08 14:08:49,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.0) internal successors, (438), 6 states have internal predecessors, (438), 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,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:49,558 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:08:49,565 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:49,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:08:49,759 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-02-08 14:08:49,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:49,759 INFO L85 PathProgramCache]: Analyzing trace with hash 932991297, now seen corresponding path program 1 times [2025-02-08 14:08:49,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:49,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520207750] [2025-02-08 14:08:49,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:49,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:49,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:08:49,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:08:49,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:49,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:49,823 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:49,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:49,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520207750] [2025-02-08 14:08:49,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520207750] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:08:49,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:08:49,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:08:49,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705944713] [2025-02-08 14:08:49,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:08:49,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:08:49,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:49,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:08:49,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:08:49,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 137 [2025-02-08 14:08:49,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 128 transitions, 363 flow. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:49,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:49,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 137 [2025-02-08 14:08:49,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:50,202 INFO L124 PetriNetUnfolderBase]: 3671/7560 cut-off events. [2025-02-08 14:08:50,203 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-02-08 14:08:50,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12792 conditions, 7560 events. 3671/7560 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 65184 event pairs, 2732 based on Foata normal form. 1/5926 useless extension candidates. Maximal degree in co-relation 12780. Up to 5040 conditions per place. [2025-02-08 14:08:50,241 INFO L140 encePairwiseOnDemand]: 134/137 looper letters, 65 selfloop transitions, 1 changer transitions 0/126 dead transitions. [2025-02-08 14:08:50,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 126 transitions, 491 flow [2025-02-08 14:08:50,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:08:50,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:08:50,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2025-02-08 14:08:50,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.683698296836983 [2025-02-08 14:08:50,244 INFO L175 Difference]: Start difference. First operand has 126 places, 128 transitions, 363 flow. Second operand 3 states and 281 transitions. [2025-02-08 14:08:50,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 126 transitions, 491 flow [2025-02-08 14:08:50,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 126 transitions, 446 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-02-08 14:08:50,247 INFO L231 Difference]: Finished difference. Result has 122 places, 126 transitions, 316 flow [2025-02-08 14:08:50,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=122, PETRI_TRANSITIONS=126} [2025-02-08 14:08:50,249 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -8 predicate places. [2025-02-08 14:08:50,250 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 126 transitions, 316 flow [2025-02-08 14:08:50,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:08:50,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:50,250 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-02-08 14:08:50,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 14:08:50,251 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-02-08 14:08:50,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:50,251 INFO L85 PathProgramCache]: Analyzing trace with hash 956202409, now seen corresponding path program 1 times [2025-02-08 14:08:50,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:50,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350260470] [2025-02-08 14:08:50,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:50,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:50,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:08:50,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:08:50,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:50,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:50,313 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:50,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:50,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350260470] [2025-02-08 14:08:50,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350260470] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:08:50,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645508002] [2025-02-08 14:08:50,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:50,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:08:50,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:08:50,316 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:50,317 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:50,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:08:50,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:08:50,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:50,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:50,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:08:50,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:08:50,394 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:50,395 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:08:50,424 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:50,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645508002] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:08:50,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:08:50,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-08 14:08:50,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998402529] [2025-02-08 14:08:50,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:08:50,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 14:08:50,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:50,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 14:08:50,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-08 14:08:50,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 137 [2025-02-08 14:08:50,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 126 transitions, 316 flow. Second operand has 12 states, 12 states have (on average 73.16666666666667) internal successors, (878), 12 states have internal predecessors, (878), 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,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:50,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 137 [2025-02-08 14:08:50,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:51,023 INFO L124 PetriNetUnfolderBase]: 3680/7596 cut-off events. [2025-02-08 14:08:51,024 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2025-02-08 14:08:51,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12861 conditions, 7596 events. 3680/7596 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 65276 event pairs, 2732 based on Foata normal form. 9/5961 useless extension candidates. Maximal degree in co-relation 12849. Up to 5047 conditions per place. [2025-02-08 14:08:51,050 INFO L140 encePairwiseOnDemand]: 122/137 looper letters, 57 selfloop transitions, 39 changer transitions 0/153 dead transitions. [2025-02-08 14:08:51,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 153 transitions, 625 flow [2025-02-08 14:08:51,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 14:08:51,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 14:08:51,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 825 transitions. [2025-02-08 14:08:51,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6021897810218978 [2025-02-08 14:08:51,056 INFO L175 Difference]: Start difference. First operand has 122 places, 126 transitions, 316 flow. Second operand 10 states and 825 transitions. [2025-02-08 14:08:51,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 153 transitions, 625 flow [2025-02-08 14:08:51,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 153 transitions, 624 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:08:51,059 INFO L231 Difference]: Finished difference. Result has 133 places, 153 transitions, 564 flow [2025-02-08 14:08:51,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=564, PETRI_PLACES=133, PETRI_TRANSITIONS=153} [2025-02-08 14:08:51,059 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 3 predicate places. [2025-02-08 14:08:51,059 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 153 transitions, 564 flow [2025-02-08 14:08:51,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 73.16666666666667) internal successors, (878), 12 states have internal predecessors, (878), 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,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:51,060 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:08:51,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 14:08:51,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:08:51,261 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-02-08 14:08:51,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:51,261 INFO L85 PathProgramCache]: Analyzing trace with hash 486744589, now seen corresponding path program 1 times [2025-02-08 14:08:51,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:51,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554719151] [2025-02-08 14:08:51,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:51,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:51,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 14:08:51,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:08:51,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:51,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:51,330 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:51,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:51,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554719151] [2025-02-08 14:08:51,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554719151] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:08:51,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:08:51,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:08:51,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98674607] [2025-02-08 14:08:51,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:08:51,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:08:51,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:51,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:08:51,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:08:51,339 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 137 [2025-02-08 14:08:51,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 153 transitions, 564 flow. Second operand has 4 states, 4 states have (on average 74.5) internal successors, (298), 4 states have internal predecessors, (298), 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,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:51,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 137 [2025-02-08 14:08:51,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:51,753 INFO L124 PetriNetUnfolderBase]: 3683/7608 cut-off events. [2025-02-08 14:08:51,753 INFO L125 PetriNetUnfolderBase]: For 160/160 co-relation queries the response was YES. [2025-02-08 14:08:51,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12954 conditions, 7608 events. 3683/7608 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 65347 event pairs, 2732 based on Foata normal form. 3/5973 useless extension candidates. Maximal degree in co-relation 12939. Up to 5077 conditions per place. [2025-02-08 14:08:51,777 INFO L140 encePairwiseOnDemand]: 119/137 looper letters, 96 selfloop transitions, 12 changer transitions 0/162 dead transitions. [2025-02-08 14:08:51,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 162 transitions, 798 flow [2025-02-08 14:08:51,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:08:51,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:08:51,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 366 transitions. [2025-02-08 14:08:51,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6678832116788321 [2025-02-08 14:08:51,778 INFO L175 Difference]: Start difference. First operand has 133 places, 153 transitions, 564 flow. Second operand 4 states and 366 transitions. [2025-02-08 14:08:51,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 162 transitions, 798 flow [2025-02-08 14:08:51,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 162 transitions, 765 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-02-08 14:08:51,781 INFO L231 Difference]: Finished difference. Result has 136 places, 162 transitions, 618 flow [2025-02-08 14:08:51,781 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=618, PETRI_PLACES=136, PETRI_TRANSITIONS=162} [2025-02-08 14:08:51,782 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 6 predicate places. [2025-02-08 14:08:51,782 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 162 transitions, 618 flow [2025-02-08 14:08:51,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.5) internal successors, (298), 4 states have internal predecessors, (298), 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,782 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:51,782 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:51,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 14:08:51,782 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-02-08 14:08:51,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:51,783 INFO L85 PathProgramCache]: Analyzing trace with hash 799727423, now seen corresponding path program 1 times [2025-02-08 14:08:51,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:51,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782791936] [2025-02-08 14:08:51,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:51,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:51,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 14:08:51,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 14:08:51,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:51,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:51,849 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:51,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:51,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782791936] [2025-02-08 14:08:51,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782791936] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:08:51,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:08:51,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:08:51,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124314665] [2025-02-08 14:08:51,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:08:51,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:08:51,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:51,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:08:51,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:08:51,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 137 [2025-02-08 14:08:51,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 162 transitions, 618 flow. Second operand has 4 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 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,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:51,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 137 [2025-02-08 14:08:51,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:52,327 INFO L124 PetriNetUnfolderBase]: 3682/7607 cut-off events. [2025-02-08 14:08:52,327 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2025-02-08 14:08:52,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12969 conditions, 7607 events. 3682/7607 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 65342 event pairs, 2732 based on Foata normal form. 1/5976 useless extension candidates. Maximal degree in co-relation 12951. Up to 5073 conditions per place. [2025-02-08 14:08:52,358 INFO L140 encePairwiseOnDemand]: 133/137 looper letters, 98 selfloop transitions, 3 changer transitions 0/161 dead transitions. [2025-02-08 14:08:52,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 161 transitions, 816 flow [2025-02-08 14:08:52,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:08:52,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:08:52,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 356 transitions. [2025-02-08 14:08:52,360 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6496350364963503 [2025-02-08 14:08:52,360 INFO L175 Difference]: Start difference. First operand has 136 places, 162 transitions, 618 flow. Second operand 4 states and 356 transitions. [2025-02-08 14:08:52,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 161 transitions, 816 flow [2025-02-08 14:08:52,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 161 transitions, 807 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:08:52,364 INFO L231 Difference]: Finished difference. Result has 138 places, 161 transitions, 611 flow [2025-02-08 14:08:52,364 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=611, PETRI_PLACES=138, PETRI_TRANSITIONS=161} [2025-02-08 14:08:52,365 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 8 predicate places. [2025-02-08 14:08:52,365 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 161 transitions, 611 flow [2025-02-08 14:08:52,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 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,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:52,365 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2025-02-08 14:08:52,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 14:08:52,366 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-02-08 14:08:52,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:52,366 INFO L85 PathProgramCache]: Analyzing trace with hash -167977845, now seen corresponding path program 2 times [2025-02-08 14:08:52,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:52,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43596406] [2025-02-08 14:08:52,367 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:08:52,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:52,379 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-08 14:08:52,384 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:52,384 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:08:52,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:52,444 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:52,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:52,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43596406] [2025-02-08 14:08:52,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43596406] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:08:52,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85827516] [2025-02-08 14:08:52,445 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:08:52,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:08:52,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:08:52,448 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:52,450 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:52,507 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-08 14:08:52,519 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:52,519 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:08:52,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:52,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:08:52,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:08:52,545 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:52,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:08:52,573 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:52,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85827516] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:08:52,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:08:52,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-02-08 14:08:52,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763573805] [2025-02-08 14:08:52,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:08:52,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:08:52,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:52,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:08:52,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:08:52,598 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 137 [2025-02-08 14:08:52,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 161 transitions, 611 flow. Second operand has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 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,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:52,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 137 [2025-02-08 14:08:52,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:53,065 INFO L124 PetriNetUnfolderBase]: 3682/7604 cut-off events. [2025-02-08 14:08:53,065 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2025-02-08 14:08:53,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12951 conditions, 7604 events. 3682/7604 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 65333 event pairs, 2732 based on Foata normal form. 3/5975 useless extension candidates. Maximal degree in co-relation 12932. Up to 5042 conditions per place. [2025-02-08 14:08:53,093 INFO L140 encePairwiseOnDemand]: 121/137 looper letters, 53 selfloop transitions, 48 changer transitions 0/158 dead transitions. [2025-02-08 14:08:53,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 158 transitions, 783 flow [2025-02-08 14:08:53,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:08:53,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:08:53,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 400 transitions. [2025-02-08 14:08:53,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.583941605839416 [2025-02-08 14:08:53,095 INFO L175 Difference]: Start difference. First operand has 138 places, 161 transitions, 611 flow. Second operand 5 states and 400 transitions. [2025-02-08 14:08:53,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 158 transitions, 783 flow [2025-02-08 14:08:53,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 158 transitions, 749 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-02-08 14:08:53,097 INFO L231 Difference]: Finished difference. Result has 133 places, 158 transitions, 643 flow [2025-02-08 14:08:53,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=643, PETRI_PLACES=133, PETRI_TRANSITIONS=158} [2025-02-08 14:08:53,098 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 3 predicate places. [2025-02-08 14:08:53,098 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 158 transitions, 643 flow [2025-02-08 14:08:53,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 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:53,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:53,098 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:53,104 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:53,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:08:53,302 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-02-08 14:08:53,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:53,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1340307681, now seen corresponding path program 1 times [2025-02-08 14:08:53,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:53,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624708347] [2025-02-08 14:08:53,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:53,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:53,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:08:53,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:08:53,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:53,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:53,394 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:53,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:53,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624708347] [2025-02-08 14:08:53,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624708347] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:08:53,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:08:53,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:08:53,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714020760] [2025-02-08 14:08:53,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:08:53,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:08:53,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:53,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:08:53,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:08:53,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 137 [2025-02-08 14:08:53,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 158 transitions, 643 flow. Second operand has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 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:53,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:53,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 137 [2025-02-08 14:08:53,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:53,807 INFO L124 PetriNetUnfolderBase]: 3681/7603 cut-off events. [2025-02-08 14:08:53,807 INFO L125 PetriNetUnfolderBase]: For 160/160 co-relation queries the response was YES. [2025-02-08 14:08:53,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12974 conditions, 7603 events. 3681/7603 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 65266 event pairs, 2732 based on Foata normal form. 0/5961 useless extension candidates. Maximal degree in co-relation 12959. Up to 5072 conditions per place. [2025-02-08 14:08:53,845 INFO L140 encePairwiseOnDemand]: 133/137 looper letters, 97 selfloop transitions, 3 changer transitions 0/157 dead transitions. [2025-02-08 14:08:53,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 157 transitions, 837 flow [2025-02-08 14:08:53,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:08:53,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:08:53,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 356 transitions. [2025-02-08 14:08:53,847 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6496350364963503 [2025-02-08 14:08:53,847 INFO L175 Difference]: Start difference. First operand has 133 places, 158 transitions, 643 flow. Second operand 4 states and 356 transitions. [2025-02-08 14:08:53,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 157 transitions, 837 flow [2025-02-08 14:08:53,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 157 transitions, 743 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 14:08:53,849 INFO L231 Difference]: Finished difference. Result has 132 places, 157 transitions, 549 flow [2025-02-08 14:08:53,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=549, PETRI_PLACES=132, PETRI_TRANSITIONS=157} [2025-02-08 14:08:53,850 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 2 predicate places. [2025-02-08 14:08:53,850 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 157 transitions, 549 flow [2025-02-08 14:08:53,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 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:53,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:53,850 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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:53,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 14:08:53,850 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-02-08 14:08:53,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:53,851 INFO L85 PathProgramCache]: Analyzing trace with hash -606122415, now seen corresponding path program 1 times [2025-02-08 14:08:53,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:53,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526469120] [2025-02-08 14:08:53,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:53,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:53,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 14:08:53,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 14:08:53,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:53,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:53,929 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:53,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:53,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526469120] [2025-02-08 14:08:53,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526469120] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:08:53,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:08:53,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:08:53,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137768564] [2025-02-08 14:08:53,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:08:53,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:08:53,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:53,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:08:53,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:08:53,938 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 137 [2025-02-08 14:08:53,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 157 transitions, 549 flow. Second operand has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 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:53,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:53,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 137 [2025-02-08 14:08:53,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:54,346 INFO L124 PetriNetUnfolderBase]: 3680/7602 cut-off events. [2025-02-08 14:08:54,347 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2025-02-08 14:08:54,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12927 conditions, 7602 events. 3680/7602 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 65158 event pairs, 2732 based on Foata normal form. 0/5961 useless extension candidates. Maximal degree in co-relation 12912. Up to 5071 conditions per place. [2025-02-08 14:08:54,373 INFO L140 encePairwiseOnDemand]: 133/137 looper letters, 96 selfloop transitions, 3 changer transitions 0/156 dead transitions. [2025-02-08 14:08:54,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 156 transitions, 743 flow [2025-02-08 14:08:54,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:08:54,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:08:54,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 356 transitions. [2025-02-08 14:08:54,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6496350364963503 [2025-02-08 14:08:54,375 INFO L175 Difference]: Start difference. First operand has 132 places, 157 transitions, 549 flow. Second operand 4 states and 356 transitions. [2025-02-08 14:08:54,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 156 transitions, 743 flow [2025-02-08 14:08:54,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 156 transitions, 739 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:08:54,377 INFO L231 Difference]: Finished difference. Result has 133 places, 156 transitions, 547 flow [2025-02-08 14:08:54,377 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=547, PETRI_PLACES=133, PETRI_TRANSITIONS=156} [2025-02-08 14:08:54,377 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 3 predicate places. [2025-02-08 14:08:54,377 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 156 transitions, 547 flow [2025-02-08 14:08:54,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 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,378 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:54,378 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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:54,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 14:08:54,378 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-02-08 14:08:54,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:54,378 INFO L85 PathProgramCache]: Analyzing trace with hash 315129742, now seen corresponding path program 1 times [2025-02-08 14:08:54,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:54,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244088520] [2025-02-08 14:08:54,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:54,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:54,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 14:08:54,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 14:08:54,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:54,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:54,468 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:08:54,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:54,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244088520] [2025-02-08 14:08:54,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244088520] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:08:54,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913759971] [2025-02-08 14:08:54,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:54,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:08:54,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:08:54,471 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:54,473 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:54,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 14:08:54,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 14:08:54,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:54,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:54,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 14:08:54,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:08:54,668 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:08:54,670 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:08:54,782 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:08:54,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913759971] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:08:54,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:08:54,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-02-08 14:08:54,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470396107] [2025-02-08 14:08:54,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:08:54,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 14:08:54,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:54,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 14:08:54,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-02-08 14:08:55,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 137 [2025-02-08 14:08:55,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 156 transitions, 547 flow. Second operand has 19 states, 19 states have (on average 64.26315789473684) internal successors, (1221), 19 states have internal predecessors, (1221), 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,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:55,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 137 [2025-02-08 14:08:55,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:56,310 INFO L124 PetriNetUnfolderBase]: 7354/15172 cut-off events. [2025-02-08 14:08:56,310 INFO L125 PetriNetUnfolderBase]: For 217/217 co-relation queries the response was YES. [2025-02-08 14:08:56,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25764 conditions, 15172 events. 7354/15172 cut-off events. For 217/217 co-relation queries the response was YES. Maximal size of possible extension queue 885. Compared 144874 event pairs, 5464 based on Foata normal form. 5/12009 useless extension candidates. Maximal degree in co-relation 25749. Up to 5043 conditions per place. [2025-02-08 14:08:56,358 INFO L140 encePairwiseOnDemand]: 114/137 looper letters, 114 selfloop transitions, 71 changer transitions 0/236 dead transitions. [2025-02-08 14:08:56,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 236 transitions, 1233 flow [2025-02-08 14:08:56,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 14:08:56,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-02-08 14:08:56,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1257 transitions. [2025-02-08 14:08:56,362 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5097323600973236 [2025-02-08 14:08:56,362 INFO L175 Difference]: Start difference. First operand has 133 places, 156 transitions, 547 flow. Second operand 18 states and 1257 transitions. [2025-02-08 14:08:56,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 236 transitions, 1233 flow [2025-02-08 14:08:56,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 236 transitions, 1227 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:08:56,366 INFO L231 Difference]: Finished difference. Result has 147 places, 192 transitions, 974 flow [2025-02-08 14:08:56,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=974, PETRI_PLACES=147, PETRI_TRANSITIONS=192} [2025-02-08 14:08:56,368 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 17 predicate places. [2025-02-08 14:08:56,368 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 192 transitions, 974 flow [2025-02-08 14:08:56,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 64.26315789473684) internal successors, (1221), 19 states have internal predecessors, (1221), 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,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:56,369 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 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:56,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 14:08:56,569 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,SelfDestructingSolverStorable14 [2025-02-08 14:08:56,569 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-02-08 14:08:56,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:56,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1745743441, now seen corresponding path program 1 times [2025-02-08 14:08:56,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:56,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130870248] [2025-02-08 14:08:56,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:56,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:56,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 14:08:56,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 14:08:56,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:56,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:56,665 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 14:08:56,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:56,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130870248] [2025-02-08 14:08:56,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130870248] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:08:56,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079133870] [2025-02-08 14:08:56,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:56,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:08:56,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:08:56,667 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:56,669 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:56,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 14:08:56,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 14:08:56,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:56,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:56,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:08:56,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:08:56,767 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 14:08:56,767 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:08:56,795 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 14:08:56,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079133870] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:08:56,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:08:56,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-08 14:08:56,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608751534] [2025-02-08 14:08:56,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:08:56,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 14:08:56,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:56,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 14:08:56,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-08 14:08:56,827 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 137 [2025-02-08 14:08:56,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 192 transitions, 974 flow. Second operand has 12 states, 12 states have (on average 74.16666666666667) internal successors, (890), 12 states have internal predecessors, (890), 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,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:56,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 137 [2025-02-08 14:08:56,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:08:58,072 INFO L124 PetriNetUnfolderBase]: 7369/15232 cut-off events. [2025-02-08 14:08:58,072 INFO L125 PetriNetUnfolderBase]: For 459/459 co-relation queries the response was YES. [2025-02-08 14:08:58,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26078 conditions, 15232 events. 7369/15232 cut-off events. For 459/459 co-relation queries the response was YES. Maximal size of possible extension queue 886. Compared 145718 event pairs, 5464 based on Foata normal form. 15/11987 useless extension candidates. Maximal degree in co-relation 26063. Up to 10136 conditions per place. [2025-02-08 14:08:58,147 INFO L140 encePairwiseOnDemand]: 122/137 looper letters, 116 selfloop transitions, 70 changer transitions 0/237 dead transitions. [2025-02-08 14:08:58,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 237 transitions, 1625 flow [2025-02-08 14:08:58,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 14:08:58,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 14:08:58,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 825 transitions. [2025-02-08 14:08:58,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6021897810218978 [2025-02-08 14:08:58,150 INFO L175 Difference]: Start difference. First operand has 147 places, 192 transitions, 974 flow. Second operand 10 states and 825 transitions. [2025-02-08 14:08:58,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 237 transitions, 1625 flow [2025-02-08 14:08:58,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 237 transitions, 1493 flow, removed 41 selfloop flow, removed 4 redundant places. [2025-02-08 14:08:58,155 INFO L231 Difference]: Finished difference. Result has 155 places, 237 transitions, 1339 flow [2025-02-08 14:08:58,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1339, PETRI_PLACES=155, PETRI_TRANSITIONS=237} [2025-02-08 14:08:58,155 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 25 predicate places. [2025-02-08 14:08:58,155 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 237 transitions, 1339 flow [2025-02-08 14:08:58,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 74.16666666666667) internal successors, (890), 12 states have internal predecessors, (890), 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,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:08:58,156 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,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 14:08:58,356 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,SelfDestructingSolverStorable15 [2025-02-08 14:08:58,357 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-02-08 14:08:58,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:08:58,357 INFO L85 PathProgramCache]: Analyzing trace with hash -832242736, now seen corresponding path program 1 times [2025-02-08 14:08:58,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:08:58,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403463320] [2025-02-08 14:08:58,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:08:58,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:08:58,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 14:08:58,384 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,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:08:58,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:08:58,459 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:58,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:08:58,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403463320] [2025-02-08 14:08:58,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403463320] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:08:58,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:08:58,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:08:58,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601349274] [2025-02-08 14:08:58,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:08:58,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:08:58,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:08:58,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:08:58,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:08:58,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 137 [2025-02-08 14:08:58,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 237 transitions, 1339 flow. Second operand has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 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,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:08:58,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 137 [2025-02-08 14:08:58,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:00,242 INFO L124 PetriNetUnfolderBase]: 15289/28114 cut-off events. [2025-02-08 14:09:00,242 INFO L125 PetriNetUnfolderBase]: For 514/514 co-relation queries the response was YES. [2025-02-08 14:09:00,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50243 conditions, 28114 events. 15289/28114 cut-off events. For 514/514 co-relation queries the response was YES. Maximal size of possible extension queue 1564. Compared 265723 event pairs, 4946 based on Foata normal form. 728/23416 useless extension candidates. Maximal degree in co-relation 50225. Up to 9562 conditions per place. [2025-02-08 14:09:00,353 INFO L140 encePairwiseOnDemand]: 130/137 looper letters, 230 selfloop transitions, 4 changer transitions 0/282 dead transitions. [2025-02-08 14:09:00,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 282 transitions, 1903 flow [2025-02-08 14:09:00,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:09:00,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:09:00,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 399 transitions. [2025-02-08 14:09:00,354 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7281021897810219 [2025-02-08 14:09:00,354 INFO L175 Difference]: Start difference. First operand has 155 places, 237 transitions, 1339 flow. Second operand 4 states and 399 transitions. [2025-02-08 14:09:00,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 282 transitions, 1903 flow [2025-02-08 14:09:00,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 282 transitions, 1843 flow, removed 15 selfloop flow, removed 2 redundant places. [2025-02-08 14:09:00,360 INFO L231 Difference]: Finished difference. Result has 158 places, 238 transitions, 1305 flow [2025-02-08 14:09:00,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=1277, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1305, PETRI_PLACES=158, PETRI_TRANSITIONS=238} [2025-02-08 14:09:00,360 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 28 predicate places. [2025-02-08 14:09:00,360 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 238 transitions, 1305 flow [2025-02-08 14:09:00,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.0) internal successors, (312), 4 states have internal predecessors, (312), 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,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:00,361 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:00,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 14:09:00,361 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-02-08 14:09:00,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:00,361 INFO L85 PathProgramCache]: Analyzing trace with hash -29719743, now seen corresponding path program 1 times [2025-02-08 14:09:00,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:00,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346586067] [2025-02-08 14:09:00,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:00,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:00,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 14:09:00,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 14:09:00,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:00,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:00,457 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:09:00,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:00,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346586067] [2025-02-08 14:09:00,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346586067] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:00,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:00,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:09:00,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056484353] [2025-02-08 14:09:00,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:00,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:09:00,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:00,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:09:00,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:09:00,468 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 137 [2025-02-08 14:09:00,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 238 transitions, 1305 flow. Second operand has 4 states, 4 states have (on average 79.5) internal successors, (318), 4 states have internal predecessors, (318), 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,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:00,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 137 [2025-02-08 14:09:00,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:01,702 INFO L124 PetriNetUnfolderBase]: 9903/20812 cut-off events. [2025-02-08 14:09:01,702 INFO L125 PetriNetUnfolderBase]: For 2689/3221 co-relation queries the response was YES. [2025-02-08 14:09:01,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37409 conditions, 20812 events. 9903/20812 cut-off events. For 2689/3221 co-relation queries the response was YES. Maximal size of possible extension queue 1192. Compared 211446 event pairs, 7818 based on Foata normal form. 272/17128 useless extension candidates. Maximal degree in co-relation 37388. Up to 13795 conditions per place. [2025-02-08 14:09:01,817 INFO L140 encePairwiseOnDemand]: 133/137 looper letters, 177 selfloop transitions, 5 changer transitions 0/236 dead transitions. [2025-02-08 14:09:01,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 236 transitions, 1658 flow [2025-02-08 14:09:01,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:09:01,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:09:01,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 356 transitions. [2025-02-08 14:09:01,819 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6496350364963503 [2025-02-08 14:09:01,819 INFO L175 Difference]: Start difference. First operand has 158 places, 238 transitions, 1305 flow. Second operand 4 states and 356 transitions. [2025-02-08 14:09:01,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 236 transitions, 1658 flow [2025-02-08 14:09:01,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 236 transitions, 1658 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:09:01,828 INFO L231 Difference]: Finished difference. Result has 161 places, 236 transitions, 1304 flow [2025-02-08 14:09:01,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=1294, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1304, PETRI_PLACES=161, PETRI_TRANSITIONS=236} [2025-02-08 14:09:01,829 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 31 predicate places. [2025-02-08 14:09:01,829 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 236 transitions, 1304 flow [2025-02-08 14:09:01,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.5) internal successors, (318), 4 states have internal predecessors, (318), 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:01,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:01,829 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:01,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 14:09:01,829 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-02-08 14:09:01,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:01,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1739490863, now seen corresponding path program 1 times [2025-02-08 14:09:01,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:01,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475941743] [2025-02-08 14:09:01,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:01,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:01,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 14:09:01,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 14:09:01,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:01,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:01,929 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:01,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:01,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475941743] [2025-02-08 14:09:01,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475941743] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:01,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:01,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:09:01,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559173120] [2025-02-08 14:09:01,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:01,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:09:01,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:01,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:09:01,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:09:01,938 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 137 [2025-02-08 14:09:01,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 236 transitions, 1304 flow. Second operand has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 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:01,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:01,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 137 [2025-02-08 14:09:01,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:03,500 INFO L124 PetriNetUnfolderBase]: 9901/20810 cut-off events. [2025-02-08 14:09:03,500 INFO L125 PetriNetUnfolderBase]: For 2699/3231 co-relation queries the response was YES. [2025-02-08 14:09:03,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37407 conditions, 20810 events. 9901/20810 cut-off events. For 2699/3231 co-relation queries the response was YES. Maximal size of possible extension queue 1192. Compared 211328 event pairs, 7818 based on Foata normal form. 272/17126 useless extension candidates. Maximal degree in co-relation 37384. Up to 13793 conditions per place. [2025-02-08 14:09:03,630 INFO L140 encePairwiseOnDemand]: 133/137 looper letters, 175 selfloop transitions, 5 changer transitions 0/234 dead transitions. [2025-02-08 14:09:03,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 234 transitions, 1653 flow [2025-02-08 14:09:03,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:09:03,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:09:03,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 356 transitions. [2025-02-08 14:09:03,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6496350364963503 [2025-02-08 14:09:03,632 INFO L175 Difference]: Start difference. First operand has 161 places, 236 transitions, 1304 flow. Second operand 4 states and 356 transitions. [2025-02-08 14:09:03,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 234 transitions, 1653 flow [2025-02-08 14:09:03,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 234 transitions, 1647 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:09:03,639 INFO L231 Difference]: Finished difference. Result has 162 places, 234 transitions, 1297 flow [2025-02-08 14:09:03,639 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1297, PETRI_PLACES=162, PETRI_TRANSITIONS=234} [2025-02-08 14:09:03,640 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 32 predicate places. [2025-02-08 14:09:03,640 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 234 transitions, 1297 flow [2025-02-08 14:09:03,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 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:03,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:03,640 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:03,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 14:09:03,640 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-02-08 14:09:03,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:03,641 INFO L85 PathProgramCache]: Analyzing trace with hash -2071271491, now seen corresponding path program 2 times [2025-02-08 14:09:03,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:03,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218647737] [2025-02-08 14:09:03,641 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:09:03,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:03,651 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-08 14:09:03,655 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 39 statements. [2025-02-08 14:09:03,656 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:09:03,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:03,703 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-08 14:09:03,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:03,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218647737] [2025-02-08 14:09:03,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218647737] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:09:03,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263071501] [2025-02-08 14:09:03,703 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:09:03,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:03,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:03,705 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:09:03,707 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:09:03,776 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-08 14:09:03,793 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 39 statements. [2025-02-08 14:09:03,793 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:09:03,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:03,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:09:03,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:09:03,831 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-08 14:09:03,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:09:03,874 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-08 14:09:03,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263071501] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:09:03,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:09:03,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 4 [2025-02-08 14:09:03,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798562503] [2025-02-08 14:09:03,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:09:03,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:09:03,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:03,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:09:03,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:09:03,898 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 137 [2025-02-08 14:09:03,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 234 transitions, 1297 flow. Second operand has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 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:03,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:03,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 137 [2025-02-08 14:09:03,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:05,571 INFO L124 PetriNetUnfolderBase]: 9901/20805 cut-off events. [2025-02-08 14:09:05,571 INFO L125 PetriNetUnfolderBase]: For 2723/3255 co-relation queries the response was YES. [2025-02-08 14:09:05,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37384 conditions, 20805 events. 9901/20805 cut-off events. For 2723/3255 co-relation queries the response was YES. Maximal size of possible extension queue 1191. Compared 211187 event pairs, 7818 based on Foata normal form. 275/17124 useless extension candidates. Maximal degree in co-relation 37361. Up to 13739 conditions per place. [2025-02-08 14:09:05,667 INFO L140 encePairwiseOnDemand]: 121/137 looper letters, 98 selfloop transitions, 82 changer transitions 0/231 dead transitions. [2025-02-08 14:09:05,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 231 transitions, 1627 flow [2025-02-08 14:09:05,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:09:05,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:09:05,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 400 transitions. [2025-02-08 14:09:05,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.583941605839416 [2025-02-08 14:09:05,668 INFO L175 Difference]: Start difference. First operand has 162 places, 234 transitions, 1297 flow. Second operand 5 states and 400 transitions. [2025-02-08 14:09:05,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 231 transitions, 1627 flow [2025-02-08 14:09:05,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 231 transitions, 1569 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-02-08 14:09:05,678 INFO L231 Difference]: Finished difference. Result has 157 places, 231 transitions, 1373 flow [2025-02-08 14:09:05,678 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1373, PETRI_PLACES=157, PETRI_TRANSITIONS=231} [2025-02-08 14:09:05,679 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 27 predicate places. [2025-02-08 14:09:05,679 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 231 transitions, 1373 flow [2025-02-08 14:09:05,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 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,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:05,679 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, 1, 1, 1] [2025-02-08 14:09:05,685 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:09:05,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:05,883 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-02-08 14:09:05,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:05,883 INFO L85 PathProgramCache]: Analyzing trace with hash 847798325, now seen corresponding path program 1 times [2025-02-08 14:09:05,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:05,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509785143] [2025-02-08 14:09:05,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:05,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:05,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 14:09:05,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 14:09:05,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:05,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:05,973 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 14:09:05,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:05,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509785143] [2025-02-08 14:09:05,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509785143] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:05,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:05,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:09:05,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16424824] [2025-02-08 14:09:05,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:05,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:09:05,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:05,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:09:05,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:09:05,983 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 137 [2025-02-08 14:09:05,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 231 transitions, 1373 flow. Second operand has 4 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 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,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:05,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 137 [2025-02-08 14:09:05,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:07,092 INFO L124 PetriNetUnfolderBase]: 9899/20803 cut-off events. [2025-02-08 14:09:07,092 INFO L125 PetriNetUnfolderBase]: For 2746/3278 co-relation queries the response was YES. [2025-02-08 14:09:07,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37423 conditions, 20803 events. 9899/20803 cut-off events. For 2746/3278 co-relation queries the response was YES. Maximal size of possible extension queue 1191. Compared 211040 event pairs, 7818 based on Foata normal form. 271/17112 useless extension candidates. Maximal degree in co-relation 37404. Up to 13791 conditions per place. [2025-02-08 14:09:07,238 INFO L140 encePairwiseOnDemand]: 133/137 looper letters, 173 selfloop transitions, 5 changer transitions 0/229 dead transitions. [2025-02-08 14:09:07,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 229 transitions, 1714 flow [2025-02-08 14:09:07,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:09:07,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:09:07,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 356 transitions. [2025-02-08 14:09:07,239 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6496350364963503 [2025-02-08 14:09:07,239 INFO L175 Difference]: Start difference. First operand has 157 places, 231 transitions, 1373 flow. Second operand 4 states and 356 transitions. [2025-02-08 14:09:07,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 229 transitions, 1714 flow [2025-02-08 14:09:07,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 229 transitions, 1554 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 14:09:07,247 INFO L231 Difference]: Finished difference. Result has 156 places, 229 transitions, 1208 flow [2025-02-08 14:09:07,248 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=1198, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1208, PETRI_PLACES=156, PETRI_TRANSITIONS=229} [2025-02-08 14:09:07,248 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 26 predicate places. [2025-02-08 14:09:07,248 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 229 transitions, 1208 flow [2025-02-08 14:09:07,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 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:07,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:07,249 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, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:07,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 14:09:07,249 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-02-08 14:09:07,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:07,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1820952083, now seen corresponding path program 1 times [2025-02-08 14:09:07,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:07,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14292558] [2025-02-08 14:09:07,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:07,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:07,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 14:09:07,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 14:09:07,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:07,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:07,830 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 14:09:07,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:07,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14292558] [2025-02-08 14:09:07,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14292558] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:09:07,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491000964] [2025-02-08 14:09:07,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:07,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:07,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:07,833 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:09:07,834 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:09:07,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 14:09:07,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 14:09:07,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:07,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:07,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 14:09:07,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:09:07,974 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:08,002 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:08,161 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 14:09:08,162 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:08,200 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:08,429 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 14:09:08,429 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:08,443 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 14:09:08,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:09:08,497 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_373 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_373) c_~get_5~0.base) (+ (* c_~id_3~0 4) c_~get_5~0.offset)) 9223372039002259456)) is different from false [2025-02-08 14:09:08,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:09:08,619 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:08,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:09:08,630 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:08,639 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:08,695 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2025-02-08 14:09:08,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491000964] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:09:08,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:09:08,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-02-08 14:09:08,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354884621] [2025-02-08 14:09:08,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:09:08,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 14:09:08,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:08,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 14:09:08,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=390, Unknown=1, NotChecked=40, Total=506 [2025-02-08 14:09:08,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 137 [2025-02-08 14:09:08,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 229 transitions, 1208 flow. Second operand has 23 states, 23 states have (on average 57.869565217391305) internal successors, (1331), 23 states have internal predecessors, (1331), 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:08,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:08,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 137 [2025-02-08 14:09:08,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:14,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-08 14:09:18,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-08 14:09:27,318 INFO L124 PetriNetUnfolderBase]: 74661/115813 cut-off events. [2025-02-08 14:09:27,318 INFO L125 PetriNetUnfolderBase]: For 10142/10584 co-relation queries the response was YES. [2025-02-08 14:09:27,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234141 conditions, 115813 events. 74661/115813 cut-off events. For 10142/10584 co-relation queries the response was YES. Maximal size of possible extension queue 5105. Compared 1035040 event pairs, 16966 based on Foata normal form. 442/98875 useless extension candidates. Maximal degree in co-relation 234122. Up to 26138 conditions per place. [2025-02-08 14:09:28,091 INFO L140 encePairwiseOnDemand]: 121/137 looper letters, 507 selfloop transitions, 103 changer transitions 0/647 dead transitions. [2025-02-08 14:09:28,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 647 transitions, 4279 flow [2025-02-08 14:09:28,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-08 14:09:28,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-08 14:09:28,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1512 transitions. [2025-02-08 14:09:28,094 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5016589250165893 [2025-02-08 14:09:28,094 INFO L175 Difference]: Start difference. First operand has 156 places, 229 transitions, 1208 flow. Second operand 22 states and 1512 transitions. [2025-02-08 14:09:28,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 647 transitions, 4279 flow [2025-02-08 14:09:28,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 647 transitions, 4265 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:09:28,372 INFO L231 Difference]: Finished difference. Result has 180 places, 282 transitions, 1929 flow [2025-02-08 14:09:28,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=1202, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1929, PETRI_PLACES=180, PETRI_TRANSITIONS=282} [2025-02-08 14:09:28,373 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 50 predicate places. [2025-02-08 14:09:28,373 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 282 transitions, 1929 flow [2025-02-08 14:09:28,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 57.869565217391305) internal successors, (1331), 23 states have internal predecessors, (1331), 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,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:28,374 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:28,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 14:09:28,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:28,575 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-02-08 14:09:28,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:28,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1560819988, now seen corresponding path program 1 times [2025-02-08 14:09:28,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:28,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083305795] [2025-02-08 14:09:28,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:28,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:28,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 14:09:28,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 14:09:28,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:28,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:28,649 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 14:09:28,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:28,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083305795] [2025-02-08 14:09:28,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083305795] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:28,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:28,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:09:28,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196687640] [2025-02-08 14:09:28,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:28,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:09:28,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:28,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:09:28,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:09:28,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 137 [2025-02-08 14:09:28,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 282 transitions, 1929 flow. Second operand has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 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,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:28,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 137 [2025-02-08 14:09:28,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:38,538 INFO L124 PetriNetUnfolderBase]: 68077/125025 cut-off events. [2025-02-08 14:09:38,538 INFO L125 PetriNetUnfolderBase]: For 33704/37328 co-relation queries the response was YES. [2025-02-08 14:09:39,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246458 conditions, 125025 events. 68077/125025 cut-off events. For 33704/37328 co-relation queries the response was YES. Maximal size of possible extension queue 6020. Compared 1403153 event pairs, 25982 based on Foata normal form. 4916/110217 useless extension candidates. Maximal degree in co-relation 246434. Up to 42010 conditions per place. [2025-02-08 14:09:39,530 INFO L140 encePairwiseOnDemand]: 130/137 looper letters, 286 selfloop transitions, 4 changer transitions 0/337 dead transitions. [2025-02-08 14:09:39,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 337 transitions, 2715 flow [2025-02-08 14:09:39,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:09:39,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:09:39,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 397 transitions. [2025-02-08 14:09:39,531 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7244525547445255 [2025-02-08 14:09:39,531 INFO L175 Difference]: Start difference. First operand has 180 places, 282 transitions, 1929 flow. Second operand 4 states and 397 transitions. [2025-02-08 14:09:39,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 337 transitions, 2715 flow [2025-02-08 14:09:39,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 337 transitions, 2711 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:09:39,709 INFO L231 Difference]: Finished difference. Result has 183 places, 283 transitions, 1951 flow [2025-02-08 14:09:39,709 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=1923, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1951, PETRI_PLACES=183, PETRI_TRANSITIONS=283} [2025-02-08 14:09:39,709 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 53 predicate places. [2025-02-08 14:09:39,709 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 283 transitions, 1951 flow [2025-02-08 14:09:39,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 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,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:39,710 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:39,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 14:09:39,710 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 60 more)] === [2025-02-08 14:09:39,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:39,710 INFO L85 PathProgramCache]: Analyzing trace with hash 614910274, now seen corresponding path program 1 times [2025-02-08 14:09:39,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:39,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150957499] [2025-02-08 14:09:39,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:39,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:39,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 14:09:39,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 14:09:39,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:39,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:40,367 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 14:09:40,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:40,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150957499] [2025-02-08 14:09:40,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150957499] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:09:40,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154880829] [2025-02-08 14:09:40,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:40,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:40,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:40,372 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:09:40,373 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:09:40,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 14:09:40,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 14:09:40,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:40,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:40,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-08 14:09:40,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:09:40,532 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:40,571 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:40,755 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 14:09:40,755 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:40,812 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:41,086 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 14:09:41,086 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:41,103 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 14:09:41,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:09:41,188 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_449 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_449) c_~get_5~0.base) (+ (* c_~id_3~0 4) c_~get_5~0.offset)) 4294967296))) is different from false [2025-02-08 14:09:41,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:09:41,327 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:41,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:09:41,337 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:41,341 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:41,421 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2025-02-08 14:09:41,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154880829] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:09:41,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:09:41,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-02-08 14:09:41,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590204545] [2025-02-08 14:09:41,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:09:41,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 14:09:41,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:41,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 14:09:41,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=390, Unknown=1, NotChecked=40, Total=506 [2025-02-08 14:09:41,472 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 137 [2025-02-08 14:09:41,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 283 transitions, 1951 flow. Second operand has 23 states, 23 states have (on average 57.869565217391305) internal successors, (1331), 23 states have internal predecessors, (1331), 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,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:41,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 137 [2025-02-08 14:09:41,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:43,513 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~id_3~0 4) c_~get_5~0.offset))) (and (forall ((v_ArrVal_449 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_449) c_~get_5~0.base) .cse0) 4294967296))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_163| Int)) (or (forall ((v_ArrVal_449 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_163| v_ArrVal_449) c_~get_5~0.base) .cse0) 4294967296))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_163|) 0)))) (<= 0 c_~id_3~0))) is different from false