./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_23-idxsense_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 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/goblint-regression/06-symbeq_23-idxsense_nr.i -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 9205365dcda04af07212d180b1c6367c5de79b6e0d2e09ec11b949fed58626f5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:44:16,876 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:44:16,931 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:44:16,935 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:44:16,936 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:44:16,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:44:16,965 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:44:16,965 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:44:16,967 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:44:16,967 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:44:16,968 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:44:16,968 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:44:16,968 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:44:16,968 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:44:16,969 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:44:16,969 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:44:16,969 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:44:16,969 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:44:16,969 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:44:16,969 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:44:16,970 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:44:16,970 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:44:16,970 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:44:16,970 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:44:16,970 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:44:16,970 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:44:16,970 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:44:16,970 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:44:16,970 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:44:16,970 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:44:16,971 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:44:16,971 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:44:16,971 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:44:16,972 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:44:16,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:44:16,972 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:44:16,972 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:44:16,972 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:44:16,972 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:44:16,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:44:16,972 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:44:16,972 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:44:16,973 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:44:16,973 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:44:16,973 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:44:16,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:44:16,973 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:44:16,973 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:44:16,973 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:44:16,973 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:44:16,974 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 -> 9205365dcda04af07212d180b1c6367c5de79b6e0d2e09ec11b949fed58626f5 [2025-01-10 06:44:17,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:44:17,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:44:17,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:44:17,271 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:44:17,272 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:44:17,274 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_23-idxsense_nr.i [2025-01-10 06:44:18,587 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4c0a6000/15ba2931e55e4a5fa6f9a1b2daf19c17/FLAG18ab20953 [2025-01-10 06:44:18,981 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:44:18,986 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_23-idxsense_nr.i [2025-01-10 06:44:19,006 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4c0a6000/15ba2931e55e4a5fa6f9a1b2daf19c17/FLAG18ab20953 [2025-01-10 06:44:19,170 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4c0a6000/15ba2931e55e4a5fa6f9a1b2daf19c17 [2025-01-10 06:44:19,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:44:19,174 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:44:19,176 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:44:19,176 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:44:19,180 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:44:19,181 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:44:19" (1/1) ... [2025-01-10 06:44:19,183 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18d1488f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:19, skipping insertion in model container [2025-01-10 06:44:19,183 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:44:19" (1/1) ... [2025-01-10 06:44:19,214 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:44:19,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:44:19,565 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:44:19,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:44:19,648 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:44:19,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:19 WrapperNode [2025-01-10 06:44:19,650 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:44:19,651 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:44:19,651 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:44:19,651 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:44:19,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:19" (1/1) ... [2025-01-10 06:44:19,667 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:19" (1/1) ... [2025-01-10 06:44:19,690 INFO L138 Inliner]: procedures = 162, calls = 77, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 112 [2025-01-10 06:44:19,691 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:44:19,695 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:44:19,696 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:44:19,696 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:44:19,703 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:19" (1/1) ... [2025-01-10 06:44:19,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:19" (1/1) ... [2025-01-10 06:44:19,710 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:19" (1/1) ... [2025-01-10 06:44:19,722 INFO L175 MemorySlicer]: Split 66 memory accesses to 2 slices as follows [16, 50]. 76 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [10, 50]. The 3 writes are split as follows [3, 0]. [2025-01-10 06:44:19,722 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:19" (1/1) ... [2025-01-10 06:44:19,723 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:19" (1/1) ... [2025-01-10 06:44:19,729 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:19" (1/1) ... [2025-01-10 06:44:19,730 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:19" (1/1) ... [2025-01-10 06:44:19,733 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:19" (1/1) ... [2025-01-10 06:44:19,734 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:19" (1/1) ... [2025-01-10 06:44:19,735 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:19" (1/1) ... [2025-01-10 06:44:19,737 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:44:19,738 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:44:19,739 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:44:19,739 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:44:19,740 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:19" (1/1) ... [2025-01-10 06:44:19,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:44:19,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:44:19,771 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-01-10 06:44:19,775 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-01-10 06:44:19,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:44:19,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:44:19,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:44:19,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:44:19,791 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 06:44:19,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:44:19,791 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 06:44:19,791 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 06:44:19,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:44:19,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:44:19,791 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 06:44:19,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:44:19,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:44:19,793 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:44:19,894 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:44:19,896 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:44:20,121 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:44:20,122 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:44:20,437 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:44:20,438 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:44:20,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:44:20 BoogieIcfgContainer [2025-01-10 06:44:20,438 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:44:20,441 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:44:20,441 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:44:20,445 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:44:20,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:44:19" (1/3) ... [2025-01-10 06:44:20,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc97d8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:44:20, skipping insertion in model container [2025-01-10 06:44:20,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:19" (2/3) ... [2025-01-10 06:44:20,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc97d8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:44:20, skipping insertion in model container [2025-01-10 06:44:20,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:44:20" (3/3) ... [2025-01-10 06:44:20,448 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_23-idxsense_nr.i [2025-01-10 06:44:20,462 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:44:20,463 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_23-idxsense_nr.i that has 2 procedures, 35 locations, 1 initial locations, 1 loop locations, and 8 error locations. [2025-01-10 06:44:20,463 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:44:20,504 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:44:20,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 35 transitions, 74 flow [2025-01-10 06:44:20,562 INFO L124 PetriNetUnfolderBase]: 1/34 cut-off events. [2025-01-10 06:44:20,565 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:44:20,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 34 events. 1/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 7. Up to 2 conditions per place. [2025-01-10 06:44:20,569 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 35 transitions, 74 flow [2025-01-10 06:44:20,573 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 34 transitions, 71 flow [2025-01-10 06:44:20,586 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:44:20,596 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;@661724f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:44:20,596 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-01-10 06:44:20,601 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:44:20,601 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 06:44:20,601 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:44:20,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:20,602 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 06:44:20,603 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 06:44:20,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:20,607 INFO L85 PathProgramCache]: Analyzing trace with hash 317251, now seen corresponding path program 1 times [2025-01-10 06:44:20,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:20,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59420946] [2025-01-10 06:44:20,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:44:20,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:20,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:44:20,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:44:20,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:44:20,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:20,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:44:20,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:20,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59420946] [2025-01-10 06:44:20,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59420946] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:44:20,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:44:20,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:44:20,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441682759] [2025-01-10 06:44:20,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:44:20,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:44:20,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:20,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:44:20,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:44:20,991 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-01-10 06:44:20,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 34 transitions, 71 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-01-10 06:44:20,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:20,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-01-10 06:44:20,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:21,135 INFO L124 PetriNetUnfolderBase]: 51/171 cut-off events. [2025-01-10 06:44:21,135 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:44:21,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 171 events. 51/171 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 622 event pairs, 50 based on Foata normal form. 1/155 useless extension candidates. Maximal degree in co-relation 275. Up to 123 conditions per place. [2025-01-10 06:44:21,138 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 21 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2025-01-10 06:44:21,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 36 transitions, 123 flow [2025-01-10 06:44:21,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:44:21,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:44:21,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2025-01-10 06:44:21,151 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5642857142857143 [2025-01-10 06:44:21,153 INFO L175 Difference]: Start difference. First operand has 37 places, 34 transitions, 71 flow. Second operand 4 states and 79 transitions. [2025-01-10 06:44:21,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 36 transitions, 123 flow [2025-01-10 06:44:21,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 36 transitions, 122 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:44:21,161 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 94 flow [2025-01-10 06:44:21,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=94, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2025-01-10 06:44:21,168 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2025-01-10 06:44:21,169 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 94 flow [2025-01-10 06:44:21,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-01-10 06:44:21,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:21,170 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 06:44:21,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:44:21,170 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 06:44:21,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:21,171 INFO L85 PathProgramCache]: Analyzing trace with hash 861611044, now seen corresponding path program 1 times [2025-01-10 06:44:21,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:21,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483599473] [2025-01-10 06:44:21,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:44:21,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:21,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:44:21,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:44:21,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:44:21,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:21,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:44:21,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:21,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483599473] [2025-01-10 06:44:21,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483599473] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:44:21,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441265181] [2025-01-10 06:44:21,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:44:21,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:44:21,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:44:21,399 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-01-10 06:44:21,401 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-01-10 06:44:21,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:44:21,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:44:21,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:44:21,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:21,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:44:21,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:44:21,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:44:21,561 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:44:21,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441265181] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:44:21,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:44:21,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 06:44:21,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207975806] [2025-01-10 06:44:21,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:44:21,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:44:21,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:21,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:44:21,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:44:21,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-01-10 06:44:21,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 94 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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-01-10 06:44:21,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:21,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-01-10 06:44:21,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:21,736 INFO L124 PetriNetUnfolderBase]: 51/170 cut-off events. [2025-01-10 06:44:21,736 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:44:21,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309 conditions, 170 events. 51/170 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 621 event pairs, 50 based on Foata normal form. 1/154 useless extension candidates. Maximal degree in co-relation 292. Up to 118 conditions per place. [2025-01-10 06:44:21,738 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 17 selfloop transitions, 6 changer transitions 0/35 dead transitions. [2025-01-10 06:44:21,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 35 transitions, 136 flow [2025-01-10 06:44:21,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:44:21,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:44:21,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2025-01-10 06:44:21,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2025-01-10 06:44:21,742 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 94 flow. Second operand 6 states and 102 transitions. [2025-01-10 06:44:21,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 35 transitions, 136 flow [2025-01-10 06:44:21,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 134 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:44:21,744 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 100 flow [2025-01-10 06:44:21,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=100, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2025-01-10 06:44:21,746 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 7 predicate places. [2025-01-10 06:44:21,746 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 100 flow [2025-01-10 06:44:21,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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-01-10 06:44:21,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:21,746 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-01-10 06:44:21,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 06:44:21,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:44:21,947 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 06:44:21,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:21,948 INFO L85 PathProgramCache]: Analyzing trace with hash 940138912, now seen corresponding path program 1 times [2025-01-10 06:44:21,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:21,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941627417] [2025-01-10 06:44:21,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:44:21,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:21,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:44:21,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:44:21,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:44:21,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:22,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:44:22,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:22,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941627417] [2025-01-10 06:44:22,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941627417] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:44:22,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:44:22,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:44:22,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192450968] [2025-01-10 06:44:22,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:44:22,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:44:22,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:22,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:44:22,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:44:22,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-01-10 06:44:22,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-01-10 06:44:22,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:22,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-01-10 06:44:22,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:22,088 INFO L124 PetriNetUnfolderBase]: 51/169 cut-off events. [2025-01-10 06:44:22,088 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 06:44:22,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 169 events. 51/169 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 621 event pairs, 50 based on Foata normal form. 1/154 useless extension candidates. Maximal degree in co-relation 288. Up to 121 conditions per place. [2025-01-10 06:44:22,090 INFO L140 encePairwiseOnDemand]: 32/35 looper letters, 18 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2025-01-10 06:44:22,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 34 transitions, 140 flow [2025-01-10 06:44:22,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:44:22,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:44:22,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2025-01-10 06:44:22,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-01-10 06:44:22,091 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 100 flow. Second operand 3 states and 60 transitions. [2025-01-10 06:44:22,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 34 transitions, 140 flow [2025-01-10 06:44:22,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 34 transitions, 118 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-01-10 06:44:22,093 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 82 flow [2025-01-10 06:44:22,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2025-01-10 06:44:22,094 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2025-01-10 06:44:22,094 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 82 flow [2025-01-10 06:44:22,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-01-10 06:44:22,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:22,094 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:22,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:44:22,095 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 06:44:22,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:22,095 INFO L85 PathProgramCache]: Analyzing trace with hash 252385763, now seen corresponding path program 1 times [2025-01-10 06:44:22,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:22,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115870074] [2025-01-10 06:44:22,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:44:22,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:22,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:44:22,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:44:22,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:44:22,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:22,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:44:22,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:22,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115870074] [2025-01-10 06:44:22,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115870074] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:44:22,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49356832] [2025-01-10 06:44:22,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:44:22,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:44:22,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:44:22,222 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-01-10 06:44:22,224 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-01-10 06:44:22,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:44:22,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:44:22,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:44:22,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:22,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:44:22,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:44:22,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:44:22,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:44:22,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:44:22,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49356832] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:44:22,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:44:22,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-10 06:44:22,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978625583] [2025-01-10 06:44:22,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:44:22,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:44:22,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:22,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:44:22,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:44:22,369 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-01-10 06:44:22,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 82 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 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-01-10 06:44:22,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:22,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-01-10 06:44:22,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:22,498 INFO L124 PetriNetUnfolderBase]: 51/173 cut-off events. [2025-01-10 06:44:22,499 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-01-10 06:44:22,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 173 events. 51/173 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 618 event pairs, 50 based on Foata normal form. 2/160 useless extension candidates. Maximal degree in co-relation 281. Up to 119 conditions per place. [2025-01-10 06:44:22,500 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 18 selfloop transitions, 7 changer transitions 0/37 dead transitions. [2025-01-10 06:44:22,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 37 transitions, 147 flow [2025-01-10 06:44:22,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:44:22,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:44:22,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2025-01-10 06:44:22,503 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4816326530612245 [2025-01-10 06:44:22,503 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 82 flow. Second operand 7 states and 118 transitions. [2025-01-10 06:44:22,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 37 transitions, 147 flow [2025-01-10 06:44:22,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 37 transitions, 133 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:44:22,505 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 108 flow [2025-01-10 06:44:22,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=108, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2025-01-10 06:44:22,506 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 8 predicate places. [2025-01-10 06:44:22,506 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 108 flow [2025-01-10 06:44:22,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 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-01-10 06:44:22,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:22,508 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:22,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 06:44:22,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:44:22,713 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 06:44:22,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:22,713 INFO L85 PathProgramCache]: Analyzing trace with hash -149412477, now seen corresponding path program 2 times [2025-01-10 06:44:22,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:22,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654085773] [2025-01-10 06:44:22,717 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:44:22,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:22,728 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-10 06:44:22,732 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 16 statements. [2025-01-10 06:44:22,732 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:44:22,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:22,826 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 06:44:22,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:22,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654085773] [2025-01-10 06:44:22,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654085773] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:44:22,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:44:22,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:44:22,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873035512] [2025-01-10 06:44:22,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:44:22,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:44:22,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:22,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:44:22,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:44:22,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-01-10 06:44:22,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-01-10 06:44:22,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:22,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-01-10 06:44:22,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:22,937 INFO L124 PetriNetUnfolderBase]: 57/169 cut-off events. [2025-01-10 06:44:22,937 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-10 06:44:22,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 332 conditions, 169 events. 57/169 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 571 event pairs, 19 based on Foata normal form. 11/173 useless extension candidates. Maximal degree in co-relation 294. Up to 91 conditions per place. [2025-01-10 06:44:22,940 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 39 selfloop transitions, 4 changer transitions 6/59 dead transitions. [2025-01-10 06:44:22,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 250 flow [2025-01-10 06:44:22,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:44:22,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:44:22,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2025-01-10 06:44:22,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6457142857142857 [2025-01-10 06:44:22,942 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 108 flow. Second operand 5 states and 113 transitions. [2025-01-10 06:44:22,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 250 flow [2025-01-10 06:44:22,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:44:22,944 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 129 flow [2025-01-10 06:44:22,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=129, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2025-01-10 06:44:22,948 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 13 predicate places. [2025-01-10 06:44:22,948 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 129 flow [2025-01-10 06:44:22,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-01-10 06:44:22,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:22,949 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:22,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:44:22,949 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 06:44:22,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:22,950 INFO L85 PathProgramCache]: Analyzing trace with hash -149743076, now seen corresponding path program 1 times [2025-01-10 06:44:22,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:22,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029249429] [2025-01-10 06:44:22,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:44:22,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:22,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:44:22,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:44:22,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:44:22,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:23,028 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 06:44:23,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:23,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029249429] [2025-01-10 06:44:23,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029249429] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:44:23,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:44:23,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:44:23,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207799891] [2025-01-10 06:44:23,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:44:23,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:44:23,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:23,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:44:23,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:44:23,033 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-01-10 06:44:23,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 129 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-01-10 06:44:23,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:23,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-01-10 06:44:23,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:23,116 INFO L124 PetriNetUnfolderBase]: 41/152 cut-off events. [2025-01-10 06:44:23,116 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-01-10 06:44:23,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 152 events. 41/152 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 526 event pairs, 12 based on Foata normal form. 6/152 useless extension candidates. Maximal degree in co-relation 308. Up to 59 conditions per place. [2025-01-10 06:44:23,117 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 33 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2025-01-10 06:44:23,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 231 flow [2025-01-10 06:44:23,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:44:23,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:44:23,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2025-01-10 06:44:23,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-01-10 06:44:23,119 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 129 flow. Second operand 4 states and 84 transitions. [2025-01-10 06:44:23,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 231 flow [2025-01-10 06:44:23,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 46 transitions, 222 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 06:44:23,121 INFO L231 Difference]: Finished difference. Result has 48 places, 36 transitions, 124 flow [2025-01-10 06:44:23,121 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2025-01-10 06:44:23,121 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 11 predicate places. [2025-01-10 06:44:23,122 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 124 flow [2025-01-10 06:44:23,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-01-10 06:44:23,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:23,122 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:23,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:44:23,122 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 06:44:23,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:23,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1560059552, now seen corresponding path program 1 times [2025-01-10 06:44:23,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:23,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856694005] [2025-01-10 06:44:23,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:44:23,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:23,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 06:44:23,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 06:44:23,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:44:23,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:23,294 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:44:23,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:23,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856694005] [2025-01-10 06:44:23,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856694005] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:44:23,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158409709] [2025-01-10 06:44:23,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:44:23,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:44:23,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:44:23,299 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-01-10 06:44:23,301 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-01-10 06:44:23,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 06:44:23,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 06:44:23,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:44:23,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:23,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 06:44:23,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:44:23,465 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:44:23,465 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:44:23,571 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:44:23,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158409709] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:44:23,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:44:23,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-01-10 06:44:23,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607587152] [2025-01-10 06:44:23,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:44:23,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 06:44:23,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:23,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 06:44:23,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-01-10 06:44:23,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-01-10 06:44:23,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 124 flow. Second operand has 18 states, 18 states have (on average 14.5) internal successors, (261), 18 states have internal predecessors, (261), 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-01-10 06:44:23,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:23,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-01-10 06:44:23,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:23,765 INFO L124 PetriNetUnfolderBase]: 41/161 cut-off events. [2025-01-10 06:44:23,765 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-01-10 06:44:23,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 161 events. 41/161 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 513 event pairs, 40 based on Foata normal form. 4/157 useless extension candidates. Maximal degree in co-relation 287. Up to 100 conditions per place. [2025-01-10 06:44:23,767 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 19 selfloop transitions, 15 changer transitions 0/44 dead transitions. [2025-01-10 06:44:23,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 44 transitions, 240 flow [2025-01-10 06:44:23,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 06:44:23,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-10 06:44:23,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 232 transitions. [2025-01-10 06:44:23,770 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4419047619047619 [2025-01-10 06:44:23,771 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 124 flow. Second operand 15 states and 232 transitions. [2025-01-10 06:44:23,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 44 transitions, 240 flow [2025-01-10 06:44:23,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 44 transitions, 234 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:44:23,774 INFO L231 Difference]: Finished difference. Result has 63 places, 44 transitions, 215 flow [2025-01-10 06:44:23,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=215, PETRI_PLACES=63, PETRI_TRANSITIONS=44} [2025-01-10 06:44:23,775 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 26 predicate places. [2025-01-10 06:44:23,775 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 44 transitions, 215 flow [2025-01-10 06:44:23,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 14.5) internal successors, (261), 18 states have internal predecessors, (261), 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-01-10 06:44:23,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:23,775 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:23,783 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-01-10 06:44:23,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:44:23,976 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 06:44:23,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:23,977 INFO L85 PathProgramCache]: Analyzing trace with hash 137534944, now seen corresponding path program 2 times [2025-01-10 06:44:23,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:23,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128498165] [2025-01-10 06:44:23,977 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:44:23,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:23,989 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-01-10 06:44:23,994 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 34 statements. [2025-01-10 06:44:23,996 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:44:23,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:24,095 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-10 06:44:24,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:24,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128498165] [2025-01-10 06:44:24,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128498165] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:44:24,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:44:24,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:44:24,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007627768] [2025-01-10 06:44:24,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:44:24,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:44:24,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:24,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:44:24,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:44:24,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-01-10 06:44:24,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 44 transitions, 215 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-01-10 06:44:24,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:24,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-01-10 06:44:24,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:24,191 INFO L124 PetriNetUnfolderBase]: 44/158 cut-off events. [2025-01-10 06:44:24,191 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2025-01-10 06:44:24,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 158 events. 44/158 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 473 event pairs, 20 based on Foata normal form. 12/169 useless extension candidates. Maximal degree in co-relation 288. Up to 69 conditions per place. [2025-01-10 06:44:24,193 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 41 selfloop transitions, 4 changer transitions 4/57 dead transitions. [2025-01-10 06:44:24,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 57 transitions, 345 flow [2025-01-10 06:44:24,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:44:24,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:44:24,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2025-01-10 06:44:24,194 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-01-10 06:44:24,194 INFO L175 Difference]: Start difference. First operand has 63 places, 44 transitions, 215 flow. Second operand 5 states and 105 transitions. [2025-01-10 06:44:24,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 57 transitions, 345 flow [2025-01-10 06:44:24,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 57 transitions, 335 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-01-10 06:44:24,197 INFO L231 Difference]: Finished difference. Result has 66 places, 45 transitions, 230 flow [2025-01-10 06:44:24,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=230, PETRI_PLACES=66, PETRI_TRANSITIONS=45} [2025-01-10 06:44:24,198 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 29 predicate places. [2025-01-10 06:44:24,198 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 45 transitions, 230 flow [2025-01-10 06:44:24,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-01-10 06:44:24,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:24,199 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:24,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:44:24,199 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 06:44:24,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:24,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1920295733, now seen corresponding path program 1 times [2025-01-10 06:44:24,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:24,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991898836] [2025-01-10 06:44:24,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:44:24,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:24,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 06:44:24,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 06:44:24,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:44:24,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:24,452 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-10 06:44:24,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:24,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991898836] [2025-01-10 06:44:24,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991898836] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:44:24,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:44:24,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:44:24,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392409223] [2025-01-10 06:44:24,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:44:24,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:44:24,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:24,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:44:24,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:44:24,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-01-10 06:44:24,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 45 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-01-10 06:44:24,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:24,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-01-10 06:44:24,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:24,627 INFO L124 PetriNetUnfolderBase]: 46/156 cut-off events. [2025-01-10 06:44:24,627 INFO L125 PetriNetUnfolderBase]: For 134/135 co-relation queries the response was YES. [2025-01-10 06:44:24,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 156 events. 46/156 cut-off events. For 134/135 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 450 event pairs, 13 based on Foata normal form. 4/160 useless extension candidates. Maximal degree in co-relation 388. Up to 40 conditions per place. [2025-01-10 06:44:24,629 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 48 selfloop transitions, 5 changer transitions 1/60 dead transitions. [2025-01-10 06:44:24,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 60 transitions, 368 flow [2025-01-10 06:44:24,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:44:24,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:44:24,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2025-01-10 06:44:24,631 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2025-01-10 06:44:24,631 INFO L175 Difference]: Start difference. First operand has 66 places, 45 transitions, 230 flow. Second operand 6 states and 108 transitions. [2025-01-10 06:44:24,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 60 transitions, 368 flow [2025-01-10 06:44:24,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 60 transitions, 363 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 06:44:24,635 INFO L231 Difference]: Finished difference. Result has 67 places, 44 transitions, 229 flow [2025-01-10 06:44:24,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=229, PETRI_PLACES=67, PETRI_TRANSITIONS=44} [2025-01-10 06:44:24,636 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 30 predicate places. [2025-01-10 06:44:24,636 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 44 transitions, 229 flow [2025-01-10 06:44:24,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-01-10 06:44:24,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:24,636 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:24,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:44:24,637 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 06:44:24,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:24,638 INFO L85 PathProgramCache]: Analyzing trace with hash -201222784, now seen corresponding path program 1 times [2025-01-10 06:44:24,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:24,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261952463] [2025-01-10 06:44:24,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:44:24,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:24,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 06:44:24,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 06:44:24,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:44:24,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:24,880 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-10 06:44:24,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:24,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261952463] [2025-01-10 06:44:24,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261952463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:44:24,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:44:24,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:44:24,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252508428] [2025-01-10 06:44:24,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:44:24,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:44:24,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:24,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:44:24,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:44:24,895 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-01-10 06:44:24,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 44 transitions, 229 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-01-10 06:44:24,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:24,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-01-10 06:44:24,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:25,026 INFO L124 PetriNetUnfolderBase]: 48/158 cut-off events. [2025-01-10 06:44:25,027 INFO L125 PetriNetUnfolderBase]: For 175/175 co-relation queries the response was YES. [2025-01-10 06:44:25,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 158 events. 48/158 cut-off events. For 175/175 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 438 event pairs, 27 based on Foata normal form. 3/160 useless extension candidates. Maximal degree in co-relation 335. Up to 85 conditions per place. [2025-01-10 06:44:25,028 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 42 selfloop transitions, 7 changer transitions 3/57 dead transitions. [2025-01-10 06:44:25,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 57 transitions, 367 flow [2025-01-10 06:44:25,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:44:25,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:44:25,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2025-01-10 06:44:25,032 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-01-10 06:44:25,032 INFO L175 Difference]: Start difference. First operand has 67 places, 44 transitions, 229 flow. Second operand 6 states and 98 transitions. [2025-01-10 06:44:25,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 57 transitions, 367 flow [2025-01-10 06:44:25,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 57 transitions, 352 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-01-10 06:44:25,034 INFO L231 Difference]: Finished difference. Result has 67 places, 43 transitions, 227 flow [2025-01-10 06:44:25,034 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=227, PETRI_PLACES=67, PETRI_TRANSITIONS=43} [2025-01-10 06:44:25,035 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 30 predicate places. [2025-01-10 06:44:25,035 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 43 transitions, 227 flow [2025-01-10 06:44:25,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-01-10 06:44:25,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:25,036 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:25,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:44:25,036 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 06:44:25,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:25,037 INFO L85 PathProgramCache]: Analyzing trace with hash 642176042, now seen corresponding path program 1 times [2025-01-10 06:44:25,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:25,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892594938] [2025-01-10 06:44:25,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:44:25,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:25,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-10 06:44:25,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 06:44:25,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:44:25,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:25,355 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:44:25,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:25,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892594938] [2025-01-10 06:44:25,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892594938] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:44:25,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922478784] [2025-01-10 06:44:25,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:44:25,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:44:25,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:44:25,358 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-01-10 06:44:25,361 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-01-10 06:44:25,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-10 06:44:25,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 06:44:25,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:44:25,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:25,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 06:44:25,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:44:25,515 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:44:25,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:44:25,720 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:44:25,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922478784] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:44:25,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:44:25,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 22 [2025-01-10 06:44:25,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638219269] [2025-01-10 06:44:25,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:44:25,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-10 06:44:25,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:25,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 06:44:25,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-01-10 06:44:25,754 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-01-10 06:44:25,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 43 transitions, 227 flow. Second operand has 23 states, 23 states have (on average 14.565217391304348) internal successors, (335), 23 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:44:25,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:25,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-01-10 06:44:25,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:25,988 INFO L124 PetriNetUnfolderBase]: 39/154 cut-off events. [2025-01-10 06:44:25,988 INFO L125 PetriNetUnfolderBase]: For 207/207 co-relation queries the response was YES. [2025-01-10 06:44:25,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430 conditions, 154 events. 39/154 cut-off events. For 207/207 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 403 event pairs, 38 based on Foata normal form. 3/155 useless extension candidates. Maximal degree in co-relation 349. Up to 97 conditions per place. [2025-01-10 06:44:25,989 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 20 selfloop transitions, 21 changer transitions 0/49 dead transitions. [2025-01-10 06:44:25,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 49 transitions, 363 flow [2025-01-10 06:44:25,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-10 06:44:25,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-10 06:44:25,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 315 transitions. [2025-01-10 06:44:25,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-01-10 06:44:25,994 INFO L175 Difference]: Start difference. First operand has 67 places, 43 transitions, 227 flow. Second operand 21 states and 315 transitions. [2025-01-10 06:44:25,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 49 transitions, 363 flow [2025-01-10 06:44:25,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 49 transitions, 356 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:44:25,997 INFO L231 Difference]: Finished difference. Result has 86 places, 49 transitions, 331 flow [2025-01-10 06:44:25,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=331, PETRI_PLACES=86, PETRI_TRANSITIONS=49} [2025-01-10 06:44:25,998 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 49 predicate places. [2025-01-10 06:44:25,998 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 49 transitions, 331 flow [2025-01-10 06:44:26,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 14.565217391304348) internal successors, (335), 23 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:44:26,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:26,001 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:26,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 06:44:26,205 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,SelfDestructingSolverStorable10 [2025-01-10 06:44:26,205 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 06:44:26,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:26,206 INFO L85 PathProgramCache]: Analyzing trace with hash 531011657, now seen corresponding path program 2 times [2025-01-10 06:44:26,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:26,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514493798] [2025-01-10 06:44:26,206 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:44:26,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:26,227 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-01-10 06:44:26,234 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 49 statements. [2025-01-10 06:44:26,234 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:44:26,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:26,377 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:44:26,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:26,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514493798] [2025-01-10 06:44:26,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514493798] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:44:26,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:44:26,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:44:26,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275463516] [2025-01-10 06:44:26,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:44:26,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:44:26,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:26,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:44:26,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:44:26,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-01-10 06:44:26,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 49 transitions, 331 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-01-10 06:44:26,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:26,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-01-10 06:44:26,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:26,511 INFO L124 PetriNetUnfolderBase]: 41/152 cut-off events. [2025-01-10 06:44:26,511 INFO L125 PetriNetUnfolderBase]: For 236/236 co-relation queries the response was YES. [2025-01-10 06:44:26,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 152 events. 41/152 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 397 event pairs, 10 based on Foata normal form. 3/155 useless extension candidates. Maximal degree in co-relation 366. Up to 43 conditions per place. [2025-01-10 06:44:26,512 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 36 selfloop transitions, 3 changer transitions 19/64 dead transitions. [2025-01-10 06:44:26,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 64 transitions, 475 flow [2025-01-10 06:44:26,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:44:26,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:44:26,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2025-01-10 06:44:26,515 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4775510204081633 [2025-01-10 06:44:26,515 INFO L175 Difference]: Start difference. First operand has 86 places, 49 transitions, 331 flow. Second operand 7 states and 117 transitions. [2025-01-10 06:44:26,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 64 transitions, 475 flow [2025-01-10 06:44:26,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 64 transitions, 430 flow, removed 1 selfloop flow, removed 14 redundant places. [2025-01-10 06:44:26,521 INFO L231 Difference]: Finished difference. Result has 77 places, 43 transitions, 265 flow [2025-01-10 06:44:26,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=265, PETRI_PLACES=77, PETRI_TRANSITIONS=43} [2025-01-10 06:44:26,522 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 40 predicate places. [2025-01-10 06:44:26,523 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 43 transitions, 265 flow [2025-01-10 06:44:26,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-01-10 06:44:26,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:26,523 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:26,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:44:26,523 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 06:44:26,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:26,524 INFO L85 PathProgramCache]: Analyzing trace with hash -2054103061, now seen corresponding path program 1 times [2025-01-10 06:44:26,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:26,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303510943] [2025-01-10 06:44:26,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:44:26,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:26,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 06:44:26,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 06:44:26,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:44:26,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:26,779 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:44:26,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:26,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303510943] [2025-01-10 06:44:26,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303510943] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:44:26,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:44:26,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:44:26,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852208697] [2025-01-10 06:44:26,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:44:26,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:44:26,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:26,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:44:26,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:44:26,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-01-10 06:44:26,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 43 transitions, 265 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-01-10 06:44:26,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:26,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-01-10 06:44:26,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:26,863 INFO L124 PetriNetUnfolderBase]: 13/80 cut-off events. [2025-01-10 06:44:26,864 INFO L125 PetriNetUnfolderBase]: For 146/146 co-relation queries the response was YES. [2025-01-10 06:44:26,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 80 events. 13/80 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 6 based on Foata normal form. 3/83 useless extension candidates. Maximal degree in co-relation 236. Up to 43 conditions per place. [2025-01-10 06:44:26,864 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 0 selfloop transitions, 0 changer transitions 46/46 dead transitions. [2025-01-10 06:44:26,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 46 transitions, 349 flow [2025-01-10 06:44:26,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:44:26,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:44:26,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2025-01-10 06:44:26,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41904761904761906 [2025-01-10 06:44:26,865 INFO L175 Difference]: Start difference. First operand has 77 places, 43 transitions, 265 flow. Second operand 6 states and 88 transitions. [2025-01-10 06:44:26,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 46 transitions, 349 flow [2025-01-10 06:44:26,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 46 transitions, 337 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 06:44:26,867 INFO L231 Difference]: Finished difference. Result has 66 places, 0 transitions, 0 flow [2025-01-10 06:44:26,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=66, PETRI_TRANSITIONS=0} [2025-01-10 06:44:26,868 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 29 predicate places. [2025-01-10 06:44:26,868 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 0 transitions, 0 flow [2025-01-10 06:44:26,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-01-10 06:44:26,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 11 remaining) [2025-01-10 06:44:26,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 11 remaining) [2025-01-10 06:44:26,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 11 remaining) [2025-01-10 06:44:26,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 11 remaining) [2025-01-10 06:44:26,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 11 remaining) [2025-01-10 06:44:26,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 11 remaining) [2025-01-10 06:44:26,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 11 remaining) [2025-01-10 06:44:26,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 11 remaining) [2025-01-10 06:44:26,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 11 remaining) [2025-01-10 06:44:26,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 11 remaining) [2025-01-10 06:44:26,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 11 remaining) [2025-01-10 06:44:26,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:44:26,873 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:26,877 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 06:44:26,881 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 06:44:26,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:44:26 BasicIcfg [2025-01-10 06:44:26,887 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 06:44:26,888 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 06:44:26,888 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 06:44:26,888 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 06:44:26,889 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:44:20" (3/4) ... [2025-01-10 06:44:26,891 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 06:44:26,893 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-01-10 06:44:26,900 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 77 nodes and edges [2025-01-10 06:44:26,901 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-01-10 06:44:26,901 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-10 06:44:26,978 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 06:44:26,979 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 06:44:26,979 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 06:44:26,980 INFO L158 Benchmark]: Toolchain (without parser) took 7806.77ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 121.4MB in the beginning and 114.8MB in the end (delta: 6.7MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. [2025-01-10 06:44:26,981 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 201.3MB. Free memory is still 120.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:44:26,981 INFO L158 Benchmark]: CACSL2BoogieTranslator took 474.87ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 100.4MB in the end (delta: 20.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 06:44:26,982 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.85ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 98.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:44:26,984 INFO L158 Benchmark]: Boogie Preprocessor took 42.18ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 96.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:44:26,985 INFO L158 Benchmark]: RCFGBuilder took 700.20ms. Allocated memory is still 167.8MB. Free memory was 96.2MB in the beginning and 95.9MB in the end (delta: 376.8kB). Peak memory consumption was 73.3MB. Max. memory is 16.1GB. [2025-01-10 06:44:26,985 INFO L158 Benchmark]: TraceAbstraction took 6446.45ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 95.0MB in the beginning and 119.0MB in the end (delta: -24.0MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2025-01-10 06:44:26,985 INFO L158 Benchmark]: Witness Printer took 91.01ms. Allocated memory is still 201.3MB. Free memory was 119.0MB in the beginning and 114.8MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:44:26,987 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37ms. Allocated memory is still 201.3MB. Free memory is still 120.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 474.87ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 100.4MB in the end (delta: 20.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.85ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 98.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.18ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 96.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 700.20ms. Allocated memory is still 167.8MB. Free memory was 96.2MB in the beginning and 95.9MB in the end (delta: 376.8kB). Peak memory consumption was 73.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6446.45ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 95.0MB in the beginning and 119.0MB in the end (delta: -24.0MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. * Witness Printer took 91.01ms. Allocated memory is still 201.3MB. Free memory was 119.0MB in the beginning and 114.8MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 688]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 688]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 693]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 693]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 696]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 696]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 683]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 683]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 46 locations, 11 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.3s, OverallIterations: 13, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 297 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 252 mSDsluCounter, 135 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 117 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1285 IncrementalHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 18 mSDtfsCounter, 1285 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 241 GetRequests, 122 SyntacticMatches, 11 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=331occurred in iteration=11, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 408 NumberOfCodeBlocks, 348 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 460 ConstructedInterpolants, 0 QuantifiedInterpolants, 2178 SizeOfPredicates, 13 NumberOfNonLiveVariables, 875 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 540/791 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 06:44:27,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE