./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread/reorder_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/reorder_2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eaeb1d72262bd1e189945b98598b3acb68c08676109949c39074605b8c62cb69 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:32:49,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:32:49,465 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:32:49,469 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:32:49,469 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:32:49,482 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:32:49,483 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:32:49,483 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:32:49,483 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:32:49,483 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:32:49,483 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:32:49,483 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:32:49,484 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:32:49,484 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:32:49,484 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:32:49,484 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:32:49,484 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:32:49,484 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:32:49,484 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:32:49,484 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:32:49,484 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:32:49,485 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:32:49,485 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:32:49,485 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:32:49,485 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:32:49,485 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:32:49,485 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:32:49,485 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:32:49,485 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:32:49,485 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:32:49,485 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:32:49,485 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:32:49,485 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:32:49,486 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:32:49,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:32:49,486 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:32:49,486 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:32:49,486 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:32:49,486 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:32:49,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:32:49,486 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:32:49,486 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:32:49,486 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:32:49,486 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:32:49,487 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:32:49,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:32:49,487 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:32:49,487 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:32:49,487 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:32:49,487 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:32:49,487 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eaeb1d72262bd1e189945b98598b3acb68c08676109949c39074605b8c62cb69 [2025-01-10 06:32:49,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:32:49,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:32:49,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:32:49,716 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:32:49,716 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:32:49,716 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/reorder_2.i [2025-01-10 06:32:50,859 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e07bee09/5a73f3e04939482f812111ad2d7ee336/FLAG4dc4e4ad6 [2025-01-10 06:32:51,185 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:32:51,185 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/reorder_2.i [2025-01-10 06:32:51,205 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e07bee09/5a73f3e04939482f812111ad2d7ee336/FLAG4dc4e4ad6 [2025-01-10 06:32:51,218 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e07bee09/5a73f3e04939482f812111ad2d7ee336 [2025-01-10 06:32:51,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:32:51,222 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:32:51,224 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:32:51,224 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:32:51,227 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:32:51,228 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:32:51" (1/1) ... [2025-01-10 06:32:51,228 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ece7a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:51, skipping insertion in model container [2025-01-10 06:32:51,228 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:32:51" (1/1) ... [2025-01-10 06:32:51,263 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:32:51,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:32:51,580 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:32:51,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:32:51,682 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:32:51,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:51 WrapperNode [2025-01-10 06:32:51,684 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:32:51,686 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:32:51,686 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:32:51,686 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:32:51,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:51" (1/1) ... [2025-01-10 06:32:51,706 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:51" (1/1) ... [2025-01-10 06:32:51,727 INFO L138 Inliner]: procedures = 372, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 133 [2025-01-10 06:32:51,730 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:32:51,730 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:32:51,730 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:32:51,730 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:32:51,737 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:51" (1/1) ... [2025-01-10 06:32:51,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:51" (1/1) ... [2025-01-10 06:32:51,739 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:51" (1/1) ... [2025-01-10 06:32:51,750 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-01-10 06:32:51,750 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:51" (1/1) ... [2025-01-10 06:32:51,750 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:51" (1/1) ... [2025-01-10 06:32:51,755 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:51" (1/1) ... [2025-01-10 06:32:51,755 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:51" (1/1) ... [2025-01-10 06:32:51,757 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:51" (1/1) ... [2025-01-10 06:32:51,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:51" (1/1) ... [2025-01-10 06:32:51,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:51" (1/1) ... [2025-01-10 06:32:51,760 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:32:51,761 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:32:51,761 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:32:51,761 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:32:51,762 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:51" (1/1) ... [2025-01-10 06:32:51,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:32:51,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:32:51,789 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:32:51,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:32:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 06:32:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:32:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:32:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 06:32:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:32:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:32:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:32:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure setThread [2025-01-10 06:32:51,807 INFO L138 BoogieDeclarations]: Found implementation of procedure setThread [2025-01-10 06:32:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:32:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:32:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:32:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:32:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure checkThread [2025-01-10 06:32:51,807 INFO L138 BoogieDeclarations]: Found implementation of procedure checkThread [2025-01-10 06:32:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:32:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:32:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:32:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:32:51,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:32:51,808 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:32:51,937 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:32:51,939 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:32:52,106 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:32:52,107 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:32:52,249 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:32:52,250 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:32:52,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:32:52 BoogieIcfgContainer [2025-01-10 06:32:52,251 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:32:52,253 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:32:52,254 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:32:52,257 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:32:52,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:32:51" (1/3) ... [2025-01-10 06:32:52,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bff443f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:32:52, skipping insertion in model container [2025-01-10 06:32:52,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:51" (2/3) ... [2025-01-10 06:32:52,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bff443f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:32:52, skipping insertion in model container [2025-01-10 06:32:52,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:32:52" (3/3) ... [2025-01-10 06:32:52,260 INFO L128 eAbstractionObserver]: Analyzing ICFG reorder_2.i [2025-01-10 06:32:52,271 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:32:52,273 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG reorder_2.i that has 3 procedures, 40 locations, 1 initial locations, 4 loop locations, and 8 error locations. [2025-01-10 06:32:52,273 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:32:52,320 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-10 06:32:52,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 45 transitions, 110 flow [2025-01-10 06:32:52,396 INFO L124 PetriNetUnfolderBase]: 8/100 cut-off events. [2025-01-10 06:32:52,399 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-10 06:32:52,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 100 events. 8/100 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 362 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 50. Up to 7 conditions per place. [2025-01-10 06:32:52,404 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 45 transitions, 110 flow [2025-01-10 06:32:52,407 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 44 transitions, 108 flow [2025-01-10 06:32:52,417 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:32:52,427 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;@1c7fecfb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:32:52,427 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-10 06:32:52,434 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:32:52,435 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-01-10 06:32:52,436 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:32:52,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:52,436 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:32:52,437 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:32:52,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:52,441 INFO L85 PathProgramCache]: Analyzing trace with hash 369599863, now seen corresponding path program 1 times [2025-01-10 06:32:52,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:52,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263622232] [2025-01-10 06:32:52,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:52,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:52,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:32:52,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:32:52,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:52,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:52,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:52,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:52,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263622232] [2025-01-10 06:32:52,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263622232] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:52,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:52,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:32:52,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351385488] [2025-01-10 06:32:52,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:52,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:32:52,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:52,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:32:52,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:32:52,747 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 45 [2025-01-10 06:32:52,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:32:52,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:52,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 45 [2025-01-10 06:32:52,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:52,872 INFO L124 PetriNetUnfolderBase]: 73/269 cut-off events. [2025-01-10 06:32:52,873 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-10 06:32:52,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 269 events. 73/269 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1486 event pairs, 41 based on Foata normal form. 2/224 useless extension candidates. Maximal degree in co-relation 279. Up to 126 conditions per place. [2025-01-10 06:32:52,875 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 31 selfloop transitions, 9 changer transitions 2/60 dead transitions. [2025-01-10 06:32:52,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 60 transitions, 236 flow [2025-01-10 06:32:52,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:32:52,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:32:52,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-01-10 06:32:52,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2025-01-10 06:32:52,886 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 108 flow. Second operand 4 states and 116 transitions. [2025-01-10 06:32:52,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 60 transitions, 236 flow [2025-01-10 06:32:52,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 236 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:32:52,894 INFO L231 Difference]: Finished difference. Result has 47 places, 45 transitions, 142 flow [2025-01-10 06:32:52,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=47, PETRI_TRANSITIONS=45} [2025-01-10 06:32:52,899 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2025-01-10 06:32:52,900 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 45 transitions, 142 flow [2025-01-10 06:32:52,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:32:52,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:52,900 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:32:52,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:32:52,900 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:32:52,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:52,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1429621977, now seen corresponding path program 1 times [2025-01-10 06:32:52,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:52,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844339813] [2025-01-10 06:32:52,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:52,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:52,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:32:52,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:32:52,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:52,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:52,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:52,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:52,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844339813] [2025-01-10 06:32:52,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844339813] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:52,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:52,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:32:52,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620940092] [2025-01-10 06:32:52,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:52,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:32:52,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:52,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:32:52,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:32:52,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 45 [2025-01-10 06:32:52,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:32:52,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:52,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 45 [2025-01-10 06:32:52,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:53,105 INFO L124 PetriNetUnfolderBase]: 71/251 cut-off events. [2025-01-10 06:32:53,105 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-01-10 06:32:53,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 532 conditions, 251 events. 71/251 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1342 event pairs, 10 based on Foata normal form. 12/250 useless extension candidates. Maximal degree in co-relation 305. Up to 118 conditions per place. [2025-01-10 06:32:53,107 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 32 selfloop transitions, 9 changer transitions 0/57 dead transitions. [2025-01-10 06:32:53,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 57 transitions, 260 flow [2025-01-10 06:32:53,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:32:53,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:32:53,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2025-01-10 06:32:53,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2025-01-10 06:32:53,111 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 142 flow. Second operand 4 states and 115 transitions. [2025-01-10 06:32:53,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 57 transitions, 260 flow [2025-01-10 06:32:53,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 57 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:32:53,115 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 154 flow [2025-01-10 06:32:53,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2025-01-10 06:32:53,115 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2025-01-10 06:32:53,115 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 154 flow [2025-01-10 06:32:53,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:32:53,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:53,116 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:53,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:32:53,117 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:32:53,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:53,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1546261983, now seen corresponding path program 1 times [2025-01-10 06:32:53,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:53,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283926698] [2025-01-10 06:32:53,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:53,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:53,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:32:53,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:32:53,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:53,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:32:53,148 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:32:53,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:32:53,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:32:53,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:53,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:32:53,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:32:53,188 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:32:53,190 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-01-10 06:32:53,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-01-10 06:32:53,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-01-10 06:32:53,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-01-10 06:32:53,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-01-10 06:32:53,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-01-10 06:32:53,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-01-10 06:32:53,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-01-10 06:32:53,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-01-10 06:32:53,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 10 remaining) [2025-01-10 06:32:53,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:32:53,194 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-10 06:32:53,196 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:32:53,196 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 06:32:53,212 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-01-10 06:32:53,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 59 transitions, 162 flow [2025-01-10 06:32:53,236 INFO L124 PetriNetUnfolderBase]: 57/387 cut-off events. [2025-01-10 06:32:53,236 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-01-10 06:32:53,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 387 events. 57/387 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2203 event pairs, 2 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 237. Up to 32 conditions per place. [2025-01-10 06:32:53,237 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 59 transitions, 162 flow [2025-01-10 06:32:53,239 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 58 transitions, 160 flow [2025-01-10 06:32:53,240 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:32:53,241 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;@1c7fecfb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:32:53,241 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-10 06:32:53,244 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:32:53,244 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-01-10 06:32:53,244 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:32:53,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:53,244 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:32:53,244 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:32:53,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:53,244 INFO L85 PathProgramCache]: Analyzing trace with hash 424002936, now seen corresponding path program 1 times [2025-01-10 06:32:53,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:53,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526386947] [2025-01-10 06:32:53,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:53,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:53,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:32:53,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:32:53,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:53,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:53,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:53,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:53,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526386947] [2025-01-10 06:32:53,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526386947] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:53,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:53,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:32:53,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237235553] [2025-01-10 06:32:53,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:53,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:32:53,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:53,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:32:53,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:32:53,312 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 59 [2025-01-10 06:32:53,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 58 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:32:53,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:53,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 59 [2025-01-10 06:32:53,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:53,630 INFO L124 PetriNetUnfolderBase]: 1575/3507 cut-off events. [2025-01-10 06:32:53,630 INFO L125 PetriNetUnfolderBase]: For 378/378 co-relation queries the response was YES. [2025-01-10 06:32:53,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6602 conditions, 3507 events. 1575/3507 cut-off events. For 378/378 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 29628 event pairs, 669 based on Foata normal form. 2/3058 useless extension candidates. Maximal degree in co-relation 2329. Up to 1361 conditions per place. [2025-01-10 06:32:53,651 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 53 selfloop transitions, 9 changer transitions 0/86 dead transitions. [2025-01-10 06:32:53,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 86 transitions, 364 flow [2025-01-10 06:32:53,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:32:53,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:32:53,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2025-01-10 06:32:53,654 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6779661016949152 [2025-01-10 06:32:53,655 INFO L175 Difference]: Start difference. First operand has 59 places, 58 transitions, 160 flow. Second operand 4 states and 160 transitions. [2025-01-10 06:32:53,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 86 transitions, 364 flow [2025-01-10 06:32:53,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 86 transitions, 364 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:32:53,658 INFO L231 Difference]: Finished difference. Result has 65 places, 66 transitions, 232 flow [2025-01-10 06:32:53,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=232, PETRI_PLACES=65, PETRI_TRANSITIONS=66} [2025-01-10 06:32:53,659 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 6 predicate places. [2025-01-10 06:32:53,660 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 232 flow [2025-01-10 06:32:53,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:32:53,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:53,660 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:32:53,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:32:53,661 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:32:53,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:53,661 INFO L85 PathProgramCache]: Analyzing trace with hash 256643664, now seen corresponding path program 1 times [2025-01-10 06:32:53,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:53,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797302962] [2025-01-10 06:32:53,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:53,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:53,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:32:53,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:32:53,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:53,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:53,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:53,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:53,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797302962] [2025-01-10 06:32:53,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797302962] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:53,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:53,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:32:53,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337460554] [2025-01-10 06:32:53,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:53,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:32:53,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:53,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:32:53,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:32:53,749 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 59 [2025-01-10 06:32:53,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 66 transitions, 232 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:32:53,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:53,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 59 [2025-01-10 06:32:53,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:54,105 INFO L124 PetriNetUnfolderBase]: 1663/3567 cut-off events. [2025-01-10 06:32:54,105 INFO L125 PetriNetUnfolderBase]: For 923/923 co-relation queries the response was YES. [2025-01-10 06:32:54,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7484 conditions, 3567 events. 1663/3567 cut-off events. For 923/923 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 29817 event pairs, 710 based on Foata normal form. 28/3342 useless extension candidates. Maximal degree in co-relation 2629. Up to 1497 conditions per place. [2025-01-10 06:32:54,126 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 55 selfloop transitions, 9 changer transitions 0/88 dead transitions. [2025-01-10 06:32:54,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 88 transitions, 428 flow [2025-01-10 06:32:54,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:32:54,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:32:54,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 162 transitions. [2025-01-10 06:32:54,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6864406779661016 [2025-01-10 06:32:54,127 INFO L175 Difference]: Start difference. First operand has 65 places, 66 transitions, 232 flow. Second operand 4 states and 162 transitions. [2025-01-10 06:32:54,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 88 transitions, 428 flow [2025-01-10 06:32:54,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 88 transitions, 428 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:32:54,133 INFO L231 Difference]: Finished difference. Result has 70 places, 67 transitions, 268 flow [2025-01-10 06:32:54,133 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=268, PETRI_PLACES=70, PETRI_TRANSITIONS=67} [2025-01-10 06:32:54,133 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 11 predicate places. [2025-01-10 06:32:54,133 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 67 transitions, 268 flow [2025-01-10 06:32:54,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:32:54,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:54,133 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:54,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:32:54,134 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:32:54,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:54,134 INFO L85 PathProgramCache]: Analyzing trace with hash -108203986, now seen corresponding path program 1 times [2025-01-10 06:32:54,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:54,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677494814] [2025-01-10 06:32:54,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:54,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:54,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:32:54,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:32:54,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:54,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:54,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:54,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:54,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677494814] [2025-01-10 06:32:54,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677494814] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:54,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:54,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:32:54,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329573353] [2025-01-10 06:32:54,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:54,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:32:54,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:54,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:32:54,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:32:54,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 59 [2025-01-10 06:32:54,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 67 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:32:54,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:54,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 59 [2025-01-10 06:32:54,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:54,563 INFO L124 PetriNetUnfolderBase]: 1571/3471 cut-off events. [2025-01-10 06:32:54,564 INFO L125 PetriNetUnfolderBase]: For 1508/1508 co-relation queries the response was YES. [2025-01-10 06:32:54,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7753 conditions, 3471 events. 1571/3471 cut-off events. For 1508/1508 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 29078 event pairs, 336 based on Foata normal form. 4/3240 useless extension candidates. Maximal degree in co-relation 2751. Up to 1332 conditions per place. [2025-01-10 06:32:54,582 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 54 selfloop transitions, 11 changer transitions 0/89 dead transitions. [2025-01-10 06:32:54,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 89 transitions, 464 flow [2025-01-10 06:32:54,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:32:54,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:32:54,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 210 transitions. [2025-01-10 06:32:54,584 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5932203389830508 [2025-01-10 06:32:54,584 INFO L175 Difference]: Start difference. First operand has 70 places, 67 transitions, 268 flow. Second operand 6 states and 210 transitions. [2025-01-10 06:32:54,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 89 transitions, 464 flow [2025-01-10 06:32:54,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 89 transitions, 456 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:32:54,589 INFO L231 Difference]: Finished difference. Result has 73 places, 66 transitions, 278 flow [2025-01-10 06:32:54,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=278, PETRI_PLACES=73, PETRI_TRANSITIONS=66} [2025-01-10 06:32:54,591 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 14 predicate places. [2025-01-10 06:32:54,591 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 66 transitions, 278 flow [2025-01-10 06:32:54,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:32:54,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:54,592 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 06:32:54,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:32:54,592 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:32:54,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:54,592 INFO L85 PathProgramCache]: Analyzing trace with hash 940644156, now seen corresponding path program 1 times [2025-01-10 06:32:54,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:54,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130958444] [2025-01-10 06:32:54,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:54,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:54,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:32:54,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:32:54,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:54,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:54,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:54,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:54,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130958444] [2025-01-10 06:32:54,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130958444] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:54,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:54,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:32:54,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46786457] [2025-01-10 06:32:54,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:54,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:32:54,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:54,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:32:54,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:32:54,687 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 59 [2025-01-10 06:32:54,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 66 transitions, 278 flow. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:32:54,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:54,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 59 [2025-01-10 06:32:54,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:54,980 INFO L124 PetriNetUnfolderBase]: 1567/3460 cut-off events. [2025-01-10 06:32:54,981 INFO L125 PetriNetUnfolderBase]: For 2075/2075 co-relation queries the response was YES. [2025-01-10 06:32:54,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7854 conditions, 3460 events. 1567/3460 cut-off events. For 2075/2075 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 29012 event pairs, 325 based on Foata normal form. 4/3237 useless extension candidates. Maximal degree in co-relation 2788. Up to 1332 conditions per place. [2025-01-10 06:32:55,004 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 54 selfloop transitions, 12 changer transitions 0/90 dead transitions. [2025-01-10 06:32:55,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 90 transitions, 488 flow [2025-01-10 06:32:55,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:32:55,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:32:55,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 211 transitions. [2025-01-10 06:32:55,008 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.596045197740113 [2025-01-10 06:32:55,008 INFO L175 Difference]: Start difference. First operand has 73 places, 66 transitions, 278 flow. Second operand 6 states and 211 transitions. [2025-01-10 06:32:55,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 90 transitions, 488 flow [2025-01-10 06:32:55,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 90 transitions, 462 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-01-10 06:32:55,012 INFO L231 Difference]: Finished difference. Result has 73 places, 66 transitions, 282 flow [2025-01-10 06:32:55,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=282, PETRI_PLACES=73, PETRI_TRANSITIONS=66} [2025-01-10 06:32:55,013 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 14 predicate places. [2025-01-10 06:32:55,013 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 66 transitions, 282 flow [2025-01-10 06:32:55,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:32:55,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:55,013 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:55,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:32:55,014 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:32:55,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:55,014 INFO L85 PathProgramCache]: Analyzing trace with hash -120456977, now seen corresponding path program 1 times [2025-01-10 06:32:55,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:55,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530251409] [2025-01-10 06:32:55,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:55,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:55,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:32:55,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:32:55,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:55,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:55,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:55,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:55,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530251409] [2025-01-10 06:32:55,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530251409] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:55,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:55,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:32:55,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047896490] [2025-01-10 06:32:55,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:55,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:32:55,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:55,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:32:55,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:32:55,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 59 [2025-01-10 06:32:55,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 66 transitions, 282 flow. Second operand has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:32:55,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:55,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 59 [2025-01-10 06:32:55,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:55,442 INFO L124 PetriNetUnfolderBase]: 1615/3476 cut-off events. [2025-01-10 06:32:55,442 INFO L125 PetriNetUnfolderBase]: For 2086/2086 co-relation queries the response was YES. [2025-01-10 06:32:55,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7915 conditions, 3476 events. 1615/3476 cut-off events. For 2086/2086 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 29130 event pairs, 323 based on Foata normal form. 28/3279 useless extension candidates. Maximal degree in co-relation 2803. Up to 1304 conditions per place. [2025-01-10 06:32:55,458 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 60 selfloop transitions, 12 changer transitions 0/94 dead transitions. [2025-01-10 06:32:55,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 94 transitions, 504 flow [2025-01-10 06:32:55,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:32:55,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:32:55,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 216 transitions. [2025-01-10 06:32:55,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6101694915254238 [2025-01-10 06:32:55,459 INFO L175 Difference]: Start difference. First operand has 73 places, 66 transitions, 282 flow. Second operand 6 states and 216 transitions. [2025-01-10 06:32:55,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 94 transitions, 504 flow [2025-01-10 06:32:55,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 94 transitions, 491 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:32:55,463 INFO L231 Difference]: Finished difference. Result has 74 places, 65 transitions, 289 flow [2025-01-10 06:32:55,463 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=289, PETRI_PLACES=74, PETRI_TRANSITIONS=65} [2025-01-10 06:32:55,464 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 15 predicate places. [2025-01-10 06:32:55,464 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 65 transitions, 289 flow [2025-01-10 06:32:55,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:32:55,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:55,464 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:55,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:32:55,464 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:32:55,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:55,465 INFO L85 PathProgramCache]: Analyzing trace with hash 560801447, now seen corresponding path program 1 times [2025-01-10 06:32:55,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:55,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184096987] [2025-01-10 06:32:55,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:55,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:55,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:32:55,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:32:55,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:55,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:55,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:55,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:55,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184096987] [2025-01-10 06:32:55,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184096987] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:55,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:55,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:32:55,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699032628] [2025-01-10 06:32:55,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:55,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:32:55,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:55,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:32:55,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:32:55,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 59 [2025-01-10 06:32:55,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 65 transitions, 289 flow. Second operand has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:32:55,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:55,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 59 [2025-01-10 06:32:55,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:55,825 INFO L124 PetriNetUnfolderBase]: 1567/3407 cut-off events. [2025-01-10 06:32:55,825 INFO L125 PetriNetUnfolderBase]: For 2228/2228 co-relation queries the response was YES. [2025-01-10 06:32:55,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7949 conditions, 3407 events. 1567/3407 cut-off events. For 2228/2228 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 28549 event pairs, 483 based on Foata normal form. 28/3238 useless extension candidates. Maximal degree in co-relation 2831. Up to 1304 conditions per place. [2025-01-10 06:32:55,838 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 60 selfloop transitions, 13 changer transitions 0/95 dead transitions. [2025-01-10 06:32:55,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 95 transitions, 526 flow [2025-01-10 06:32:55,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:32:55,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:32:55,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 217 transitions. [2025-01-10 06:32:55,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6129943502824858 [2025-01-10 06:32:55,841 INFO L175 Difference]: Start difference. First operand has 74 places, 65 transitions, 289 flow. Second operand 6 states and 217 transitions. [2025-01-10 06:32:55,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 95 transitions, 526 flow [2025-01-10 06:32:55,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 95 transitions, 498 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-01-10 06:32:55,846 INFO L231 Difference]: Finished difference. Result has 74 places, 65 transitions, 294 flow [2025-01-10 06:32:55,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=294, PETRI_PLACES=74, PETRI_TRANSITIONS=65} [2025-01-10 06:32:55,847 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 15 predicate places. [2025-01-10 06:32:55,848 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 65 transitions, 294 flow [2025-01-10 06:32:55,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:32:55,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:55,848 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-01-10 06:32:55,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:32:55,848 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:32:55,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:55,849 INFO L85 PathProgramCache]: Analyzing trace with hash 2015915307, now seen corresponding path program 1 times [2025-01-10 06:32:55,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:55,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997131811] [2025-01-10 06:32:55,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:55,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:55,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:32:55,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:32:55,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:55,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:32:55,869 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:32:55,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:32:55,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:32:55,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:55,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:32:55,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:32:55,883 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:32:55,884 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-01-10 06:32:55,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-01-10 06:32:55,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-01-10 06:32:55,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-01-10 06:32:55,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-01-10 06:32:55,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-01-10 06:32:55,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-01-10 06:32:55,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-01-10 06:32:55,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-01-10 06:32:55,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 10 remaining) [2025-01-10 06:32:55,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:32:55,884 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:55,885 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:32:55,885 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 06:32:55,901 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2025-01-10 06:32:55,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 73 transitions, 218 flow [2025-01-10 06:32:55,964 INFO L124 PetriNetUnfolderBase]: 336/1466 cut-off events. [2025-01-10 06:32:55,964 INFO L125 PetriNetUnfolderBase]: For 419/419 co-relation queries the response was YES. [2025-01-10 06:32:55,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1902 conditions, 1466 events. 336/1466 cut-off events. For 419/419 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 10359 event pairs, 52 based on Foata normal form. 0/1036 useless extension candidates. Maximal degree in co-relation 941. Up to 192 conditions per place. [2025-01-10 06:32:55,967 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 73 transitions, 218 flow [2025-01-10 06:32:55,970 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 72 transitions, 216 flow [2025-01-10 06:32:55,971 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:32:55,971 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;@1c7fecfb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:32:55,971 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-10 06:32:55,973 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:32:55,973 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-01-10 06:32:55,973 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:32:55,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:55,973 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:32:55,973 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:32:55,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:55,973 INFO L85 PathProgramCache]: Analyzing trace with hash 491766279, now seen corresponding path program 1 times [2025-01-10 06:32:55,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:55,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386359676] [2025-01-10 06:32:55,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:55,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:55,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:32:55,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:32:55,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:55,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:56,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:56,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:56,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386359676] [2025-01-10 06:32:56,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386359676] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:56,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:56,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:32:56,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417157337] [2025-01-10 06:32:56,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:56,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:32:56,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:56,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:32:56,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:32:56,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 73 [2025-01-10 06:32:56,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 72 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:32:56,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:56,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 73 [2025-01-10 06:32:56,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:58,521 INFO L124 PetriNetUnfolderBase]: 21857/38845 cut-off events. [2025-01-10 06:32:58,522 INFO L125 PetriNetUnfolderBase]: For 5138/5138 co-relation queries the response was YES. [2025-01-10 06:32:58,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75258 conditions, 38845 events. 21857/38845 cut-off events. For 5138/5138 co-relation queries the response was YES. Maximal size of possible extension queue 1876. Compared 378065 event pairs, 9868 based on Foata normal form. 2/35204 useless extension candidates. Maximal degree in co-relation 22445. Up to 17821 conditions per place. [2025-01-10 06:32:58,733 INFO L140 encePairwiseOnDemand]: 62/73 looper letters, 67 selfloop transitions, 9 changer transitions 0/106 dead transitions. [2025-01-10 06:32:58,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 106 transitions, 472 flow [2025-01-10 06:32:58,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:32:58,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:32:58,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 198 transitions. [2025-01-10 06:32:58,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.678082191780822 [2025-01-10 06:32:58,734 INFO L175 Difference]: Start difference. First operand has 73 places, 72 transitions, 216 flow. Second operand 4 states and 198 transitions. [2025-01-10 06:32:58,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 106 transitions, 472 flow [2025-01-10 06:32:58,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 106 transitions, 472 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:32:58,739 INFO L231 Difference]: Finished difference. Result has 79 places, 80 transitions, 288 flow [2025-01-10 06:32:58,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=288, PETRI_PLACES=79, PETRI_TRANSITIONS=80} [2025-01-10 06:32:58,739 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 6 predicate places. [2025-01-10 06:32:58,739 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 80 transitions, 288 flow [2025-01-10 06:32:58,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:32:58,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:58,740 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:32:58,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:32:58,740 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:32:58,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:58,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1937889607, now seen corresponding path program 1 times [2025-01-10 06:32:58,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:58,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25165440] [2025-01-10 06:32:58,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:58,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:58,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:32:58,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:32:58,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:58,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:58,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:58,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:58,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25165440] [2025-01-10 06:32:58,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25165440] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:58,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:58,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:32:58,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860521900] [2025-01-10 06:32:58,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:58,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:32:58,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:58,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:32:58,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:32:58,789 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 73 [2025-01-10 06:32:58,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 80 transitions, 288 flow. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:32:58,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:58,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 73 [2025-01-10 06:32:58,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:01,268 INFO L124 PetriNetUnfolderBase]: 22713/39641 cut-off events. [2025-01-10 06:33:01,268 INFO L125 PetriNetUnfolderBase]: For 9742/9742 co-relation queries the response was YES. [2025-01-10 06:33:01,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82764 conditions, 39641 events. 22713/39641 cut-off events. For 9742/9742 co-relation queries the response was YES. Maximal size of possible extension queue 1981. Compared 382509 event pairs, 10129 based on Foata normal form. 60/37256 useless extension candidates. Maximal degree in co-relation 25155. Up to 19013 conditions per place. [2025-01-10 06:33:01,550 INFO L140 encePairwiseOnDemand]: 62/73 looper letters, 70 selfloop transitions, 9 changer transitions 0/109 dead transitions. [2025-01-10 06:33:01,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 109 transitions, 540 flow [2025-01-10 06:33:01,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:33:01,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:33:01,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 201 transitions. [2025-01-10 06:33:01,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6883561643835616 [2025-01-10 06:33:01,553 INFO L175 Difference]: Start difference. First operand has 79 places, 80 transitions, 288 flow. Second operand 4 states and 201 transitions. [2025-01-10 06:33:01,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 109 transitions, 540 flow [2025-01-10 06:33:01,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 109 transitions, 540 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:33:01,562 INFO L231 Difference]: Finished difference. Result has 84 places, 81 transitions, 324 flow [2025-01-10 06:33:01,562 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=324, PETRI_PLACES=84, PETRI_TRANSITIONS=81} [2025-01-10 06:33:01,563 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 11 predicate places. [2025-01-10 06:33:01,563 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 81 transitions, 324 flow [2025-01-10 06:33:01,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:33:01,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:01,564 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:01,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:33:01,564 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:33:01,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:01,564 INFO L85 PathProgramCache]: Analyzing trace with hash 275739022, now seen corresponding path program 1 times [2025-01-10 06:33:01,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:01,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104813728] [2025-01-10 06:33:01,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:01,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:01,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:33:01,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:33:01,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:01,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:01,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:01,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:01,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104813728] [2025-01-10 06:33:01,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104813728] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:01,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:01,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:33:01,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312523812] [2025-01-10 06:33:01,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:01,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:33:01,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:01,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:33:01,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:33:01,641 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 73 [2025-01-10 06:33:01,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 81 transitions, 324 flow. Second operand has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:33:01,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:01,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 73 [2025-01-10 06:33:01,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:04,124 INFO L124 PetriNetUnfolderBase]: 21841/38754 cut-off events. [2025-01-10 06:33:04,125 INFO L125 PetriNetUnfolderBase]: For 14580/14580 co-relation queries the response was YES. [2025-01-10 06:33:04,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84454 conditions, 38754 events. 21841/38754 cut-off events. For 14580/14580 co-relation queries the response was YES. Maximal size of possible extension queue 1969. Compared 377326 event pairs, 4839 based on Foata normal form. 12/36475 useless extension candidates. Maximal degree in co-relation 25696. Up to 17653 conditions per place. [2025-01-10 06:33:04,342 INFO L140 encePairwiseOnDemand]: 63/73 looper letters, 70 selfloop transitions, 11 changer transitions 0/111 dead transitions. [2025-01-10 06:33:04,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 111 transitions, 580 flow [2025-01-10 06:33:04,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:33:04,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:33:04,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 262 transitions. [2025-01-10 06:33:04,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5981735159817352 [2025-01-10 06:33:04,345 INFO L175 Difference]: Start difference. First operand has 84 places, 81 transitions, 324 flow. Second operand 6 states and 262 transitions. [2025-01-10 06:33:04,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 111 transitions, 580 flow [2025-01-10 06:33:04,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 111 transitions, 572 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:33:04,362 INFO L231 Difference]: Finished difference. Result has 87 places, 80 transitions, 334 flow [2025-01-10 06:33:04,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=334, PETRI_PLACES=87, PETRI_TRANSITIONS=80} [2025-01-10 06:33:04,363 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 14 predicate places. [2025-01-10 06:33:04,363 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 80 transitions, 334 flow [2025-01-10 06:33:04,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:33:04,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:04,363 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:04,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:33:04,363 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:33:04,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:04,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1023197578, now seen corresponding path program 1 times [2025-01-10 06:33:04,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:04,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859109866] [2025-01-10 06:33:04,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:04,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:04,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:33:04,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:33:04,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:04,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:04,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:04,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:04,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859109866] [2025-01-10 06:33:04,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859109866] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:04,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:04,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:33:04,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100555239] [2025-01-10 06:33:04,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:04,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:33:04,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:04,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:33:04,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:33:04,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 73 [2025-01-10 06:33:04,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 80 transitions, 334 flow. Second operand has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:33:04,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:04,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 73 [2025-01-10 06:33:04,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:07,431 INFO L124 PetriNetUnfolderBase]: 22269/38900 cut-off events. [2025-01-10 06:33:07,432 INFO L125 PetriNetUnfolderBase]: For 19491/19491 co-relation queries the response was YES. [2025-01-10 06:33:07,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85932 conditions, 38900 events. 22269/38900 cut-off events. For 19491/19491 co-relation queries the response was YES. Maximal size of possible extension queue 1975. Compared 375073 event pairs, 4569 based on Foata normal form. 180/36815 useless extension candidates. Maximal degree in co-relation 26221. Up to 15201 conditions per place. [2025-01-10 06:33:07,645 INFO L140 encePairwiseOnDemand]: 63/73 looper letters, 79 selfloop transitions, 11 changer transitions 0/119 dead transitions. [2025-01-10 06:33:07,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 119 transitions, 626 flow [2025-01-10 06:33:07,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:33:07,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:33:07,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 271 transitions. [2025-01-10 06:33:07,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6187214611872146 [2025-01-10 06:33:07,647 INFO L175 Difference]: Start difference. First operand has 87 places, 80 transitions, 334 flow. Second operand 6 states and 271 transitions. [2025-01-10 06:33:07,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 119 transitions, 626 flow [2025-01-10 06:33:07,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 119 transitions, 606 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-01-10 06:33:07,658 INFO L231 Difference]: Finished difference. Result has 88 places, 79 transitions, 332 flow [2025-01-10 06:33:07,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=332, PETRI_PLACES=88, PETRI_TRANSITIONS=79} [2025-01-10 06:33:07,659 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 15 predicate places. [2025-01-10 06:33:07,659 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 79 transitions, 332 flow [2025-01-10 06:33:07,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:33:07,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:07,659 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 06:33:07,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:33:07,659 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:33:07,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:07,659 INFO L85 PathProgramCache]: Analyzing trace with hash -42024413, now seen corresponding path program 1 times [2025-01-10 06:33:07,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:07,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150997451] [2025-01-10 06:33:07,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:07,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:07,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:33:07,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:33:07,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:07,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:07,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:07,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:07,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150997451] [2025-01-10 06:33:07,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150997451] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:07,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:07,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:33:07,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539052214] [2025-01-10 06:33:07,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:07,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:33:07,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:07,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:33:07,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:33:07,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 73 [2025-01-10 06:33:07,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 79 transitions, 332 flow. Second operand has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:33:07,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:07,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 73 [2025-01-10 06:33:07,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:10,321 INFO L124 PetriNetUnfolderBase]: 21837/38539 cut-off events. [2025-01-10 06:33:10,321 INFO L125 PetriNetUnfolderBase]: For 19837/19837 co-relation queries the response was YES. [2025-01-10 06:33:10,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85331 conditions, 38539 events. 21837/38539 cut-off events. For 19837/19837 co-relation queries the response was YES. Maximal size of possible extension queue 1969. Compared 375361 event pairs, 9621 based on Foata normal form. 4/36272 useless extension candidates. Maximal degree in co-relation 26006. Up to 17765 conditions per place. [2025-01-10 06:33:10,734 INFO L140 encePairwiseOnDemand]: 63/73 looper letters, 71 selfloop transitions, 12 changer transitions 0/112 dead transitions. [2025-01-10 06:33:10,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 112 transitions, 614 flow [2025-01-10 06:33:10,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:33:10,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:33:10,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 264 transitions. [2025-01-10 06:33:10,736 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6027397260273972 [2025-01-10 06:33:10,736 INFO L175 Difference]: Start difference. First operand has 88 places, 79 transitions, 332 flow. Second operand 6 states and 264 transitions. [2025-01-10 06:33:10,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 112 transitions, 614 flow [2025-01-10 06:33:10,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 112 transitions, 590 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 06:33:10,747 INFO L231 Difference]: Finished difference. Result has 92 places, 82 transitions, 363 flow [2025-01-10 06:33:10,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=363, PETRI_PLACES=92, PETRI_TRANSITIONS=82} [2025-01-10 06:33:10,748 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 19 predicate places. [2025-01-10 06:33:10,748 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 82 transitions, 363 flow [2025-01-10 06:33:10,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:33:10,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:10,748 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:10,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:33:10,748 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:33:10,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:10,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1654353337, now seen corresponding path program 1 times [2025-01-10 06:33:10,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:10,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572128383] [2025-01-10 06:33:10,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:10,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:10,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:33:10,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:33:10,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:10,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:10,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:10,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:10,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572128383] [2025-01-10 06:33:10,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572128383] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:10,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:10,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:33:10,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485945102] [2025-01-10 06:33:10,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:10,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:33:10,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:10,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:33:10,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:33:10,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 73 [2025-01-10 06:33:10,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 82 transitions, 363 flow. Second operand has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:33:10,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:10,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 73 [2025-01-10 06:33:10,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:13,426 INFO L124 PetriNetUnfolderBase]: 22141/38813 cut-off events. [2025-01-10 06:33:13,426 INFO L125 PetriNetUnfolderBase]: For 19457/19457 co-relation queries the response was YES. [2025-01-10 06:33:13,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85625 conditions, 38813 events. 22141/38813 cut-off events. For 19457/19457 co-relation queries the response was YES. Maximal size of possible extension queue 1975. Compared 374922 event pairs, 7911 based on Foata normal form. 60/36608 useless extension candidates. Maximal degree in co-relation 26101. Up to 17697 conditions per place. [2025-01-10 06:33:13,659 INFO L140 encePairwiseOnDemand]: 63/73 looper letters, 82 selfloop transitions, 13 changer transitions 0/124 dead transitions. [2025-01-10 06:33:13,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 124 transitions, 685 flow [2025-01-10 06:33:13,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:33:13,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:33:13,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 273 transitions. [2025-01-10 06:33:13,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6232876712328768 [2025-01-10 06:33:13,660 INFO L175 Difference]: Start difference. First operand has 92 places, 82 transitions, 363 flow. Second operand 6 states and 273 transitions. [2025-01-10 06:33:13,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 124 transitions, 685 flow [2025-01-10 06:33:13,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 124 transitions, 671 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 06:33:13,674 INFO L231 Difference]: Finished difference. Result has 97 places, 85 transitions, 404 flow [2025-01-10 06:33:13,674 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=404, PETRI_PLACES=97, PETRI_TRANSITIONS=85} [2025-01-10 06:33:13,674 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 24 predicate places. [2025-01-10 06:33:13,674 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 85 transitions, 404 flow [2025-01-10 06:33:13,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:33:13,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:13,675 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:13,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:33:13,675 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:33:13,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:13,675 INFO L85 PathProgramCache]: Analyzing trace with hash -339233261, now seen corresponding path program 1 times [2025-01-10 06:33:13,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:13,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938998090] [2025-01-10 06:33:13,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:13,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:13,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:33:13,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:33:13,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:13,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:13,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:13,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:13,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938998090] [2025-01-10 06:33:13,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938998090] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:13,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:13,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:33:13,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358094299] [2025-01-10 06:33:13,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:13,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:33:13,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:13,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:33:13,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:33:13,716 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 73 [2025-01-10 06:33:13,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 85 transitions, 404 flow. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:33:13,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:13,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 73 [2025-01-10 06:33:13,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:16,779 INFO L124 PetriNetUnfolderBase]: 23397/39147 cut-off events. [2025-01-10 06:33:16,779 INFO L125 PetriNetUnfolderBase]: For 21389/21389 co-relation queries the response was YES. [2025-01-10 06:33:16,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89856 conditions, 39147 events. 23397/39147 cut-off events. For 21389/21389 co-relation queries the response was YES. Maximal size of possible extension queue 1921. Compared 361688 event pairs, 10320 based on Foata normal form. 922/38723 useless extension candidates. Maximal degree in co-relation 27077. Up to 20283 conditions per place. [2025-01-10 06:33:16,997 INFO L140 encePairwiseOnDemand]: 62/73 looper letters, 76 selfloop transitions, 11 changer transitions 0/115 dead transitions. [2025-01-10 06:33:16,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 115 transitions, 674 flow [2025-01-10 06:33:16,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:33:16,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:33:16,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 203 transitions. [2025-01-10 06:33:16,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6952054794520548 [2025-01-10 06:33:16,999 INFO L175 Difference]: Start difference. First operand has 97 places, 85 transitions, 404 flow. Second operand 4 states and 203 transitions. [2025-01-10 06:33:16,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 115 transitions, 674 flow [2025-01-10 06:33:17,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 115 transitions, 662 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:33:17,017 INFO L231 Difference]: Finished difference. Result has 100 places, 86 transitions, 434 flow [2025-01-10 06:33:17,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=434, PETRI_PLACES=100, PETRI_TRANSITIONS=86} [2025-01-10 06:33:17,017 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 27 predicate places. [2025-01-10 06:33:17,017 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 86 transitions, 434 flow [2025-01-10 06:33:17,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:33:17,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:17,018 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-01-10 06:33:17,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 06:33:17,018 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:33:17,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:17,018 INFO L85 PathProgramCache]: Analyzing trace with hash 625534153, now seen corresponding path program 1 times [2025-01-10 06:33:17,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:17,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534576654] [2025-01-10 06:33:17,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:17,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:17,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:33:17,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:33:17,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:17,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:17,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:17,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:17,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534576654] [2025-01-10 06:33:17,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534576654] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:17,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:17,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:33:17,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929056315] [2025-01-10 06:33:17,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:17,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:33:17,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:17,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:33:17,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:33:17,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 73 [2025-01-10 06:33:17,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 86 transitions, 434 flow. Second operand has 8 states, 8 states have (on average 31.625) internal successors, (253), 8 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:33:17,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:17,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 73 [2025-01-10 06:33:17,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:20,176 INFO L124 PetriNetUnfolderBase]: 21825/37374 cut-off events. [2025-01-10 06:33:20,176 INFO L125 PetriNetUnfolderBase]: For 30325/30357 co-relation queries the response was YES. [2025-01-10 06:33:20,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90115 conditions, 37374 events. 21825/37374 cut-off events. For 30325/30357 co-relation queries the response was YES. Maximal size of possible extension queue 1873. Compared 345380 event pairs, 6680 based on Foata normal form. 8/36097 useless extension candidates. Maximal degree in co-relation 47402. Up to 17693 conditions per place. [2025-01-10 06:33:20,399 INFO L140 encePairwiseOnDemand]: 63/73 looper letters, 77 selfloop transitions, 16 changer transitions 0/122 dead transitions. [2025-01-10 06:33:20,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 122 transitions, 735 flow [2025-01-10 06:33:20,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:33:20,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 06:33:20,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 331 transitions. [2025-01-10 06:33:20,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5667808219178082 [2025-01-10 06:33:20,401 INFO L175 Difference]: Start difference. First operand has 100 places, 86 transitions, 434 flow. Second operand 8 states and 331 transitions. [2025-01-10 06:33:20,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 122 transitions, 735 flow [2025-01-10 06:33:20,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 122 transitions, 720 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 06:33:20,449 INFO L231 Difference]: Finished difference. Result has 104 places, 86 transitions, 458 flow [2025-01-10 06:33:20,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=458, PETRI_PLACES=104, PETRI_TRANSITIONS=86} [2025-01-10 06:33:20,449 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 31 predicate places. [2025-01-10 06:33:20,449 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 86 transitions, 458 flow [2025-01-10 06:33:20,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 31.625) internal successors, (253), 8 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:33:20,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:20,450 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:20,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 06:33:20,450 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:33:20,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:20,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1355781408, now seen corresponding path program 1 times [2025-01-10 06:33:20,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:20,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130362803] [2025-01-10 06:33:20,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:20,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:20,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:33:20,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:33:20,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:20,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:20,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:20,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:20,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130362803] [2025-01-10 06:33:20,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130362803] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:20,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:20,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:33:20,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52986644] [2025-01-10 06:33:20,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:20,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:33:20,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:20,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:33:20,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:33:20,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 73 [2025-01-10 06:33:20,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 86 transitions, 458 flow. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:33:20,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:20,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 73 [2025-01-10 06:33:20,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:23,437 INFO L124 PetriNetUnfolderBase]: 23397/37809 cut-off events. [2025-01-10 06:33:23,437 INFO L125 PetriNetUnfolderBase]: For 31971/31971 co-relation queries the response was YES. [2025-01-10 06:33:23,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94037 conditions, 37809 events. 23397/37809 cut-off events. For 31971/31971 co-relation queries the response was YES. Maximal size of possible extension queue 1808. Compared 332099 event pairs, 11720 based on Foata normal form. 1330/38931 useless extension candidates. Maximal degree in co-relation 51068. Up to 20283 conditions per place. [2025-01-10 06:33:23,712 INFO L140 encePairwiseOnDemand]: 62/73 looper letters, 76 selfloop transitions, 12 changer transitions 0/115 dead transitions. [2025-01-10 06:33:23,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 115 transitions, 728 flow [2025-01-10 06:33:23,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:33:23,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:33:23,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 203 transitions. [2025-01-10 06:33:23,714 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6952054794520548 [2025-01-10 06:33:23,714 INFO L175 Difference]: Start difference. First operand has 104 places, 86 transitions, 458 flow. Second operand 4 states and 203 transitions. [2025-01-10 06:33:23,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 115 transitions, 728 flow [2025-01-10 06:33:23,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 115 transitions, 687 flow, removed 2 selfloop flow, removed 8 redundant places. [2025-01-10 06:33:23,763 INFO L231 Difference]: Finished difference. Result has 101 places, 87 transitions, 462 flow [2025-01-10 06:33:23,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=462, PETRI_PLACES=101, PETRI_TRANSITIONS=87} [2025-01-10 06:33:23,764 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 28 predicate places. [2025-01-10 06:33:23,764 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 87 transitions, 462 flow [2025-01-10 06:33:23,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:33:23,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:23,764 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:23,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 06:33:23,764 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:33:23,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:23,764 INFO L85 PathProgramCache]: Analyzing trace with hash -646538077, now seen corresponding path program 1 times [2025-01-10 06:33:23,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:23,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463419033] [2025-01-10 06:33:23,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:23,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:23,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:33:23,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:33:23,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:23,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:23,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:23,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:23,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463419033] [2025-01-10 06:33:23,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463419033] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:23,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:23,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:33:23,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979814450] [2025-01-10 06:33:23,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:23,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:33:23,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:23,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:33:23,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:33:23,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 73 [2025-01-10 06:33:23,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 87 transitions, 462 flow. Second operand has 8 states, 8 states have (on average 31.75) internal successors, (254), 8 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:33:23,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:23,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 73 [2025-01-10 06:33:23,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:26,534 INFO L124 PetriNetUnfolderBase]: 21825/36027 cut-off events. [2025-01-10 06:33:26,534 INFO L125 PetriNetUnfolderBase]: For 34351/34351 co-relation queries the response was YES. [2025-01-10 06:33:26,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93356 conditions, 36027 events. 21825/36027 cut-off events. For 34351/34351 co-relation queries the response was YES. Maximal size of possible extension queue 1760. Compared 325557 event pairs, 5996 based on Foata normal form. 120/36134 useless extension candidates. Maximal degree in co-relation 62289. Up to 16073 conditions per place. [2025-01-10 06:33:26,756 INFO L140 encePairwiseOnDemand]: 63/73 looper letters, 92 selfloop transitions, 17 changer transitions 0/137 dead transitions. [2025-01-10 06:33:26,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 137 transitions, 825 flow [2025-01-10 06:33:26,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:33:26,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 06:33:26,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 346 transitions. [2025-01-10 06:33:26,757 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5924657534246576 [2025-01-10 06:33:26,758 INFO L175 Difference]: Start difference. First operand has 101 places, 87 transitions, 462 flow. Second operand 8 states and 346 transitions. [2025-01-10 06:33:26,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 137 transitions, 825 flow [2025-01-10 06:33:26,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 137 transitions, 811 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:33:26,877 INFO L231 Difference]: Finished difference. Result has 105 places, 87 transitions, 491 flow [2025-01-10 06:33:26,877 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=491, PETRI_PLACES=105, PETRI_TRANSITIONS=87} [2025-01-10 06:33:26,878 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 32 predicate places. [2025-01-10 06:33:26,878 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 87 transitions, 491 flow [2025-01-10 06:33:26,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 31.75) internal successors, (254), 8 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:33:26,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:26,878 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1] [2025-01-10 06:33:26,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 06:33:26,878 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:33:26,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:26,879 INFO L85 PathProgramCache]: Analyzing trace with hash -157084576, now seen corresponding path program 1 times [2025-01-10 06:33:26,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:26,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601625585] [2025-01-10 06:33:26,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:26,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:26,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:33:26,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:33:26,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:26,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:33:26,904 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:33:26,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:33:26,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:33:26,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:26,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:33:26,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:33:26,918 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:33:26,918 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-01-10 06:33:26,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-01-10 06:33:26,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-01-10 06:33:26,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-01-10 06:33:26,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-01-10 06:33:26,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-01-10 06:33:26,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-01-10 06:33:26,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-01-10 06:33:26,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-01-10 06:33:26,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 10 remaining) [2025-01-10 06:33:26,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 06:33:26,920 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:26,920 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:33:26,920 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-10 06:33:26,946 INFO L143 ThreadInstanceAdder]: Constructed 16 joinOtherThreadTransitions. [2025-01-10 06:33:26,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 87 transitions, 278 flow [2025-01-10 06:33:27,349 INFO L124 PetriNetUnfolderBase]: 1817/5929 cut-off events. [2025-01-10 06:33:27,349 INFO L125 PetriNetUnfolderBase]: For 2144/2144 co-relation queries the response was YES. [2025-01-10 06:33:27,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8070 conditions, 5929 events. 1817/5929 cut-off events. For 2144/2144 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 50827 event pairs, 626 based on Foata normal form. 0/4319 useless extension candidates. Maximal degree in co-relation 3890. Up to 1024 conditions per place. [2025-01-10 06:33:27,359 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 87 transitions, 278 flow [2025-01-10 06:33:27,375 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 86 transitions, 276 flow [2025-01-10 06:33:27,376 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:33:27,376 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;@1c7fecfb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:33:27,376 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-10 06:33:27,378 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:33:27,378 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-01-10 06:33:27,378 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:33:27,378 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:27,378 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:33:27,378 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 06:33:27,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:27,379 INFO L85 PathProgramCache]: Analyzing trace with hash 572889892, now seen corresponding path program 1 times [2025-01-10 06:33:27,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:27,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43251819] [2025-01-10 06:33:27,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:27,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:27,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:33:27,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:33:27,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:27,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:27,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:27,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:27,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43251819] [2025-01-10 06:33:27,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43251819] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:27,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:27,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:33:27,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317332670] [2025-01-10 06:33:27,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:27,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:33:27,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:27,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:33:27,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:33:27,424 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 87 [2025-01-10 06:33:27,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 86 transitions, 276 flow. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:33:27,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:27,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 87 [2025-01-10 06:33:27,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand