./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6aeaf730cbe4eb831d189bfd9925d1660c7714b9e685f389bc2495c0943d6472 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:20:44,826 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:20:44,882 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:20:44,887 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:20:44,888 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:20:44,902 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:20:44,903 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:20:44,903 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:20:44,903 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:20:44,903 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:20:44,904 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:20:44,904 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:20:44,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:20:44,904 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:20:44,904 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:20:44,904 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:20:44,904 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:20:44,904 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:20:44,904 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:20:44,905 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:20:44,905 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:20:44,905 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:20:44,905 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:20:44,905 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:20:44,905 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:20:44,905 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:20:44,905 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:20:44,905 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:20:44,905 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:20:44,906 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:20:44,906 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:20:44,906 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:20:44,906 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:20:44,906 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:20:44,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:20:44,906 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:20:44,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:20:44,906 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:20:44,907 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:20:44,907 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:20:44,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:20:44,907 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:20:44,907 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:20:44,907 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:20:44,907 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:20:44,907 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6aeaf730cbe4eb831d189bfd9925d1660c7714b9e685f389bc2495c0943d6472 [2025-03-04 15:20:45,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:20:45,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:20:45,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:20:45,111 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:20:45,111 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:20:45,112 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-03-04 15:20:46,193 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c6994194/55aa4ef80d8642aa92929042ad479a68/FLAGcd4840aab [2025-03-04 15:20:46,473 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:20:46,474 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-03-04 15:20:46,487 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c6994194/55aa4ef80d8642aa92929042ad479a68/FLAGcd4840aab [2025-03-04 15:20:46,752 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c6994194/55aa4ef80d8642aa92929042ad479a68 [2025-03-04 15:20:46,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:20:46,755 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:20:46,756 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:20:46,756 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:20:46,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:20:46,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:20:46" (1/1) ... [2025-03-04 15:20:46,760 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1598773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:46, skipping insertion in model container [2025-03-04 15:20:46,760 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:20:46" (1/1) ... [2025-03-04 15:20:46,782 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:20:46,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:20:46,983 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:20:47,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:20:47,057 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:20:47,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:47 WrapperNode [2025-03-04 15:20:47,058 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:20:47,059 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:20:47,059 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:20:47,059 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:20:47,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:47" (1/1) ... [2025-03-04 15:20:47,079 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:47" (1/1) ... [2025-03-04 15:20:47,095 INFO L138 Inliner]: procedures = 165, calls = 35, calls flagged for inlining = 8, calls inlined = 9, statements flattened = 122 [2025-03-04 15:20:47,095 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:20:47,096 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:20:47,096 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:20:47,096 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:20:47,103 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:47" (1/1) ... [2025-03-04 15:20:47,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:47" (1/1) ... [2025-03-04 15:20:47,107 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:47" (1/1) ... [2025-03-04 15:20:47,125 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-03-04 15:20:47,125 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:47" (1/1) ... [2025-03-04 15:20:47,125 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:47" (1/1) ... [2025-03-04 15:20:47,133 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:47" (1/1) ... [2025-03-04 15:20:47,133 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:47" (1/1) ... [2025-03-04 15:20:47,134 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:47" (1/1) ... [2025-03-04 15:20:47,136 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:47" (1/1) ... [2025-03-04 15:20:47,139 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:20:47,140 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:20:47,140 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:20:47,140 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:20:47,145 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:47" (1/1) ... [2025-03-04 15:20:47,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:20:47,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:20:47,175 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:20:47,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:20:47,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:20:47,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:20:47,197 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2025-03-04 15:20:47,197 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2025-03-04 15:20:47,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:20:47,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:20:47,198 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 15:20:47,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:20:47,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:20:47,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:20:47,198 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 15:20:47,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:20:47,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:20:47,199 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:20:47,302 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:20:47,304 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:20:47,510 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:20:47,510 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:20:47,631 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:20:47,632 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:20:47,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:20:47 BoogieIcfgContainer [2025-03-04 15:20:47,632 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:20:47,633 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:20:47,633 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:20:47,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:20:47,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:20:46" (1/3) ... [2025-03-04 15:20:47,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@138a2913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:20:47, skipping insertion in model container [2025-03-04 15:20:47,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:47" (2/3) ... [2025-03-04 15:20:47,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@138a2913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:20:47, skipping insertion in model container [2025-03-04 15:20:47,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:20:47" (3/3) ... [2025-03-04 15:20:47,637 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-03-04 15:20:47,647 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:20:47,649 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-03-04 15:20:47,649 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:20:47,698 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:20:47,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 41 transitions, 86 flow [2025-03-04 15:20:47,744 INFO L124 PetriNetUnfolderBase]: 6/40 cut-off events. [2025-03-04 15:20:47,745 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:20:47,749 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 80 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-03-04 15:20:47,749 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 41 transitions, 86 flow [2025-03-04 15:20:47,751 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 40 transitions, 83 flow [2025-03-04 15:20:47,756 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:20:47,764 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;@3104df5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:20:47,765 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-04 15:20:47,771 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:20:47,771 INFO L124 PetriNetUnfolderBase]: 3/21 cut-off events. [2025-03-04 15:20:47,771 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:20:47,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:47,772 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:47,772 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:47,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:47,778 INFO L85 PathProgramCache]: Analyzing trace with hash 2011572105, now seen corresponding path program 1 times [2025-03-04 15:20:47,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:47,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138638147] [2025-03-04 15:20:47,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:47,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:47,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:20:47,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:20:47,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:47,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:48,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:48,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:48,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138638147] [2025-03-04 15:20:48,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138638147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:48,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:48,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:20:48,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305439517] [2025-03-04 15:20:48,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:48,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:20:48,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:48,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:20:48,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:20:48,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-03-04 15:20:48,178 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-03-04 15:20:48,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:48,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-03-04 15:20:48,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:48,411 INFO L124 PetriNetUnfolderBase]: 363/738 cut-off events. [2025-03-04 15:20:48,411 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:20:48,412 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 3618 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-03-04 15:20:48,416 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 72 selfloop transitions, 9 changer transitions 0/93 dead transitions. [2025-03-04 15:20:48,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 93 transitions, 351 flow [2025-03-04 15:20:48,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:20:48,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:20:48,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 173 transitions. [2025-03-04 15:20:48,424 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7032520325203252 [2025-03-04 15:20:48,425 INFO L175 Difference]: Start difference. First operand has 38 places, 40 transitions, 83 flow. Second operand 6 states and 173 transitions. [2025-03-04 15:20:48,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 93 transitions, 351 flow [2025-03-04 15:20:48,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 93 transitions, 350 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:20:48,434 INFO L231 Difference]: Finished difference. Result has 45 places, 47 transitions, 148 flow [2025-03-04 15:20:48,437 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-03-04 15:20:48,440 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 7 predicate places. [2025-03-04 15:20:48,440 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 47 transitions, 148 flow [2025-03-04 15:20:48,441 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-03-04 15:20:48,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:48,441 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:48,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:20:48,441 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:48,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:48,442 INFO L85 PathProgramCache]: Analyzing trace with hash 385513642, now seen corresponding path program 1 times [2025-03-04 15:20:48,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:48,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850844260] [2025-03-04 15:20:48,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:48,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:48,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:20:48,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:20:48,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:48,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:48,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:48,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:48,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850844260] [2025-03-04 15:20:48,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850844260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:48,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:48,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:20:48,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499833619] [2025-03-04 15:20:48,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:48,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:20:48,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:48,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:20:48,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:20:48,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-03-04 15:20:48,569 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-03-04 15:20:48,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:48,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-03-04 15:20:48,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:48,792 INFO L124 PetriNetUnfolderBase]: 298/648 cut-off events. [2025-03-04 15:20:48,793 INFO L125 PetriNetUnfolderBase]: For 135/139 co-relation queries the response was YES. [2025-03-04 15:20:48,795 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 38. Compared 3180 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-03-04 15:20:48,800 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 66 selfloop transitions, 10 changer transitions 0/90 dead transitions. [2025-03-04 15:20:48,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 90 transitions, 389 flow [2025-03-04 15:20:48,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:20:48,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:20:48,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2025-03-04 15:20:48,803 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6707317073170732 [2025-03-04 15:20:48,803 INFO L175 Difference]: Start difference. First operand has 45 places, 47 transitions, 148 flow. Second operand 6 states and 165 transitions. [2025-03-04 15:20:48,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 90 transitions, 389 flow [2025-03-04 15:20:48,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 90 transitions, 389 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:20:48,809 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 192 flow [2025-03-04 15:20:48,809 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-03-04 15:20:48,810 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2025-03-04 15:20:48,810 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 192 flow [2025-03-04 15:20:48,810 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-03-04 15:20:48,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:48,810 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:48,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:20:48,811 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting workerErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:48,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:48,812 INFO L85 PathProgramCache]: Analyzing trace with hash -875039701, now seen corresponding path program 1 times [2025-03-04 15:20:48,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:48,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891292000] [2025-03-04 15:20:48,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:48,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:48,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:20:48,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:20:48,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:48,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:48,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:48,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:48,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891292000] [2025-03-04 15:20:48,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891292000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:48,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:48,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:20:48,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124970753] [2025-03-04 15:20:48,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:48,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:20:48,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:48,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:20:48,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:20:48,890 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-03-04 15:20:48,890 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-03-04 15:20:48,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:48,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-03-04 15:20:48,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:49,120 INFO L124 PetriNetUnfolderBase]: 466/987 cut-off events. [2025-03-04 15:20:49,120 INFO L125 PetriNetUnfolderBase]: For 573/588 co-relation queries the response was YES. [2025-03-04 15:20:49,122 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 53. Compared 5239 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-03-04 15:20:49,124 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 93 selfloop transitions, 20 changer transitions 0/124 dead transitions. [2025-03-04 15:20:49,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 124 transitions, 745 flow [2025-03-04 15:20:49,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:20:49,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:20:49,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2025-03-04 15:20:49,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6300813008130082 [2025-03-04 15:20:49,126 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 192 flow. Second operand 6 states and 155 transitions. [2025-03-04 15:20:49,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 124 transitions, 745 flow [2025-03-04 15:20:49,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 124 transitions, 719 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-04 15:20:49,129 INFO L231 Difference]: Finished difference. Result has 61 places, 65 transitions, 351 flow [2025-03-04 15:20:49,129 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-03-04 15:20:49,130 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 23 predicate places. [2025-03-04 15:20:49,130 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 65 transitions, 351 flow [2025-03-04 15:20:49,130 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-03-04 15:20:49,130 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:49,130 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:49,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:20:49,130 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:49,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:49,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1116474576, now seen corresponding path program 1 times [2025-03-04 15:20:49,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:49,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70669573] [2025-03-04 15:20:49,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:49,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:49,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:20:49,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:20:49,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:49,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:49,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:49,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:49,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70669573] [2025-03-04 15:20:49,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70669573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:49,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:49,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:20:49,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830402115] [2025-03-04 15:20:49,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:49,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:20:49,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:49,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:20:49,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:20:49,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-03-04 15:20:49,174 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-03-04 15:20:49,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:49,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-03-04 15:20:49,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:49,342 INFO L124 PetriNetUnfolderBase]: 605/1279 cut-off events. [2025-03-04 15:20:49,342 INFO L125 PetriNetUnfolderBase]: For 1363/1438 co-relation queries the response was YES. [2025-03-04 15:20:49,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3661 conditions, 1279 events. 605/1279 cut-off events. For 1363/1438 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 7113 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-03-04 15:20:49,350 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 95 selfloop transitions, 5 changer transitions 0/113 dead transitions. [2025-03-04 15:20:49,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 113 transitions, 770 flow [2025-03-04 15:20:49,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:20:49,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:20:49,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2025-03-04 15:20:49,351 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6829268292682927 [2025-03-04 15:20:49,351 INFO L175 Difference]: Start difference. First operand has 61 places, 65 transitions, 351 flow. Second operand 4 states and 112 transitions. [2025-03-04 15:20:49,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 113 transitions, 770 flow [2025-03-04 15:20:49,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 113 transitions, 770 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:20:49,363 INFO L231 Difference]: Finished difference. Result has 66 places, 68 transitions, 386 flow [2025-03-04 15:20:49,363 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-03-04 15:20:49,363 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 28 predicate places. [2025-03-04 15:20:49,363 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 68 transitions, 386 flow [2025-03-04 15:20:49,364 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-03-04 15:20:49,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:49,364 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:49,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:20:49,364 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting workerErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:49,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:49,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1356426642, now seen corresponding path program 1 times [2025-03-04 15:20:49,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:49,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702205920] [2025-03-04 15:20:49,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:49,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:49,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:20:49,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:20:49,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:49,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:49,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:49,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:49,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702205920] [2025-03-04 15:20:49,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702205920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:49,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:49,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:20:49,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210020771] [2025-03-04 15:20:49,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:49,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:20:49,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:49,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:20:49,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:20:49,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-03-04 15:20:49,461 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-03-04 15:20:49,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:49,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-03-04 15:20:49,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:49,587 INFO L124 PetriNetUnfolderBase]: 358/838 cut-off events. [2025-03-04 15:20:49,588 INFO L125 PetriNetUnfolderBase]: For 957/1006 co-relation queries the response was YES. [2025-03-04 15:20:49,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2464 conditions, 838 events. 358/838 cut-off events. For 957/1006 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4406 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-03-04 15:20:49,592 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 59 selfloop transitions, 11 changer transitions 3/88 dead transitions. [2025-03-04 15:20:49,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 88 transitions, 605 flow [2025-03-04 15:20:49,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:20:49,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:20:49,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2025-03-04 15:20:49,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6341463414634146 [2025-03-04 15:20:49,593 INFO L175 Difference]: Start difference. First operand has 66 places, 68 transitions, 386 flow. Second operand 5 states and 130 transitions. [2025-03-04 15:20:49,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 88 transitions, 605 flow [2025-03-04 15:20:49,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 88 transitions, 577 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-04 15:20:49,597 INFO L231 Difference]: Finished difference. Result has 69 places, 65 transitions, 385 flow [2025-03-04 15:20:49,597 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-03-04 15:20:49,598 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 31 predicate places. [2025-03-04 15:20:49,598 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 385 flow [2025-03-04 15:20:49,598 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-03-04 15:20:49,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:49,598 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:49,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:20:49,598 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting workerErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:49,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:49,598 INFO L85 PathProgramCache]: Analyzing trace with hash -228232467, now seen corresponding path program 1 times [2025-03-04 15:20:49,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:49,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967379705] [2025-03-04 15:20:49,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:49,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:49,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:20:49,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:20:49,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:49,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:49,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:49,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:49,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967379705] [2025-03-04 15:20:49,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967379705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:49,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:49,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:20:49,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099718847] [2025-03-04 15:20:49,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:49,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 15:20:49,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:49,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:20:49,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:20:49,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-03-04 15:20:49,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 385 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:49,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:49,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-03-04 15:20:49,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:50,041 INFO L124 PetriNetUnfolderBase]: 439/972 cut-off events. [2025-03-04 15:20:50,041 INFO L125 PetriNetUnfolderBase]: For 1515/1539 co-relation queries the response was YES. [2025-03-04 15:20:50,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3023 conditions, 972 events. 439/972 cut-off events. For 1515/1539 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5179 event pairs, 202 based on Foata normal form. 5/971 useless extension candidates. Maximal degree in co-relation 2995. Up to 721 conditions per place. [2025-03-04 15:20:50,049 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 62 selfloop transitions, 14 changer transitions 0/88 dead transitions. [2025-03-04 15:20:50,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 88 transitions, 679 flow [2025-03-04 15:20:50,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:20:50,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:20:50,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2025-03-04 15:20:50,050 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46646341463414637 [2025-03-04 15:20:50,050 INFO L175 Difference]: Start difference. First operand has 69 places, 65 transitions, 385 flow. Second operand 8 states and 153 transitions. [2025-03-04 15:20:50,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 88 transitions, 679 flow [2025-03-04 15:20:50,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 88 transitions, 674 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 15:20:50,057 INFO L231 Difference]: Finished difference. Result has 79 places, 72 transitions, 502 flow [2025-03-04 15:20:50,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=502, PETRI_PLACES=79, PETRI_TRANSITIONS=72} [2025-03-04 15:20:50,060 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 41 predicate places. [2025-03-04 15:20:50,060 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 72 transitions, 502 flow [2025-03-04 15:20:50,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:50,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:50,060 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:50,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:20:50,060 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting workerErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:50,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:50,061 INFO L85 PathProgramCache]: Analyzing trace with hash 871550269, now seen corresponding path program 2 times [2025-03-04 15:20:50,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:50,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151839341] [2025-03-04 15:20:50,062 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:20:50,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:50,075 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:20:50,079 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:20:50,081 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:20:50,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:50,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:50,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:50,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151839341] [2025-03-04 15:20:50,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151839341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:50,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:50,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:20:50,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881480853] [2025-03-04 15:20:50,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:50,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:20:50,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:50,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:20:50,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:20:50,249 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2025-03-04 15:20:50,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 72 transitions, 502 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-03-04 15:20:50,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:50,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2025-03-04 15:20:50,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:50,381 INFO L124 PetriNetUnfolderBase]: 376/888 cut-off events. [2025-03-04 15:20:50,381 INFO L125 PetriNetUnfolderBase]: For 1647/1668 co-relation queries the response was YES. [2025-03-04 15:20:50,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2864 conditions, 888 events. 376/888 cut-off events. For 1647/1668 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4844 event pairs, 178 based on Foata normal form. 7/891 useless extension candidates. Maximal degree in co-relation 2830. Up to 623 conditions per place. [2025-03-04 15:20:50,386 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 59 selfloop transitions, 12 changer transitions 0/85 dead transitions. [2025-03-04 15:20:50,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 85 transitions, 712 flow [2025-03-04 15:20:50,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:20:50,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:20:50,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2025-03-04 15:20:50,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5707317073170731 [2025-03-04 15:20:50,387 INFO L175 Difference]: Start difference. First operand has 79 places, 72 transitions, 502 flow. Second operand 5 states and 117 transitions. [2025-03-04 15:20:50,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 85 transitions, 712 flow [2025-03-04 15:20:50,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 85 transitions, 673 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-04 15:20:50,395 INFO L231 Difference]: Finished difference. Result has 80 places, 73 transitions, 515 flow [2025-03-04 15:20:50,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=515, PETRI_PLACES=80, PETRI_TRANSITIONS=73} [2025-03-04 15:20:50,397 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 42 predicate places. [2025-03-04 15:20:50,397 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 73 transitions, 515 flow [2025-03-04 15:20:50,397 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-03-04 15:20:50,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:50,397 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:50,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:20:50,397 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting workerErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:50,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:50,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1394668185, now seen corresponding path program 3 times [2025-03-04 15:20:50,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:50,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61357521] [2025-03-04 15:20:50,398 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:20:50,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:50,404 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:20:50,407 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:20:50,408 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:20:50,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:50,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:50,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:50,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61357521] [2025-03-04 15:20:50,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61357521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:50,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:50,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:20:50,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48135910] [2025-03-04 15:20:50,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:50,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:20:50,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:50,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:20:50,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:20:50,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-03-04 15:20:50,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 73 transitions, 515 flow. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:50,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:50,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-03-04 15:20:50,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:50,883 INFO L124 PetriNetUnfolderBase]: 464/1029 cut-off events. [2025-03-04 15:20:50,883 INFO L125 PetriNetUnfolderBase]: For 2607/2631 co-relation queries the response was YES. [2025-03-04 15:20:50,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3580 conditions, 1029 events. 464/1029 cut-off events. For 2607/2631 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5490 event pairs, 215 based on Foata normal form. 18/1041 useless extension candidates. Maximal degree in co-relation 3545. Up to 738 conditions per place. [2025-03-04 15:20:50,889 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 75 selfloop transitions, 25 changer transitions 1/113 dead transitions. [2025-03-04 15:20:50,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 113 transitions, 1011 flow [2025-03-04 15:20:50,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:20:50,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 15:20:50,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 208 transitions. [2025-03-04 15:20:50,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4611973392461197 [2025-03-04 15:20:50,890 INFO L175 Difference]: Start difference. First operand has 80 places, 73 transitions, 515 flow. Second operand 11 states and 208 transitions. [2025-03-04 15:20:50,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 113 transitions, 1011 flow [2025-03-04 15:20:50,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 113 transitions, 967 flow, removed 10 selfloop flow, removed 3 redundant places. [2025-03-04 15:20:50,896 INFO L231 Difference]: Finished difference. Result has 92 places, 88 transitions, 759 flow [2025-03-04 15:20:50,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=759, PETRI_PLACES=92, PETRI_TRANSITIONS=88} [2025-03-04 15:20:50,897 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 54 predicate places. [2025-03-04 15:20:50,897 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 88 transitions, 759 flow [2025-03-04 15:20:50,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:50,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:50,898 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:50,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:20:50,898 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting workerErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:50,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:50,898 INFO L85 PathProgramCache]: Analyzing trace with hash -233414881, now seen corresponding path program 4 times [2025-03-04 15:20:50,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:50,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124929957] [2025-03-04 15:20:50,898 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:20:50,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:50,905 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-04 15:20:50,908 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 13 of 18 statements. [2025-03-04 15:20:50,908 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 15:20:50,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:50,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:50,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:50,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124929957] [2025-03-04 15:20:50,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124929957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:50,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:50,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:20:50,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38923426] [2025-03-04 15:20:50,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:50,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:20:50,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:50,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:20:50,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:20:50,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-03-04 15:20:50,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 88 transitions, 759 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:50,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:50,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-03-04 15:20:50,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:51,169 INFO L124 PetriNetUnfolderBase]: 499/1150 cut-off events. [2025-03-04 15:20:51,169 INFO L125 PetriNetUnfolderBase]: For 3268/3382 co-relation queries the response was YES. [2025-03-04 15:20:51,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4057 conditions, 1150 events. 499/1150 cut-off events. For 3268/3382 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6770 event pairs, 14 based on Foata normal form. 74/1219 useless extension candidates. Maximal degree in co-relation 4017. Up to 582 conditions per place. [2025-03-04 15:20:51,176 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 121 selfloop transitions, 13 changer transitions 6/159 dead transitions. [2025-03-04 15:20:51,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 159 transitions, 1545 flow [2025-03-04 15:20:51,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:20:51,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:20:51,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2025-03-04 15:20:51,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6731707317073171 [2025-03-04 15:20:51,178 INFO L175 Difference]: Start difference. First operand has 92 places, 88 transitions, 759 flow. Second operand 5 states and 138 transitions. [2025-03-04 15:20:51,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 159 transitions, 1545 flow [2025-03-04 15:20:51,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 159 transitions, 1515 flow, removed 13 selfloop flow, removed 1 redundant places. [2025-03-04 15:20:51,188 INFO L231 Difference]: Finished difference. Result has 97 places, 93 transitions, 787 flow [2025-03-04 15:20:51,188 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=739, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=787, PETRI_PLACES=97, PETRI_TRANSITIONS=93} [2025-03-04 15:20:51,188 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 59 predicate places. [2025-03-04 15:20:51,188 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 93 transitions, 787 flow [2025-03-04 15:20:51,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:51,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:51,188 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:51,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:20:51,189 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting workerErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:51,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:51,189 INFO L85 PathProgramCache]: Analyzing trace with hash -591551185, now seen corresponding path program 5 times [2025-03-04 15:20:51,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:51,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108715971] [2025-03-04 15:20:51,189 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:20:51,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:51,198 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:20:51,201 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:20:51,201 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:20:51,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:51,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:51,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:51,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108715971] [2025-03-04 15:20:51,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108715971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:51,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:51,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:20:51,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503902119] [2025-03-04 15:20:51,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:51,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:20:51,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:51,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:20:51,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:20:51,379 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-03-04 15:20:51,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 93 transitions, 787 flow. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:51,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:51,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-03-04 15:20:51,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:51,725 INFO L124 PetriNetUnfolderBase]: 629/1396 cut-off events. [2025-03-04 15:20:51,725 INFO L125 PetriNetUnfolderBase]: For 4107/4123 co-relation queries the response was YES. [2025-03-04 15:20:51,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5343 conditions, 1396 events. 629/1396 cut-off events. For 4107/4123 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 7864 event pairs, 247 based on Foata normal form. 16/1404 useless extension candidates. Maximal degree in co-relation 5301. Up to 1044 conditions per place. [2025-03-04 15:20:51,734 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 84 selfloop transitions, 34 changer transitions 3/133 dead transitions. [2025-03-04 15:20:51,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 133 transitions, 1314 flow [2025-03-04 15:20:51,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:20:51,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 15:20:51,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 225 transitions. [2025-03-04 15:20:51,736 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4573170731707317 [2025-03-04 15:20:51,736 INFO L175 Difference]: Start difference. First operand has 97 places, 93 transitions, 787 flow. Second operand 12 states and 225 transitions. [2025-03-04 15:20:51,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 133 transitions, 1314 flow [2025-03-04 15:20:51,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 133 transitions, 1302 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-04 15:20:51,746 INFO L231 Difference]: Finished difference. Result has 110 places, 102 transitions, 1005 flow [2025-03-04 15:20:51,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1005, PETRI_PLACES=110, PETRI_TRANSITIONS=102} [2025-03-04 15:20:51,747 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 72 predicate places. [2025-03-04 15:20:51,747 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 102 transitions, 1005 flow [2025-03-04 15:20:51,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:51,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:51,747 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:51,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:20:51,747 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:51,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:51,748 INFO L85 PathProgramCache]: Analyzing trace with hash -317026804, now seen corresponding path program 1 times [2025-03-04 15:20:51,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:51,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988549490] [2025-03-04 15:20:51,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:51,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:51,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:20:51,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:20:51,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:51,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:51,924 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:51,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:51,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988549490] [2025-03-04 15:20:51,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988549490] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:20:51,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941921942] [2025-03-04 15:20:51,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:51,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:51,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:20:51,927 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:20:51,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 15:20:51,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:20:51,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:20:51,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:51,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:51,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 15:20:52,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:20:52,036 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-03-04 15:20:52,142 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-03-04 15:20:52,196 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-03-04 15:20:52,198 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:52,198 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:20:52,372 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:52,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941921942] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:20:52,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:20:52,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2025-03-04 15:20:52,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547740163] [2025-03-04 15:20:52,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:20:52,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 15:20:52,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:52,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 15:20:52,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-04 15:20:52,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-03-04 15:20:52,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 102 transitions, 1005 flow. Second operand has 20 states, 20 states have (on average 14.5) internal successors, (290), 20 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:52,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:52,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-03-04 15:20:52,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:53,430 INFO L124 PetriNetUnfolderBase]: 1949/4115 cut-off events. [2025-03-04 15:20:53,431 INFO L125 PetriNetUnfolderBase]: For 13091/13412 co-relation queries the response was YES. [2025-03-04 15:20:53,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15478 conditions, 4115 events. 1949/4115 cut-off events. For 13091/13412 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 26682 event pairs, 190 based on Foata normal form. 281/4363 useless extension candidates. Maximal degree in co-relation 15432. Up to 867 conditions per place. [2025-03-04 15:20:53,460 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 364 selfloop transitions, 95 changer transitions 1/477 dead transitions. [2025-03-04 15:20:53,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 477 transitions, 4425 flow [2025-03-04 15:20:53,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 15:20:53,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 15:20:53,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 498 transitions. [2025-03-04 15:20:53,462 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6073170731707317 [2025-03-04 15:20:53,462 INFO L175 Difference]: Start difference. First operand has 110 places, 102 transitions, 1005 flow. Second operand 20 states and 498 transitions. [2025-03-04 15:20:53,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 477 transitions, 4425 flow [2025-03-04 15:20:53,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 477 transitions, 4266 flow, removed 44 selfloop flow, removed 7 redundant places. [2025-03-04 15:20:53,487 INFO L231 Difference]: Finished difference. Result has 129 places, 189 transitions, 1945 flow [2025-03-04 15:20:53,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=903, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1945, PETRI_PLACES=129, PETRI_TRANSITIONS=189} [2025-03-04 15:20:53,487 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 91 predicate places. [2025-03-04 15:20:53,487 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 189 transitions, 1945 flow [2025-03-04 15:20:53,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 14.5) internal successors, (290), 20 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:53,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:53,488 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-03-04 15:20:53,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 15:20:53,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 15:20:53,690 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting workerErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:53,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:53,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1294260602, now seen corresponding path program 1 times [2025-03-04 15:20:53,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:53,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102603186] [2025-03-04 15:20:53,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:53,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:53,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:20:53,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:20:53,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:53,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:53,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:53,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:53,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102603186] [2025-03-04 15:20:53,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102603186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:53,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:53,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:20:53,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46484691] [2025-03-04 15:20:53,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:53,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:20:53,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:53,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:20:53,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:20:53,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2025-03-04 15:20:53,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 189 transitions, 1945 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-03-04 15:20:53,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:53,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2025-03-04 15:20:53,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:54,684 INFO L124 PetriNetUnfolderBase]: 2383/5036 cut-off events. [2025-03-04 15:20:54,684 INFO L125 PetriNetUnfolderBase]: For 19227/19428 co-relation queries the response was YES. [2025-03-04 15:20:54,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20489 conditions, 5036 events. 2383/5036 cut-off events. For 19227/19428 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 34415 event pairs, 798 based on Foata normal form. 208/5179 useless extension candidates. Maximal degree in co-relation 20438. Up to 3012 conditions per place. [2025-03-04 15:20:54,721 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 243 selfloop transitions, 65 changer transitions 1/325 dead transitions. [2025-03-04 15:20:54,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 325 transitions, 3582 flow [2025-03-04 15:20:54,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:20:54,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 15:20:54,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 249 transitions. [2025-03-04 15:20:54,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5060975609756098 [2025-03-04 15:20:54,723 INFO L175 Difference]: Start difference. First operand has 129 places, 189 transitions, 1945 flow. Second operand 12 states and 249 transitions. [2025-03-04 15:20:54,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 325 transitions, 3582 flow [2025-03-04 15:20:54,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 325 transitions, 3224 flow, removed 156 selfloop flow, removed 6 redundant places. [2025-03-04 15:20:54,773 INFO L231 Difference]: Finished difference. Result has 139 places, 217 transitions, 2263 flow [2025-03-04 15:20:54,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1739, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2263, PETRI_PLACES=139, PETRI_TRANSITIONS=217} [2025-03-04 15:20:54,774 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 101 predicate places. [2025-03-04 15:20:54,774 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 217 transitions, 2263 flow [2025-03-04 15:20:54,774 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-03-04 15:20:54,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:54,774 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-03-04 15:20:54,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:20:54,775 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting workerErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:54,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:54,775 INFO L85 PathProgramCache]: Analyzing trace with hash 968221676, now seen corresponding path program 2 times [2025-03-04 15:20:54,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:54,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309704912] [2025-03-04 15:20:54,775 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:20:54,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:54,781 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:20:54,785 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:20:54,785 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:20:54,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:54,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:54,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:54,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309704912] [2025-03-04 15:20:54,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309704912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:54,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:54,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:20:54,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043236073] [2025-03-04 15:20:54,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:54,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:20:54,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:54,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:20:54,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:20:54,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2025-03-04 15:20:54,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 217 transitions, 2263 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-03-04 15:20:54,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:54,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2025-03-04 15:20:54,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:55,895 INFO L124 PetriNetUnfolderBase]: 2688/5704 cut-off events. [2025-03-04 15:20:55,895 INFO L125 PetriNetUnfolderBase]: For 25259/25468 co-relation queries the response was YES. [2025-03-04 15:20:55,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23292 conditions, 5704 events. 2688/5704 cut-off events. For 25259/25468 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 40054 event pairs, 875 based on Foata normal form. 196/5829 useless extension candidates. Maximal degree in co-relation 23238. Up to 3517 conditions per place. [2025-03-04 15:20:55,941 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 265 selfloop transitions, 70 changer transitions 2/353 dead transitions. [2025-03-04 15:20:55,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 353 transitions, 3858 flow [2025-03-04 15:20:55,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 15:20:55,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 15:20:55,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 274 transitions. [2025-03-04 15:20:55,943 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47735191637630664 [2025-03-04 15:20:55,943 INFO L175 Difference]: Start difference. First operand has 139 places, 217 transitions, 2263 flow. Second operand 14 states and 274 transitions. [2025-03-04 15:20:55,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 353 transitions, 3858 flow [2025-03-04 15:20:56,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 353 transitions, 3800 flow, removed 18 selfloop flow, removed 4 redundant places. [2025-03-04 15:20:56,019 INFO L231 Difference]: Finished difference. Result has 154 places, 244 transitions, 2790 flow [2025-03-04 15:20:56,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2211, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2790, PETRI_PLACES=154, PETRI_TRANSITIONS=244} [2025-03-04 15:20:56,020 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 116 predicate places. [2025-03-04 15:20:56,020 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 244 transitions, 2790 flow [2025-03-04 15:20:56,020 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-03-04 15:20:56,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:56,020 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-03-04 15:20:56,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 15:20:56,020 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting workerErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:56,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:56,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1174202924, now seen corresponding path program 3 times [2025-03-04 15:20:56,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:56,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660978065] [2025-03-04 15:20:56,021 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:20:56,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:56,026 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:20:56,028 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:20:56,028 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:20:56,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:56,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:56,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:56,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660978065] [2025-03-04 15:20:56,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660978065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:56,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:56,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:20:56,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167294520] [2025-03-04 15:20:56,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:56,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:20:56,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:56,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:20:56,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:20:56,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2025-03-04 15:20:56,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 244 transitions, 2790 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-03-04 15:20:56,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:56,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2025-03-04 15:20:56,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:57,343 INFO L124 PetriNetUnfolderBase]: 3722/7852 cut-off events. [2025-03-04 15:20:57,343 INFO L125 PetriNetUnfolderBase]: For 49678/50036 co-relation queries the response was YES. [2025-03-04 15:20:57,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33414 conditions, 7852 events. 3722/7852 cut-off events. For 49678/50036 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 58191 event pairs, 775 based on Foata normal form. 434/8201 useless extension candidates. Maximal degree in co-relation 33353. Up to 3139 conditions per place. [2025-03-04 15:20:57,393 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 297 selfloop transitions, 190 changer transitions 5/508 dead transitions. [2025-03-04 15:20:57,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 508 transitions, 5761 flow [2025-03-04 15:20:57,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 15:20:57,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 15:20:57,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 360 transitions. [2025-03-04 15:20:57,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4878048780487805 [2025-03-04 15:20:57,395 INFO L175 Difference]: Start difference. First operand has 154 places, 244 transitions, 2790 flow. Second operand 18 states and 360 transitions. [2025-03-04 15:20:57,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 508 transitions, 5761 flow [2025-03-04 15:20:57,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 508 transitions, 5610 flow, removed 23 selfloop flow, removed 8 redundant places. [2025-03-04 15:20:57,528 INFO L231 Difference]: Finished difference. Result has 173 places, 354 transitions, 4527 flow [2025-03-04 15:20:57,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2652, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4527, PETRI_PLACES=173, PETRI_TRANSITIONS=354} [2025-03-04 15:20:57,529 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 135 predicate places. [2025-03-04 15:20:57,529 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 354 transitions, 4527 flow [2025-03-04 15:20:57,530 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-03-04 15:20:57,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:57,530 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-03-04 15:20:57,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 15:20:57,530 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting workerErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:57,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:57,531 INFO L85 PathProgramCache]: Analyzing trace with hash 36634110, now seen corresponding path program 4 times [2025-03-04 15:20:57,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:57,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745915929] [2025-03-04 15:20:57,531 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:20:57,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:57,537 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-03-04 15:20:57,540 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 13 of 19 statements. [2025-03-04 15:20:57,540 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 15:20:57,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:57,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:57,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:57,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745915929] [2025-03-04 15:20:57,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745915929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:57,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:57,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:20:57,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927090624] [2025-03-04 15:20:57,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:57,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 15:20:57,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:57,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:20:57,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:20:57,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-03-04 15:20:57,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 354 transitions, 4527 flow. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:57,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:57,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-03-04 15:20:57,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:58,987 INFO L124 PetriNetUnfolderBase]: 3421/7676 cut-off events. [2025-03-04 15:20:58,987 INFO L125 PetriNetUnfolderBase]: For 58552/59114 co-relation queries the response was YES. [2025-03-04 15:20:59,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35611 conditions, 7676 events. 3421/7676 cut-off events. For 58552/59114 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 58093 event pairs, 138 based on Foata normal form. 249/7910 useless extension candidates. Maximal degree in co-relation 35542. Up to 1627 conditions per place. [2025-03-04 15:20:59,060 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 511 selfloop transitions, 266 changer transitions 15/815 dead transitions. [2025-03-04 15:20:59,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 815 transitions, 11704 flow [2025-03-04 15:20:59,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:20:59,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:20:59,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 324 transitions. [2025-03-04 15:20:59,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6078799249530957 [2025-03-04 15:20:59,061 INFO L175 Difference]: Start difference. First operand has 173 places, 354 transitions, 4527 flow. Second operand 13 states and 324 transitions. [2025-03-04 15:20:59,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 815 transitions, 11704 flow [2025-03-04 15:20:59,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 815 transitions, 11332 flow, removed 113 selfloop flow, removed 11 redundant places. [2025-03-04 15:20:59,306 INFO L231 Difference]: Finished difference. Result has 176 places, 496 transitions, 6796 flow [2025-03-04 15:20:59,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4211, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=6796, PETRI_PLACES=176, PETRI_TRANSITIONS=496} [2025-03-04 15:20:59,307 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 138 predicate places. [2025-03-04 15:20:59,307 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 496 transitions, 6796 flow [2025-03-04 15:20:59,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:59,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:59,307 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:59,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 15:20:59,307 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:59,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:59,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1237896047, now seen corresponding path program 1 times [2025-03-04 15:20:59,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:59,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560391721] [2025-03-04 15:20:59,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:59,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:59,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:20:59,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:20:59,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:59,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:59,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:20:59,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:59,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560391721] [2025-03-04 15:20:59,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560391721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:59,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:59,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:20:59,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77286053] [2025-03-04 15:20:59,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:59,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:20:59,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:59,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:20:59,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:20:59,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-03-04 15:20:59,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 496 transitions, 6796 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-03-04 15:20:59,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:59,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-03-04 15:20:59,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:00,356 INFO L124 PetriNetUnfolderBase]: 3686/7932 cut-off events. [2025-03-04 15:21:00,356 INFO L125 PetriNetUnfolderBase]: For 66202/66753 co-relation queries the response was YES. [2025-03-04 15:21:00,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40328 conditions, 7932 events. 3686/7932 cut-off events. For 66202/66753 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 58618 event pairs, 670 based on Foata normal form. 549/8421 useless extension candidates. Maximal degree in co-relation 40262. Up to 3753 conditions per place. [2025-03-04 15:21:00,421 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 497 selfloop transitions, 133 changer transitions 0/649 dead transitions. [2025-03-04 15:21:00,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 649 transitions, 10077 flow [2025-03-04 15:21:00,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:21:00,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:21:00,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2025-03-04 15:21:00,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6524390243902439 [2025-03-04 15:21:00,421 INFO L175 Difference]: Start difference. First operand has 176 places, 496 transitions, 6796 flow. Second operand 4 states and 107 transitions. [2025-03-04 15:21:00,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 649 transitions, 10077 flow [2025-03-04 15:21:00,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 649 transitions, 9945 flow, removed 66 selfloop flow, removed 1 redundant places. [2025-03-04 15:21:00,725 INFO L231 Difference]: Finished difference. Result has 180 places, 518 transitions, 7559 flow [2025-03-04 15:21:00,725 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6588, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=7559, PETRI_PLACES=180, PETRI_TRANSITIONS=518} [2025-03-04 15:21:00,726 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 142 predicate places. [2025-03-04 15:21:00,726 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 518 transitions, 7559 flow [2025-03-04 15:21:00,726 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-03-04 15:21:00,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:00,726 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:00,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 15:21:00,726 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting workerErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:21:00,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:00,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1247723662, now seen corresponding path program 1 times [2025-03-04 15:21:00,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:00,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404324997] [2025-03-04 15:21:00,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:00,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:00,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:21:00,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:21:00,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:00,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:00,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:00,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:00,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404324997] [2025-03-04 15:21:00,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404324997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:00,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:00,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 15:21:00,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174771598] [2025-03-04 15:21:00,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:00,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:21:00,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:00,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:21:00,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:21:00,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2025-03-04 15:21:00,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 518 transitions, 7559 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:00,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:00,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2025-03-04 15:21:00,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:02,850 INFO L124 PetriNetUnfolderBase]: 5706/11714 cut-off events. [2025-03-04 15:21:02,851 INFO L125 PetriNetUnfolderBase]: For 100456/100756 co-relation queries the response was YES. [2025-03-04 15:21:02,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62372 conditions, 11714 events. 5706/11714 cut-off events. For 100456/100756 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 89446 event pairs, 1195 based on Foata normal form. 191/11901 useless extension candidates. Maximal degree in co-relation 62304. Up to 5107 conditions per place. [2025-03-04 15:21:02,946 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 559 selfloop transitions, 422 changer transitions 6/997 dead transitions. [2025-03-04 15:21:02,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 997 transitions, 15076 flow [2025-03-04 15:21:02,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 15:21:02,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-04 15:21:02,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 444 transitions. [2025-03-04 15:21:02,947 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43317073170731707 [2025-03-04 15:21:02,947 INFO L175 Difference]: Start difference. First operand has 180 places, 518 transitions, 7559 flow. Second operand 25 states and 444 transitions. [2025-03-04 15:21:02,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 997 transitions, 15076 flow [2025-03-04 15:21:03,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 997 transitions, 14978 flow, removed 49 selfloop flow, removed 0 redundant places. [2025-03-04 15:21:03,514 INFO L231 Difference]: Finished difference. Result has 215 places, 737 transitions, 12302 flow [2025-03-04 15:21:03,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7545, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=233, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=12302, PETRI_PLACES=215, PETRI_TRANSITIONS=737} [2025-03-04 15:21:03,515 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 177 predicate places. [2025-03-04 15:21:03,515 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 737 transitions, 12302 flow [2025-03-04 15:21:03,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:03,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:03,515 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:03,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 15:21:03,515 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:21:03,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:03,515 INFO L85 PathProgramCache]: Analyzing trace with hash 279923309, now seen corresponding path program 1 times [2025-03-04 15:21:03,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:03,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520021925] [2025-03-04 15:21:03,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:03,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:03,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:21:03,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:21:03,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:03,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:03,650 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:03,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:03,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520021925] [2025-03-04 15:21:03,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520021925] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:21:03,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733302719] [2025-03-04 15:21:03,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:03,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:21:03,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:21:03,653 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:21:03,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 15:21:03,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:21:03,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:21:03,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:03,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:03,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:21:03,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:21:03,753 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:03,753 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:21:03,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733302719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:03,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:21:03,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 13 [2025-03-04 15:21:03,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388609355] [2025-03-04 15:21:03,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:03,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:21:03,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:03,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:21:03,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-04 15:21:03,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-03-04 15:21:03,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 737 transitions, 12302 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-03-04 15:21:03,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:03,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-03-04 15:21:03,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:05,945 INFO L124 PetriNetUnfolderBase]: 5061/10829 cut-off events. [2025-03-04 15:21:05,945 INFO L125 PetriNetUnfolderBase]: For 116026/116534 co-relation queries the response was YES. [2025-03-04 15:21:05,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62461 conditions, 10829 events. 5061/10829 cut-off events. For 116026/116534 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 84751 event pairs, 1012 based on Foata normal form. 482/11006 useless extension candidates. Maximal degree in co-relation 62380. Up to 6461 conditions per place. [2025-03-04 15:21:06,021 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 725 selfloop transitions, 171 changer transitions 42/962 dead transitions. [2025-03-04 15:21:06,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 962 transitions, 17378 flow [2025-03-04 15:21:06,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:21:06,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:21:06,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2025-03-04 15:21:06,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6341463414634146 [2025-03-04 15:21:06,022 INFO L175 Difference]: Start difference. First operand has 215 places, 737 transitions, 12302 flow. Second operand 6 states and 156 transitions. [2025-03-04 15:21:06,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 962 transitions, 17378 flow [2025-03-04 15:21:06,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 962 transitions, 16940 flow, removed 131 selfloop flow, removed 10 redundant places. [2025-03-04 15:21:06,501 INFO L231 Difference]: Finished difference. Result has 209 places, 736 transitions, 12273 flow [2025-03-04 15:21:06,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=11931, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=736, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=565, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=12273, PETRI_PLACES=209, PETRI_TRANSITIONS=736} [2025-03-04 15:21:06,501 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 171 predicate places. [2025-03-04 15:21:06,501 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 736 transitions, 12273 flow [2025-03-04 15:21:06,502 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-03-04 15:21:06,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:06,502 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:06,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:21:06,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 15:21:06,702 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:21:06,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:06,703 INFO L85 PathProgramCache]: Analyzing trace with hash 87688275, now seen corresponding path program 1 times [2025-03-04 15:21:06,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:06,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647402721] [2025-03-04 15:21:06,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:06,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:06,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:21:06,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:21:06,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:06,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:06,819 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:06,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:06,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647402721] [2025-03-04 15:21:06,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647402721] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:21:06,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183160824] [2025-03-04 15:21:06,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:06,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:21:06,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:21:06,822 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:21:06,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 15:21:06,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:21:06,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:21:06,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:06,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:06,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:21:06,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:21:06,926 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:06,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:21:06,979 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:06,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183160824] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:21:06,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:21:06,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 17 [2025-03-04 15:21:06,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516672629] [2025-03-04 15:21:06,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:21:06,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 15:21:06,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:06,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 15:21:06,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-03-04 15:21:07,027 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2025-03-04 15:21:07,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 736 transitions, 12273 flow. Second operand has 17 states, 17 states have (on average 14.058823529411764) internal successors, (239), 17 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:07,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:07,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2025-03-04 15:21:07,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:12,497 INFO L124 PetriNetUnfolderBase]: 13335/27684 cut-off events. [2025-03-04 15:21:12,498 INFO L125 PetriNetUnfolderBase]: For 267727/269343 co-relation queries the response was YES. [2025-03-04 15:21:12,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156877 conditions, 27684 events. 13335/27684 cut-off events. For 267727/269343 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 237440 event pairs, 2095 based on Foata normal form. 1396/28910 useless extension candidates. Maximal degree in co-relation 156798. Up to 7310 conditions per place. [2025-03-04 15:21:12,784 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 1770 selfloop transitions, 393 changer transitions 90/2274 dead transitions. [2025-03-04 15:21:12,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 2274 transitions, 39479 flow [2025-03-04 15:21:12,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 15:21:12,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 15:21:12,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 500 transitions. [2025-03-04 15:21:12,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5543237250554324 [2025-03-04 15:21:12,786 INFO L175 Difference]: Start difference. First operand has 209 places, 736 transitions, 12273 flow. Second operand 22 states and 500 transitions. [2025-03-04 15:21:12,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 2274 transitions, 39479 flow [2025-03-04 15:21:14,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 2274 transitions, 39279 flow, removed 26 selfloop flow, removed 4 redundant places. [2025-03-04 15:21:14,677 INFO L231 Difference]: Finished difference. Result has 235 places, 979 transitions, 17378 flow [2025-03-04 15:21:14,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=11856, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=720, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=221, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=495, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=17378, PETRI_PLACES=235, PETRI_TRANSITIONS=979} [2025-03-04 15:21:14,678 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 197 predicate places. [2025-03-04 15:21:14,678 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 979 transitions, 17378 flow [2025-03-04 15:21:14,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 14.058823529411764) internal successors, (239), 17 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:14,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:14,678 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-03-04 15:21:14,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:21:14,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:21:14,878 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:21:14,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:14,879 INFO L85 PathProgramCache]: Analyzing trace with hash -711875912, now seen corresponding path program 1 times [2025-03-04 15:21:14,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:14,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085701601] [2025-03-04 15:21:14,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:14,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:14,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 15:21:14,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 15:21:14,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:14,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:14,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:14,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:14,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085701601] [2025-03-04 15:21:14,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085701601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:14,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:14,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:21:14,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541883407] [2025-03-04 15:21:14,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:14,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 15:21:14,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:14,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:21:14,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:21:15,003 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2025-03-04 15:21:15,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 979 transitions, 17378 flow. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:15,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:15,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2025-03-04 15:21:15,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:28,616 INFO L124 PetriNetUnfolderBase]: 27575/55471 cut-off events. [2025-03-04 15:21:28,616 INFO L125 PetriNetUnfolderBase]: For 660115/662171 co-relation queries the response was YES. [2025-03-04 15:21:29,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341330 conditions, 55471 events. 27575/55471 cut-off events. For 660115/662171 co-relation queries the response was YES. Maximal size of possible extension queue 998. Compared 512919 event pairs, 4911 based on Foata normal form. 1648/56728 useless extension candidates. Maximal degree in co-relation 341242. Up to 19668 conditions per place. [2025-03-04 15:21:29,869 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 1259 selfloop transitions, 1357 changer transitions 2/2635 dead transitions. [2025-03-04 15:21:29,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 2635 transitions, 51045 flow [2025-03-04 15:21:29,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 15:21:29,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 15:21:29,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 332 transitions. [2025-03-04 15:21:29,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5398373983739837 [2025-03-04 15:21:29,871 INFO L175 Difference]: Start difference. First operand has 235 places, 979 transitions, 17378 flow. Second operand 15 states and 332 transitions. [2025-03-04 15:21:29,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 2635 transitions, 51045 flow [2025-03-04 15:21:36,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 2635 transitions, 50609 flow, removed 77 selfloop flow, removed 7 redundant places. [2025-03-04 15:21:36,346 INFO L231 Difference]: Finished difference. Result has 255 places, 2179 transitions, 45675 flow [2025-03-04 15:21:36,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=17141, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=979, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=363, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=45675, PETRI_PLACES=255, PETRI_TRANSITIONS=2179} [2025-03-04 15:21:36,348 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 217 predicate places. [2025-03-04 15:21:36,348 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 2179 transitions, 45675 flow [2025-03-04 15:21:36,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:36,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:36,348 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-03-04 15:21:36,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 15:21:36,348 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:21:36,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:36,348 INFO L85 PathProgramCache]: Analyzing trace with hash -871321590, now seen corresponding path program 2 times [2025-03-04 15:21:36,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:36,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049719878] [2025-03-04 15:21:36,348 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:21:36,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:36,353 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 15:21:36,355 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 28 statements. [2025-03-04 15:21:36,355 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:21:36,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:36,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:21:36,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:36,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049719878] [2025-03-04 15:21:36,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049719878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:36,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:36,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:21:36,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135248737] [2025-03-04 15:21:36,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:36,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 15:21:36,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:36,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:21:36,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:21:36,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2025-03-04 15:21:36,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 2179 transitions, 45675 flow. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:36,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:36,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2025-03-04 15:21:36,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand