./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.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/13-privatized_68-pfscan_protected_loop_minimal_interval_true.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 6aeaf730cbe4eb831d189bfd9925d1660c7714b9e685f389bc2495c0943d6472 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:45:09,800 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:45:09,873 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:45:09,879 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:45:09,882 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:45:09,912 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:45:09,913 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:45:09,913 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:45:09,914 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:45:09,914 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:45:09,914 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:45:09,915 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:45:09,915 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:45:09,915 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:45:09,915 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:45:09,916 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:45:09,916 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:45:09,916 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:45:09,916 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:45:09,916 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:45:09,917 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:45:09,917 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:45:09,917 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:45:09,917 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:45:09,917 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:45:09,917 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:45:09,917 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:45:09,917 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:45:09,917 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:45:09,918 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:45:09,918 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:45:09,918 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:45:09,918 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:45:09,918 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:45:09,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:45:09,919 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:45:09,919 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:45:09,919 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:45:09,919 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:45:09,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:45:09,919 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:45:09,920 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:45:09,920 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:45:09,920 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:45:09,920 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:45:09,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:45:09,920 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:45:09,920 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:45:09,920 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:45:09,920 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:45:09,920 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 -> 6aeaf730cbe4eb831d189bfd9925d1660c7714b9e685f389bc2495c0943d6472 [2025-01-10 06:45:10,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:45:10,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:45:10,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:45:10,203 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:45:10,204 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:45:10,205 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-01-10 06:45:11,482 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ffa017f08/8d2ac5d081854713857f612e2ba03e98/FLAG2037302ee [2025-01-10 06:45:11,875 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:45:11,876 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-01-10 06:45:11,891 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ffa017f08/8d2ac5d081854713857f612e2ba03e98/FLAG2037302ee [2025-01-10 06:45:11,912 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ffa017f08/8d2ac5d081854713857f612e2ba03e98 [2025-01-10 06:45:11,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:45:11,917 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:45:11,919 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:45:11,920 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:45:11,924 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:45:11,925 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:45:11" (1/1) ... [2025-01-10 06:45:11,926 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26d327a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:11, skipping insertion in model container [2025-01-10 06:45:11,926 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:45:11" (1/1) ... [2025-01-10 06:45:11,962 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:45:12,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:45:12,225 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:45:12,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:45:12,291 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:45:12,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:12 WrapperNode [2025-01-10 06:45:12,292 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:45:12,293 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:45:12,293 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:45:12,293 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:45:12,300 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:45:12" (1/1) ... [2025-01-10 06:45:12,312 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:45:12" (1/1) ... [2025-01-10 06:45:12,341 INFO L138 Inliner]: procedures = 165, calls = 35, calls flagged for inlining = 8, calls inlined = 9, statements flattened = 122 [2025-01-10 06:45:12,341 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:45:12,342 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:45:12,343 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:45:12,343 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:45:12,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:12" (1/1) ... [2025-01-10 06:45:12,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:12" (1/1) ... [2025-01-10 06:45:12,360 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:12" (1/1) ... [2025-01-10 06:45:12,377 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6]. The 3 writes are split as follows [0, 3]. [2025-01-10 06:45:12,377 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:12" (1/1) ... [2025-01-10 06:45:12,378 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:12" (1/1) ... [2025-01-10 06:45:12,390 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:12" (1/1) ... [2025-01-10 06:45:12,391 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:12" (1/1) ... [2025-01-10 06:45:12,393 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:12" (1/1) ... [2025-01-10 06:45:12,397 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:12" (1/1) ... [2025-01-10 06:45:12,398 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:12" (1/1) ... [2025-01-10 06:45:12,400 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:45:12,405 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:45:12,405 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:45:12,405 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:45:12,406 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:12" (1/1) ... [2025-01-10 06:45:12,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:45:12,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:45:12,439 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:45:12,441 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:45:12,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:45:12,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:45:12,461 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2025-01-10 06:45:12,462 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2025-01-10 06:45:12,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:45:12,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:45:12,463 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 06:45:12,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:45:12,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:45:12,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:45:12,463 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 06:45:12,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:45:12,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:45:12,465 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:45:12,595 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:45:12,596 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:45:12,819 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:45:12,819 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:45:12,980 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:45:12,981 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 06:45:12,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:45:12 BoogieIcfgContainer [2025-01-10 06:45:12,981 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:45:12,984 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:45:12,985 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:45:12,989 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:45:12,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:45:11" (1/3) ... [2025-01-10 06:45:12,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23495738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:45:12, skipping insertion in model container [2025-01-10 06:45:12,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:12" (2/3) ... [2025-01-10 06:45:12,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23495738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:45:12, skipping insertion in model container [2025-01-10 06:45:12,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:45:12" (3/3) ... [2025-01-10 06:45:12,992 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-01-10 06:45:13,005 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:45:13,007 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i that has 2 procedures, 36 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-01-10 06:45:13,008 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:45:13,062 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:45:13,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 41 transitions, 86 flow [2025-01-10 06:45:13,124 INFO L124 PetriNetUnfolderBase]: 6/40 cut-off events. [2025-01-10 06:45:13,126 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:45:13,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 40 events. 6/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 78 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2025-01-10 06:45:13,129 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 41 transitions, 86 flow [2025-01-10 06:45:13,132 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 40 transitions, 83 flow [2025-01-10 06:45:13,143 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:45:13,155 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;@72ec520d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:45:13,155 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-01-10 06:45:13,179 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:45:13,180 INFO L124 PetriNetUnfolderBase]: 2/19 cut-off events. [2025-01-10 06:45:13,180 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:45:13,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:13,181 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:13,181 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 06:45:13,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:13,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1479977314, now seen corresponding path program 1 times [2025-01-10 06:45:13,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:13,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335914286] [2025-01-10 06:45:13,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:13,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:13,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:45:13,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:45:13,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:13,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:13,644 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:45:13,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:13,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335914286] [2025-01-10 06:45:13,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335914286] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:13,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:13,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:45:13,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125340565] [2025-01-10 06:45:13,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:13,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:45:13,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:13,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:45:13,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:45:13,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-01-10 06:45:13,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 40 transitions, 83 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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:45:13,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:13,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-01-10 06:45:13,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:14,057 INFO L124 PetriNetUnfolderBase]: 363/738 cut-off events. [2025-01-10 06:45:14,057 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:45:14,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1376 conditions, 738 events. 363/738 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3627 event pairs, 35 based on Foata normal form. 64/657 useless extension candidates. Maximal degree in co-relation 1367. Up to 352 conditions per place. [2025-01-10 06:45:14,066 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 72 selfloop transitions, 9 changer transitions 0/93 dead transitions. [2025-01-10 06:45:14,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 93 transitions, 351 flow [2025-01-10 06:45:14,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:45:14,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:45:14,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 173 transitions. [2025-01-10 06:45:14,079 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7032520325203252 [2025-01-10 06:45:14,080 INFO L175 Difference]: Start difference. First operand has 38 places, 40 transitions, 83 flow. Second operand 6 states and 173 transitions. [2025-01-10 06:45:14,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 93 transitions, 351 flow [2025-01-10 06:45:14,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 93 transitions, 350 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:45:14,089 INFO L231 Difference]: Finished difference. Result has 45 places, 47 transitions, 148 flow [2025-01-10 06:45:14,091 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=148, PETRI_PLACES=45, PETRI_TRANSITIONS=47} [2025-01-10 06:45:14,094 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 7 predicate places. [2025-01-10 06:45:14,094 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 47 transitions, 148 flow [2025-01-10 06:45:14,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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:45:14,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:14,095 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:14,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:45:14,095 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 06:45:14,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:14,096 INFO L85 PathProgramCache]: Analyzing trace with hash -624013020, now seen corresponding path program 1 times [2025-01-10 06:45:14,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:14,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263222667] [2025-01-10 06:45:14,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:14,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:14,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:45:14,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:45:14,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:14,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:14,305 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:45:14,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:14,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263222667] [2025-01-10 06:45:14,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263222667] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:14,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:14,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:45:14,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168707632] [2025-01-10 06:45:14,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:14,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:45:14,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:14,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:45:14,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:45:14,314 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-01-10 06:45:14,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 47 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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:45:14,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:14,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-01-10 06:45:14,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:14,583 INFO L124 PetriNetUnfolderBase]: 298/648 cut-off events. [2025-01-10 06:45:14,583 INFO L125 PetriNetUnfolderBase]: For 135/139 co-relation queries the response was YES. [2025-01-10 06:45:14,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1400 conditions, 648 events. 298/648 cut-off events. For 135/139 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3166 event pairs, 26 based on Foata normal form. 22/592 useless extension candidates. Maximal degree in co-relation 1386. Up to 378 conditions per place. [2025-01-10 06:45:14,595 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 66 selfloop transitions, 10 changer transitions 0/90 dead transitions. [2025-01-10 06:45:14,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 90 transitions, 389 flow [2025-01-10 06:45:14,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:45:14,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:45:14,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2025-01-10 06:45:14,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6707317073170732 [2025-01-10 06:45:14,599 INFO L175 Difference]: Start difference. First operand has 45 places, 47 transitions, 148 flow. Second operand 6 states and 165 transitions. [2025-01-10 06:45:14,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 90 transitions, 389 flow [2025-01-10 06:45:14,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 90 transitions, 389 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:45:14,605 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 192 flow [2025-01-10 06:45:14,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2025-01-10 06:45:14,606 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2025-01-10 06:45:14,607 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 192 flow [2025-01-10 06:45:14,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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:45:14,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:14,608 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:14,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:45:14,609 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting workerErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 06:45:14,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:14,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1413723549, now seen corresponding path program 1 times [2025-01-10 06:45:14,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:14,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880037421] [2025-01-10 06:45:14,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:14,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:14,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:45:14,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:45:14,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:14,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:14,724 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:45:14,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:14,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880037421] [2025-01-10 06:45:14,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880037421] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:14,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:14,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:45:14,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017520038] [2025-01-10 06:45:14,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:14,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:45:14,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:14,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:45:14,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:45:14,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-01-10 06:45:14,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 192 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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:45:14,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:14,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-01-10 06:45:14,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:15,050 INFO L124 PetriNetUnfolderBase]: 466/987 cut-off events. [2025-01-10 06:45:15,051 INFO L125 PetriNetUnfolderBase]: For 573/588 co-relation queries the response was YES. [2025-01-10 06:45:15,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2382 conditions, 987 events. 466/987 cut-off events. For 573/588 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5246 event pairs, 94 based on Foata normal form. 32/940 useless extension candidates. Maximal degree in co-relation 2363. Up to 490 conditions per place. [2025-01-10 06:45:15,059 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 93 selfloop transitions, 20 changer transitions 0/124 dead transitions. [2025-01-10 06:45:15,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 124 transitions, 745 flow [2025-01-10 06:45:15,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:45:15,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:45:15,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2025-01-10 06:45:15,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6300813008130082 [2025-01-10 06:45:15,062 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 192 flow. Second operand 6 states and 155 transitions. [2025-01-10 06:45:15,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 124 transitions, 745 flow [2025-01-10 06:45:15,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 124 transitions, 719 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-01-10 06:45:15,070 INFO L231 Difference]: Finished difference. Result has 61 places, 65 transitions, 351 flow [2025-01-10 06:45:15,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=351, PETRI_PLACES=61, PETRI_TRANSITIONS=65} [2025-01-10 06:45:15,071 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 23 predicate places. [2025-01-10 06:45:15,071 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 65 transitions, 351 flow [2025-01-10 06:45:15,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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:45:15,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:15,072 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:15,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:45:15,072 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 06:45:15,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:15,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1620705516, now seen corresponding path program 1 times [2025-01-10 06:45:15,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:15,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136077995] [2025-01-10 06:45:15,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:15,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:15,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:45:15,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:45:15,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:15,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:15,135 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:45:15,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:15,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136077995] [2025-01-10 06:45:15,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136077995] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:15,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:15,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:45:15,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22310697] [2025-01-10 06:45:15,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:15,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:45:15,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:15,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:45:15,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:45:15,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-01-10 06:45:15,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 65 transitions, 351 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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:45:15,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:15,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-01-10 06:45:15,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:15,383 INFO L124 PetriNetUnfolderBase]: 605/1279 cut-off events. [2025-01-10 06:45:15,383 INFO L125 PetriNetUnfolderBase]: For 1422/1497 co-relation queries the response was YES. [2025-01-10 06:45:15,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3661 conditions, 1279 events. 605/1279 cut-off events. For 1422/1497 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 7114 event pairs, 214 based on Foata normal form. 61/1290 useless extension candidates. Maximal degree in co-relation 3639. Up to 569 conditions per place. [2025-01-10 06:45:15,396 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 95 selfloop transitions, 5 changer transitions 0/113 dead transitions. [2025-01-10 06:45:15,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 113 transitions, 770 flow [2025-01-10 06:45:15,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:45:15,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:45:15,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2025-01-10 06:45:15,398 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6829268292682927 [2025-01-10 06:45:15,398 INFO L175 Difference]: Start difference. First operand has 61 places, 65 transitions, 351 flow. Second operand 4 states and 112 transitions. [2025-01-10 06:45:15,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 113 transitions, 770 flow [2025-01-10 06:45:15,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 113 transitions, 770 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:45:15,406 INFO L231 Difference]: Finished difference. Result has 66 places, 68 transitions, 386 flow [2025-01-10 06:45:15,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=386, PETRI_PLACES=66, PETRI_TRANSITIONS=68} [2025-01-10 06:45:15,407 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 28 predicate places. [2025-01-10 06:45:15,408 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 68 transitions, 386 flow [2025-01-10 06:45:15,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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:45:15,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:15,408 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:15,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:45:15,408 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting workerErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 06:45:15,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:15,409 INFO L85 PathProgramCache]: Analyzing trace with hash 875757478, now seen corresponding path program 1 times [2025-01-10 06:45:15,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:15,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365288542] [2025-01-10 06:45:15,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:15,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:15,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:45:15,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:45:15,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:15,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:15,500 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:45:15,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:15,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365288542] [2025-01-10 06:45:15,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365288542] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:15,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:15,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:45:15,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915678396] [2025-01-10 06:45:15,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:15,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:45:15,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:15,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:45:15,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:45:15,506 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-01-10 06:45:15,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 68 transitions, 386 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 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:45:15,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:15,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-01-10 06:45:15,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:15,728 INFO L124 PetriNetUnfolderBase]: 358/838 cut-off events. [2025-01-10 06:45:15,728 INFO L125 PetriNetUnfolderBase]: For 958/1004 co-relation queries the response was YES. [2025-01-10 06:45:15,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2464 conditions, 838 events. 358/838 cut-off events. For 958/1004 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4399 event pairs, 122 based on Foata normal form. 38/857 useless extension candidates. Maximal degree in co-relation 2439. Up to 491 conditions per place. [2025-01-10 06:45:15,736 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 59 selfloop transitions, 11 changer transitions 3/88 dead transitions. [2025-01-10 06:45:15,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 88 transitions, 605 flow [2025-01-10 06:45:15,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:45:15,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:45:15,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2025-01-10 06:45:15,739 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6341463414634146 [2025-01-10 06:45:15,741 INFO L175 Difference]: Start difference. First operand has 66 places, 68 transitions, 386 flow. Second operand 5 states and 130 transitions. [2025-01-10 06:45:15,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 88 transitions, 605 flow [2025-01-10 06:45:15,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 88 transitions, 577 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-01-10 06:45:15,751 INFO L231 Difference]: Finished difference. Result has 69 places, 65 transitions, 385 flow [2025-01-10 06:45:15,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=385, PETRI_PLACES=69, PETRI_TRANSITIONS=65} [2025-01-10 06:45:15,752 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 31 predicate places. [2025-01-10 06:45:15,754 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 385 flow [2025-01-10 06:45:15,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 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:45:15,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:15,755 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:15,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:45:15,755 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting workerErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 06:45:15,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:15,755 INFO L85 PathProgramCache]: Analyzing trace with hash -194259701, now seen corresponding path program 1 times [2025-01-10 06:45:15,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:15,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082398648] [2025-01-10 06:45:15,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:15,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:15,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:45:15,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:45:15,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:15,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:15,903 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:45:15,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:15,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082398648] [2025-01-10 06:45:15,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082398648] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:15,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:15,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:45:15,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214893686] [2025-01-10 06:45:15,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:15,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:45:15,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:15,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:45:15,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:45:15,907 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2025-01-10 06:45:15,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 385 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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:45:15,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:15,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2025-01-10 06:45:15,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:16,196 INFO L124 PetriNetUnfolderBase]: 343/807 cut-off events. [2025-01-10 06:45:16,197 INFO L125 PetriNetUnfolderBase]: For 1129/1150 co-relation queries the response was YES. [2025-01-10 06:45:16,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2459 conditions, 807 events. 343/807 cut-off events. For 1129/1150 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 4007 event pairs, 124 based on Foata normal form. 30/835 useless extension candidates. Maximal degree in co-relation 2431. Up to 477 conditions per place. [2025-01-10 06:45:16,205 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 81 selfloop transitions, 14 changer transitions 3/112 dead transitions. [2025-01-10 06:45:16,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 112 transitions, 782 flow [2025-01-10 06:45:16,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:45:16,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 06:45:16,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2025-01-10 06:45:16,207 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5914634146341463 [2025-01-10 06:45:16,207 INFO L175 Difference]: Start difference. First operand has 69 places, 65 transitions, 385 flow. Second operand 8 states and 194 transitions. [2025-01-10 06:45:16,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 112 transitions, 782 flow [2025-01-10 06:45:16,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 112 transitions, 768 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 06:45:16,214 INFO L231 Difference]: Finished difference. Result has 77 places, 66 transitions, 416 flow [2025-01-10 06:45:16,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=416, PETRI_PLACES=77, PETRI_TRANSITIONS=66} [2025-01-10 06:45:16,215 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 39 predicate places. [2025-01-10 06:45:16,215 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 66 transitions, 416 flow [2025-01-10 06:45:16,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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:45:16,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:16,215 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:16,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:45:16,216 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 06:45:16,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:16,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1977416860, now seen corresponding path program 1 times [2025-01-10 06:45:16,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:16,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669614405] [2025-01-10 06:45:16,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:16,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:16,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:45:16,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:45:16,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:16,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:16,555 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:45:16,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:16,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669614405] [2025-01-10 06:45:16,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669614405] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:45:16,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593547338] [2025-01-10 06:45:16,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:16,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:45:16,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:45:16,560 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:45:16,562 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:45:16,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:45:16,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:45:16,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:16,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:16,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-10 06:45:16,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:45:16,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 06:45:16,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-01-10 06:45:16,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 06:45:16,956 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:45:16,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:45:17,188 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:45:17,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593547338] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:45:17,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:45:17,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 19 [2025-01-10 06:45:17,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430883489] [2025-01-10 06:45:17,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:45:17,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-10 06:45:17,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:17,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-10 06:45:17,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2025-01-10 06:45:17,277 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-01-10 06:45:17,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 66 transitions, 416 flow. Second operand has 21 states, 21 states have (on average 14.380952380952381) internal successors, (302), 21 states have internal predecessors, (302), 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:45:17,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:17,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-01-10 06:45:17,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:18,565 INFO L124 PetriNetUnfolderBase]: 1350/2841 cut-off events. [2025-01-10 06:45:18,566 INFO L125 PetriNetUnfolderBase]: For 5781/6078 co-relation queries the response was YES. [2025-01-10 06:45:18,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9401 conditions, 2841 events. 1350/2841 cut-off events. For 5781/6078 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 16751 event pairs, 99 based on Foata normal form. 226/3051 useless extension candidates. Maximal degree in co-relation 9369. Up to 570 conditions per place. [2025-01-10 06:45:18,592 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 333 selfloop transitions, 81 changer transitions 0/428 dead transitions. [2025-01-10 06:45:18,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 428 transitions, 3473 flow [2025-01-10 06:45:18,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-10 06:45:18,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-10 06:45:18,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 521 transitions. [2025-01-10 06:45:18,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6051103368176539 [2025-01-10 06:45:18,595 INFO L175 Difference]: Start difference. First operand has 77 places, 66 transitions, 416 flow. Second operand 21 states and 521 transitions. [2025-01-10 06:45:18,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 428 transitions, 3473 flow [2025-01-10 06:45:18,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 428 transitions, 3205 flow, removed 41 selfloop flow, removed 5 redundant places. [2025-01-10 06:45:18,622 INFO L231 Difference]: Finished difference. Result has 101 places, 152 transitions, 1341 flow [2025-01-10 06:45:18,623 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1341, PETRI_PLACES=101, PETRI_TRANSITIONS=152} [2025-01-10 06:45:18,624 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 63 predicate places. [2025-01-10 06:45:18,624 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 152 transitions, 1341 flow [2025-01-10 06:45:18,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 14.380952380952381) internal successors, (302), 21 states have internal predecessors, (302), 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:45:18,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:18,624 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:18,633 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:45:18,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:45:18,825 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting workerErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 06:45:18,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:18,826 INFO L85 PathProgramCache]: Analyzing trace with hash 756550964, now seen corresponding path program 1 times [2025-01-10 06:45:18,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:18,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260752707] [2025-01-10 06:45:18,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:18,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:18,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 06:45:18,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:45:18,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:18,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:19,115 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:45:19,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:19,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260752707] [2025-01-10 06:45:19,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260752707] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:19,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:19,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:45:19,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77848667] [2025-01-10 06:45:19,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:19,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:45:19,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:19,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:45:19,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:45:19,150 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2025-01-10 06:45:19,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 152 transitions, 1341 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 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:45:19,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:19,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2025-01-10 06:45:19,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:19,906 INFO L124 PetriNetUnfolderBase]: 1658/3505 cut-off events. [2025-01-10 06:45:19,906 INFO L125 PetriNetUnfolderBase]: For 9460/9647 co-relation queries the response was YES. [2025-01-10 06:45:19,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12775 conditions, 3505 events. 1658/3505 cut-off events. For 9460/9647 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 21801 event pairs, 598 based on Foata normal form. 103/3588 useless extension candidates. Maximal degree in co-relation 12735. Up to 2246 conditions per place. [2025-01-10 06:45:19,939 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 224 selfloop transitions, 51 changer transitions 0/288 dead transitions. [2025-01-10 06:45:19,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 288 transitions, 2869 flow [2025-01-10 06:45:19,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 06:45:19,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 06:45:19,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 261 transitions. [2025-01-10 06:45:19,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4896810506566604 [2025-01-10 06:45:19,942 INFO L175 Difference]: Start difference. First operand has 101 places, 152 transitions, 1341 flow. Second operand 13 states and 261 transitions. [2025-01-10 06:45:19,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 288 transitions, 2869 flow [2025-01-10 06:45:19,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 288 transitions, 2532 flow, removed 152 selfloop flow, removed 6 redundant places. [2025-01-10 06:45:19,980 INFO L231 Difference]: Finished difference. Result has 115 places, 187 transitions, 1695 flow [2025-01-10 06:45:19,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1695, PETRI_PLACES=115, PETRI_TRANSITIONS=187} [2025-01-10 06:45:19,984 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 77 predicate places. [2025-01-10 06:45:19,984 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 187 transitions, 1695 flow [2025-01-10 06:45:19,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 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:45:19,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:19,984 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:19,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:45:19,985 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting workerErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 06:45:19,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:19,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1236277334, now seen corresponding path program 2 times [2025-01-10 06:45:19,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:19,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956385342] [2025-01-10 06:45:19,985 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:45:19,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:19,994 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-01-10 06:45:19,999 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:45:19,999 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:45:19,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:20,236 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:45:20,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:20,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956385342] [2025-01-10 06:45:20,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956385342] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:20,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:20,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:45:20,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479978662] [2025-01-10 06:45:20,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:20,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:45:20,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:20,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:45:20,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:45:20,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2025-01-10 06:45:20,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 187 transitions, 1695 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 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:45:20,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:20,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2025-01-10 06:45:20,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:21,309 INFO L124 PetriNetUnfolderBase]: 2210/4711 cut-off events. [2025-01-10 06:45:21,310 INFO L125 PetriNetUnfolderBase]: For 16353/16711 co-relation queries the response was YES. [2025-01-10 06:45:21,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17228 conditions, 4711 events. 2210/4711 cut-off events. For 16353/16711 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 31194 event pairs, 366 based on Foata normal form. 270/4955 useless extension candidates. Maximal degree in co-relation 17182. Up to 2291 conditions per place. [2025-01-10 06:45:21,353 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 265 selfloop transitions, 142 changer transitions 1/421 dead transitions. [2025-01-10 06:45:21,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 421 transitions, 4089 flow [2025-01-10 06:45:21,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-10 06:45:21,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-10 06:45:21,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 353 transitions. [2025-01-10 06:45:21,356 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47831978319783197 [2025-01-10 06:45:21,356 INFO L175 Difference]: Start difference. First operand has 115 places, 187 transitions, 1695 flow. Second operand 18 states and 353 transitions. [2025-01-10 06:45:21,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 421 transitions, 4089 flow [2025-01-10 06:45:21,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 421 transitions, 4084 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:45:21,425 INFO L231 Difference]: Finished difference. Result has 142 places, 287 transitions, 3190 flow [2025-01-10 06:45:21,426 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1692, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3190, PETRI_PLACES=142, PETRI_TRANSITIONS=287} [2025-01-10 06:45:21,426 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 104 predicate places. [2025-01-10 06:45:21,427 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 287 transitions, 3190 flow [2025-01-10 06:45:21,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 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:45:21,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:21,427 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:21,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:45:21,427 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting workerErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 06:45:21,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:21,428 INFO L85 PathProgramCache]: Analyzing trace with hash 150990328, now seen corresponding path program 3 times [2025-01-10 06:45:21,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:21,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840739536] [2025-01-10 06:45:21,428 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:45:21,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:21,436 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-01-10 06:45:21,439 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:45:21,440 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 06:45:21,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:21,622 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:45:21,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:21,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840739536] [2025-01-10 06:45:21,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840739536] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:21,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:21,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:45:21,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062354872] [2025-01-10 06:45:21,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:21,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:45:21,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:21,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:45:21,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:45:21,662 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2025-01-10 06:45:21,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 287 transitions, 3190 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 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:45:21,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:21,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2025-01-10 06:45:21,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:23,015 INFO L124 PetriNetUnfolderBase]: 2857/6101 cut-off events. [2025-01-10 06:45:23,015 INFO L125 PetriNetUnfolderBase]: For 38128/38620 co-relation queries the response was YES. [2025-01-10 06:45:23,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25714 conditions, 6101 events. 2857/6101 cut-off events. For 38128/38620 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 42979 event pairs, 661 based on Foata normal form. 359/6440 useless extension candidates. Maximal degree in co-relation 25656. Up to 2940 conditions per place. [2025-01-10 06:45:23,069 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 345 selfloop transitions, 176 changer transitions 2/536 dead transitions. [2025-01-10 06:45:23,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 536 transitions, 6503 flow [2025-01-10 06:45:23,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 06:45:23,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-10 06:45:23,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 319 transitions. [2025-01-10 06:45:23,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48628048780487804 [2025-01-10 06:45:23,072 INFO L175 Difference]: Start difference. First operand has 142 places, 287 transitions, 3190 flow. Second operand 16 states and 319 transitions. [2025-01-10 06:45:23,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 536 transitions, 6503 flow [2025-01-10 06:45:23,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 536 transitions, 6408 flow, removed 41 selfloop flow, removed 2 redundant places. [2025-01-10 06:45:23,207 INFO L231 Difference]: Finished difference. Result has 163 places, 386 transitions, 5207 flow [2025-01-10 06:45:23,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3123, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=5207, PETRI_PLACES=163, PETRI_TRANSITIONS=386} [2025-01-10 06:45:23,210 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 125 predicate places. [2025-01-10 06:45:23,210 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 386 transitions, 5207 flow [2025-01-10 06:45:23,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 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:45:23,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:23,211 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:23,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:45:23,211 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 06:45:23,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:23,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1170380910, now seen corresponding path program 1 times [2025-01-10 06:45:23,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:23,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992820113] [2025-01-10 06:45:23,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:23,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:23,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 06:45:23,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:45:23,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:23,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:23,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:45:23,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:23,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992820113] [2025-01-10 06:45:23,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992820113] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:23,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:23,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:45:23,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982789212] [2025-01-10 06:45:23,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:23,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:45:23,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:23,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:45:23,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:45:23,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-01-10 06:45:23,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 386 transitions, 5207 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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:45:23,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:23,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-01-10 06:45:23,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:24,302 INFO L124 PetriNetUnfolderBase]: 2723/5889 cut-off events. [2025-01-10 06:45:24,302 INFO L125 PetriNetUnfolderBase]: For 42654/43197 co-relation queries the response was YES. [2025-01-10 06:45:24,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26283 conditions, 5889 events. 2723/5889 cut-off events. For 42654/43197 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 41385 event pairs, 655 based on Foata normal form. 521/6338 useless extension candidates. Maximal degree in co-relation 26217. Up to 2847 conditions per place. [2025-01-10 06:45:24,357 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 402 selfloop transitions, 92 changer transitions 0/510 dead transitions. [2025-01-10 06:45:24,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 510 transitions, 7705 flow [2025-01-10 06:45:24,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:45:24,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:45:24,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2025-01-10 06:45:24,359 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6524390243902439 [2025-01-10 06:45:24,359 INFO L175 Difference]: Start difference. First operand has 163 places, 386 transitions, 5207 flow. Second operand 4 states and 107 transitions. [2025-01-10 06:45:24,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 510 transitions, 7705 flow [2025-01-10 06:45:24,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 510 transitions, 7467 flow, removed 93 selfloop flow, removed 7 redundant places. [2025-01-10 06:45:24,548 INFO L231 Difference]: Finished difference. Result has 161 places, 394 transitions, 5484 flow [2025-01-10 06:45:24,549 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4891, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=5484, PETRI_PLACES=161, PETRI_TRANSITIONS=394} [2025-01-10 06:45:24,549 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 123 predicate places. [2025-01-10 06:45:24,549 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 394 transitions, 5484 flow [2025-01-10 06:45:24,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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:45:24,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:24,550 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:24,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:45:24,550 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 06:45:24,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:24,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1922068386, now seen corresponding path program 1 times [2025-01-10 06:45:24,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:24,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682568081] [2025-01-10 06:45:24,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:24,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:24,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 06:45:24,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 06:45:24,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:24,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:24,797 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:45:24,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:24,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682568081] [2025-01-10 06:45:24,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682568081] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:45:24,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695386138] [2025-01-10 06:45:24,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:24,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:45:24,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:45:24,800 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:45:24,804 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:45:24,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 06:45:24,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 06:45:24,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:24,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:24,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:45:24,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:45:24,949 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:45:24,950 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:45:24,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695386138] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:24,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:45:24,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 13 [2025-01-10 06:45:24,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238926760] [2025-01-10 06:45:24,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:24,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:45:24,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:24,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:45:24,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:45:24,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-01-10 06:45:24,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 394 transitions, 5484 flow. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 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:45:24,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:24,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-01-10 06:45:24,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:26,039 INFO L124 PetriNetUnfolderBase]: 2790/5890 cut-off events. [2025-01-10 06:45:26,039 INFO L125 PetriNetUnfolderBase]: For 44897/45484 co-relation queries the response was YES. [2025-01-10 06:45:26,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27915 conditions, 5890 events. 2790/5890 cut-off events. For 44897/45484 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 40754 event pairs, 609 based on Foata normal form. 505/6231 useless extension candidates. Maximal degree in co-relation 27849. Up to 3442 conditions per place. [2025-01-10 06:45:26,090 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 442 selfloop transitions, 69 changer transitions 25/553 dead transitions. [2025-01-10 06:45:26,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 553 transitions, 8402 flow [2025-01-10 06:45:26,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:45:26,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:45:26,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2025-01-10 06:45:26,092 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6341463414634146 [2025-01-10 06:45:26,092 INFO L175 Difference]: Start difference. First operand has 161 places, 394 transitions, 5484 flow. Second operand 6 states and 156 transitions. [2025-01-10 06:45:26,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 553 transitions, 8402 flow [2025-01-10 06:45:26,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 553 transitions, 8384 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-01-10 06:45:26,230 INFO L231 Difference]: Finished difference. Result has 165 places, 393 transitions, 5600 flow [2025-01-10 06:45:26,230 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5462, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5600, PETRI_PLACES=165, PETRI_TRANSITIONS=393} [2025-01-10 06:45:26,231 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 127 predicate places. [2025-01-10 06:45:26,231 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 393 transitions, 5600 flow [2025-01-10 06:45:26,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 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:45:26,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:26,231 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:26,237 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:45:26,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:45:26,432 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 06:45:26,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:26,432 INFO L85 PathProgramCache]: Analyzing trace with hash -545421789, now seen corresponding path program 1 times [2025-01-10 06:45:26,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:26,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218511429] [2025-01-10 06:45:26,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:26,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:26,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 06:45:26,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 06:45:26,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:26,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:26,521 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:45:26,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:26,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218511429] [2025-01-10 06:45:26,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218511429] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:45:26,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745634259] [2025-01-10 06:45:26,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:26,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:45:26,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:45:26,525 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:45:26,528 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:45:26,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 06:45:26,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 06:45:26,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:26,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:26,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:45:26,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:45:26,652 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:45:26,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:45:26,708 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:45:26,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745634259] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:45:26,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:45:26,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 06:45:26,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998713027] [2025-01-10 06:45:26,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:45:26,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:45:26,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:26,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:45:26,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:45:26,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-01-10 06:45:26,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 393 transitions, 5600 flow. Second operand has 12 states, 12 states have (on average 16.583333333333332) internal successors, (199), 12 states have internal predecessors, (199), 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:45:26,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:26,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-01-10 06:45:26,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:30,097 INFO L124 PetriNetUnfolderBase]: 8769/18083 cut-off events. [2025-01-10 06:45:30,097 INFO L125 PetriNetUnfolderBase]: For 137724/139565 co-relation queries the response was YES. [2025-01-10 06:45:30,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86884 conditions, 18083 events. 8769/18083 cut-off events. For 137724/139565 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 145724 event pairs, 1624 based on Foata normal form. 1582/19569 useless extension candidates. Maximal degree in co-relation 86817. Up to 4951 conditions per place. [2025-01-10 06:45:30,244 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 1220 selfloop transitions, 163 changer transitions 0/1400 dead transitions. [2025-01-10 06:45:30,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 1400 transitions, 22068 flow [2025-01-10 06:45:30,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:45:30,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:45:30,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 284 transitions. [2025-01-10 06:45:30,246 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6926829268292682 [2025-01-10 06:45:30,246 INFO L175 Difference]: Start difference. First operand has 165 places, 393 transitions, 5600 flow. Second operand 10 states and 284 transitions. [2025-01-10 06:45:30,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 1400 transitions, 22068 flow [2025-01-10 06:45:30,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 1400 transitions, 21979 flow, removed 12 selfloop flow, removed 4 redundant places. [2025-01-10 06:45:30,730 INFO L231 Difference]: Finished difference. Result has 173 places, 535 transitions, 7930 flow [2025-01-10 06:45:30,730 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5532, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7930, PETRI_PLACES=173, PETRI_TRANSITIONS=535} [2025-01-10 06:45:30,731 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 135 predicate places. [2025-01-10 06:45:30,731 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 535 transitions, 7930 flow [2025-01-10 06:45:30,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 16.583333333333332) internal successors, (199), 12 states have internal predecessors, (199), 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:45:30,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:30,731 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:30,738 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:45:30,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:45:30,932 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 06:45:30,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:30,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1831439554, now seen corresponding path program 1 times [2025-01-10 06:45:30,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:30,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684345712] [2025-01-10 06:45:30,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:30,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:30,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 06:45:30,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 06:45:30,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:30,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:31,376 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:45:31,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:31,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684345712] [2025-01-10 06:45:31,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684345712] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:31,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:31,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-10 06:45:31,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934647331] [2025-01-10 06:45:31,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:31,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 06:45:31,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:31,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 06:45:31,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-01-10 06:45:31,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2025-01-10 06:45:31,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 535 transitions, 7930 flow. Second operand has 14 states, 14 states have (on average 12.571428571428571) internal successors, (176), 14 states have internal predecessors, (176), 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:45:31,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:31,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2025-01-10 06:45:31,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:37,100 INFO L124 PetriNetUnfolderBase]: 14640/30108 cut-off events. [2025-01-10 06:45:37,100 INFO L125 PetriNetUnfolderBase]: For 262093/263556 co-relation queries the response was YES. [2025-01-10 06:45:37,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148221 conditions, 30108 events. 14640/30108 cut-off events. For 262093/263556 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 265835 event pairs, 2864 based on Foata normal form. 1561/31574 useless extension candidates. Maximal degree in co-relation 148152. Up to 16362 conditions per place. [2025-01-10 06:45:37,494 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 693 selfloop transitions, 336 changer transitions 1/1042 dead transitions. [2025-01-10 06:45:37,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 1042 transitions, 16023 flow [2025-01-10 06:45:37,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-10 06:45:37,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-01-10 06:45:37,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 441 transitions. [2025-01-10 06:45:37,508 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48891352549889133 [2025-01-10 06:45:37,508 INFO L175 Difference]: Start difference. First operand has 173 places, 535 transitions, 7930 flow. Second operand 22 states and 441 transitions. [2025-01-10 06:45:37,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 1042 transitions, 16023 flow [2025-01-10 06:45:38,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 1042 transitions, 15949 flow, removed 9 selfloop flow, removed 3 redundant places. [2025-01-10 06:45:38,940 INFO L231 Difference]: Finished difference. Result has 205 places, 809 transitions, 13385 flow [2025-01-10 06:45:38,941 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7782, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=13385, PETRI_PLACES=205, PETRI_TRANSITIONS=809} [2025-01-10 06:45:38,941 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 167 predicate places. [2025-01-10 06:45:38,941 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 809 transitions, 13385 flow [2025-01-10 06:45:38,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.571428571428571) internal successors, (176), 14 states have internal predecessors, (176), 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:45:38,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:38,942 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:38,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:45:38,942 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 06:45:38,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:38,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1654403638, now seen corresponding path program 2 times [2025-01-10 06:45:38,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:38,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308090412] [2025-01-10 06:45:38,943 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:45:38,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:38,951 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-01-10 06:45:38,956 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 06:45:38,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:45:38,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:39,135 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:45:39,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:39,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308090412] [2025-01-10 06:45:39,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308090412] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:39,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:39,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 06:45:39,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005876661] [2025-01-10 06:45:39,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:39,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:45:39,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:39,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:45:39,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:45:39,167 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2025-01-10 06:45:39,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 809 transitions, 13385 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 states have internal predecessors, (123), 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:45:39,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:39,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2025-01-10 06:45:39,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:54,202 INFO L124 PetriNetUnfolderBase]: 30625/61366 cut-off events. [2025-01-10 06:45:54,202 INFO L125 PetriNetUnfolderBase]: For 773767/773930 co-relation queries the response was YES. [2025-01-10 06:45:54,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347058 conditions, 61366 events. 30625/61366 cut-off events. For 773767/773930 co-relation queries the response was YES. Maximal size of possible extension queue 1143. Compared 589400 event pairs, 2195 based on Foata normal form. 671/62023 useless extension candidates. Maximal degree in co-relation 346974. Up to 16601 conditions per place. [2025-01-10 06:45:55,215 INFO L140 encePairwiseOnDemand]: 24/41 looper letters, 1392 selfloop transitions, 1536 changer transitions 4/2941 dead transitions. [2025-01-10 06:45:55,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 2941 transitions, 53556 flow [2025-01-10 06:45:55,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-10 06:45:55,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-01-10 06:45:55,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 538 transitions. [2025-01-10 06:45:55,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4859981933152665 [2025-01-10 06:45:55,217 INFO L175 Difference]: Start difference. First operand has 205 places, 809 transitions, 13385 flow. Second operand 27 states and 538 transitions. [2025-01-10 06:45:55,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 2941 transitions, 53556 flow [2025-01-10 06:46:02,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 2941 transitions, 52908 flow, removed 255 selfloop flow, removed 13 redundant places. [2025-01-10 06:46:02,800 INFO L231 Difference]: Finished difference. Result has 244 places, 2285 transitions, 45399 flow [2025-01-10 06:46:02,801 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=13150, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=809, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=321, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=45399, PETRI_PLACES=244, PETRI_TRANSITIONS=2285} [2025-01-10 06:46:02,801 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 206 predicate places. [2025-01-10 06:46:02,802 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 2285 transitions, 45399 flow [2025-01-10 06:46:02,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 states have internal predecessors, (123), 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:46:02,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:02,802 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:46:02,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:46:02,802 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 06:46:02,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:02,803 INFO L85 PathProgramCache]: Analyzing trace with hash 282624080, now seen corresponding path program 3 times [2025-01-10 06:46:02,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:02,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624426242] [2025-01-10 06:46:02,803 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:46:02,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:02,811 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-01-10 06:46:02,815 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 28 statements. [2025-01-10 06:46:02,815 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 06:46:02,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:02,971 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:46:02,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:02,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624426242] [2025-01-10 06:46:02,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624426242] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:02,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:02,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 06:46:02,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119375683] [2025-01-10 06:46:02,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:02,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:46:02,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:02,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:46:02,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:46:03,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2025-01-10 06:46:03,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 2285 transitions, 45399 flow. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 states have internal predecessors, (123), 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:46:03,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:03,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2025-01-10 06:46:03,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand